Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks

The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. T...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE/ACM transactions on networking Ročník 20; číslo 4; s. 1054 - 1067
Hlavní autori: Shi, Yi, Hou, Y. Thomas
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Approximation algorithm
Base stations
Computer networks
Energy consumption
lifetime
Mathematical analysis
mobile base station
Mobile communication
Mobile computing
Movement
Networks
Operations research
Optimization
Robot sensing systems
Routing
Routing (telecommunications)
sensor networks
Sensors
Stations
Studies
theory
ISSN:1063-6692, 1558-2566
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing some theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon two key intermediate results. In the first result, we show that a time-dependent joint base station movement and flow routing problem can be transformed into a location-dependent problem. In the second result, we show that, for (1- \varepsilon) optimality, the infinite possible locations for base station movement can be reduced to a finite set of locations via several constructive steps [i.e., discretization of energy cost through a geometric sequence, division of a disk into a finite number of subareas, and representation of each subarea with a fictitious cost point (FCP)]. Subsequently, for each FCP, we can obtain the optimal sojourn time for the base station (as well as the corresponding location-dependent flow routing) via a simple linear program. We prove that the proposed solution can guarantee the achieved network lifetime is at least (1- \varepsilon) of the maximum (unknown) network lifetime, where \varepsilon can be made arbitrarily small depending on the required precision.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2011.2171990