theoretical results on base station movement problem for sensor network
DESCRIPTION
Theoretical Results on Base Station Movement Problem for Sensor Network. Yi Shi ( 石毅 ) and Y. Thomas Hou ( 侯一釗 ) Virginia Tech, Dept. of ECE. IEEE Infocom 2008. Outline. Introduction Problem Constrained Mobile Base Station (C-MB) Problem - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/1.jpg)
Theoretical Results on Base Station Movement Problem for Sensor Network
Yi Shi ( 石毅 ) and Y. Thomas Hou ( 侯一釗 )Virginia Tech, Dept. of ECE
IEEE Infocom 2008
![Page 2: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/2.jpg)
Outline Introduction Problem
Constrained Mobile Base Station (C-MB) Problem Unconstrained Mobile Base Station (U-MB) Problem
Approach C-MB Problem
Optimal Solution U-MB Problem
(1-)-approximate solution Numerical Results Conclusion
![Page 3: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/3.jpg)
Introduction Sensor Networks
Sensors: gather data, transmit and relay data packets
Low computation power Battery power Small storage space
Base station: data collector Network Lifetime
The first time instance when any of the sensors runs out of energy.
The first time instance when half of the sensors runs out of energy.
The first time instance when the network connectivity is broken up.
BS
VCLAB ezLMS references: [1] [2]
![Page 4: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/4.jpg)
Problem Network Model
The BS is movable Each sensor node i generates data at rate ri Data is transmitted to base station via multi-hop Initial energy at sensor node i is ei
Energy Consumption Modeling
Transmission power modeling
where
Receiving power modeling
i jdij: distance
fij: data rate
ifki: data rate
![Page 5: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/5.jpg)
Unconstrained Mobile Base Station Problem (U-MB)
Goal: Find an optimal moving path for the base station such t
hat the network lifetime is maximized. Optimize base station location (x, y)(t) at any time t such that the net
work lifetime is maximized.
Problem Formulation
flow balance:
i
gki
incoming data rate
ri
outgoing data rategij
Energy constraint
The position of the BS
Time-dependent
Network lifetime
![Page 6: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/6.jpg)
Constrained Mobile Base Station Problem (U-MB) The base station is only allowed to be prese
nt at a finite set of pre-defined points. For example: (x, y)(t) p1, p2, p3, p4, p5 }
p1
p2
p3
p4
p5
Goal:
Find an optimal time-dependent location sequences such that the network lifetime is maximized.
Time-dependent location sequences:
t1
p1
t2
p4
t3
p3
t4
p2
t
p1
……
![Page 7: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/7.jpg)
The Roadmap of the Theoretical Analysis
C-MB Problem1. Transform the problem from time domain to space d
omain Theorem 1
2. Linear programming Optimal Solution
U-MB Problem Change infinite search space to finite search points
U-MB C-MB (1-)-approximate solution by solving C-MB on the fin
ite search points Theorem 2 and 3
t1
p1
t2
p4
t3
p3
t4
p2
……
p1
t1
p2
t2
p3
t3
p4
t4
……
![Page 8: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/8.jpg)
C-MB ProblemFrom time-domain to space-domain
Time Domain: [0, 50]
p1
[50, 90]
p2
[90, 100]
p2
[100, 130]
p1
![Page 9: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/9.jpg)
C-MB ProblemFrom time-domain to space-domain Space domain:
p1
[0, 50] + [100, 130]
p2
[50, 100]
![Page 10: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/10.jpg)
From Time Domain to Space Domain (cont’d) Data routing only depends on base
station location; not time
TheoremThe optimal location-dependent solution can achieve the same maximum network lifetime as that by the optimal time-dependent solution
![Page 11: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/11.jpg)
Linear programming Formulation
Location-dependent
W(p): the cumulative time periods for the BS to be present at location p.
fki(p): normalized data rate
![Page 12: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/12.jpg)
Linear programming FormulationLet
![Page 13: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/13.jpg)
A (1 − ε) Optimal Algorithm to the U-MB ProblemSearch Space
Claim: Optimal base station movement must be within the Smallest Enclosing Disk (SED).
Reference [19]
SED The smallest disk that
covers all sensor nodes Can be found in polynomial-
time
Still infinite search space!
![Page 14: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/14.jpg)
A (1 − ε) Optimal Algorithm Roadmap
1. Discretize transmission cost and distance with (1-Ɛ) optimality guarantee Get a set of distance D[h]
2. Divide SED into subareas By the sequence of circles with radius D[h] at
each sensor3. Represent each subarea by a fictitious cost
point (FCP)4. Compute the optimal total sojourn time and
routing topology for each FCP (or subarea) A linear program
![Page 15: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/15.jpg)
Step 1: Discretize Transmission Cost and Distance
![Page 16: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/16.jpg)
Step 1: Discretize Transmission Cost and Distance
Discretize transmission cost in a geometric sequence, with a factor of (1+Ɛ)
C[1]
C[2]C[3]
C[1] c4B C[2]
c4B: the transmission cost between sensor I and the base station
![Page 17: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/17.jpg)
Step 2: Division on SED SED is divided by the sequence of circles with
radius D[h] and center sensor node i
C[1] c1B C[2]
C[2] c2B C[3]
C[1] c3B C[2]
C[2] c4B C[3]
![Page 18: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/18.jpg)
Step 3: Represent Each Subarea by A Fictitious Cost Point (FCP)
Define a FCP pm for each subarea Am
N-tuple cost vector Pm = (C[2], C[3], C[2], C[3]) Define
C[1] c1B C[2]
C[2] c2B C[3]
C[1] c3B C[2]
C[2] c4B C[3]
Pm
![Page 19: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/19.jpg)
Step 3: Represent Each Subarea by A Fictitious Cost Point (FCP)
Properties: A fictitious point pm is a virtual point, not a physic
al point in the space.
The transmission cost from each sensor node i to pm is the worst case cost for all points in Am
For any point p in this subarea, we have CiB(p)≤CiB (pm)
For any point pAm, we have
![Page 20: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/20.jpg)
Step 4: Finding a (1-Ɛ) Optimal Solution
Find the best total sojourn time W(pm) and routing topology fij(pm) and fiB(pm) for each FCP pm Solve a linear program
(Linear programming for the C-MB problem)
Base station should stay at each subarea Am for total W(pm) of time
Whenever base station is in subarea Am, routing topology should be fij(pm) and fiB(pm)
![Page 21: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/21.jpg)
The (1-) Optimality
(1)
By Theorem 2
(2)
By Theorem 3
![Page 22: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/22.jpg)
Example
=0.2, OA=(0.61, 0.57), RA=0.51 =1, =0.5, =1 17 subareas A1, A2,…,A17
1
2
3
Final solution: T =190.37
Stay A3 for 157 time
Stay A6 for 33.37 time
![Page 23: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/23.jpg)
Numerical Results Settings
Randomly generated networks: 50 and 100 nodes in 1x1 area (all units are normalized)
Data rate at each sensor randomly generated in [0.1, 1]
Initial energy at each sensor randomly generated in [50, 500]
Parameters in energy consumption model: α=β=ρ=1, n=2
Result The obtained network lifetime is at least 95% of the
optimum, i.e., Ɛ is set to 0.05
![Page 24: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/24.jpg)
Result – 50-node Network
Tε=122.30
![Page 25: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/25.jpg)
A Sample Base Station Movement Path
Base station movement path is not unique
Moving time (from one subarea to another) is much smaller than network lifetime
Each sensor can buffer its data when base station is moving and transmit when base station arrives the next subarea
Network lifetime will not change
![Page 26: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/26.jpg)
Result – 100-node Network
![Page 27: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/27.jpg)
Summary Investigated base station movement
problem for sensor networks Developed a (1-Ɛ) approximation
algorithm with polynomial complexity Transform the problem from time domain to
space domain Change infinite search space to finite search
space with (1-Ɛ) optimal guarantee Proved (1-Ɛ) optimality
![Page 28: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/28.jpg)
Proof of Theorem 1
Time domain
Space domain
C-MBC-MB
![Page 29: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/29.jpg)
Proof of Theorem 1
Time domain
Space domain
C-MBC-MB
Indicator function
![Page 30: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/30.jpg)
Proof of Theorem 1
![Page 31: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/31.jpg)
Proof of Lemma 1
(1)
(2)
(3)
![Page 32: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/32.jpg)
Proof of Lemma 1(1)
![Page 33: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/33.jpg)
Proof of Lemma 1 (2)
![Page 34: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/34.jpg)
Proof of Lemma 1(3)
![Page 35: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/35.jpg)
Proof of Theorem 2
![Page 36: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/36.jpg)
Proof of Theorem 2
C-MBU-MB
![Page 37: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/37.jpg)
![Page 38: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/38.jpg)
![Page 39: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/39.jpg)
![Page 40: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/40.jpg)
Proof of Theorem 3
![Page 41: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/41.jpg)
![Page 42: Theoretical Results on Base Station Movement Problem for Sensor Network](https://reader036.vdocuments.net/reader036/viewer/2022062717/56812a44550346895d8d713b/html5/thumbnails/42.jpg)