A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink

We consider a noise-limited wireless sensor network that consists of battery-operated nodes which can route information to a mobile sink in a multi-hop fashion. The problem of maximizing the network's lifetime, defined as the period of time during which the network can route a feasible flow to...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications Ročník 7; číslo 3; s. 984 - 994
Hlavní autoři: Gatzianas, M., Georgiadis, L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway, NJ IEEE 01.03.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Applied sciences
Character generation
Computer networks
Distributed algorithms
Equivalence
Exact sciences and technology
Monitoring
Networks
Position (location)
Power generation
Resource management
Routing
Routing (telecommunications)
Sensors
Services and terminals of telecommunications
Spread spectrum communication
Systems, networks and services of telecommunications
Telecommunication network topology
Telecommunications
Telecommunications and information theory
Telemetry. Remote supervision. Telewarning. Remote control
Transmission and modulation (techniques and equipments)
Vectors
Wireless communication
Wireless sensor networks
Performance evaluation
Wireless telecommunication
Routing
subgradient method
duality
Remote sensing
Multihop network
Simulation
Optimal solution
Distributed algorithm
primal recovery
Sensor networks
Localization
Sensor array
network lifetime
ISSN:1536-1276, 1558-2248
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider a noise-limited wireless sensor network that consists of battery-operated nodes which can route information to a mobile sink in a multi-hop fashion. The problem of maximizing the network's lifetime, defined as the period of time during which the network can route a feasible flow to each sink location subject to power/energy constraints, is cast into a linear program, reduced into a simpler equivalent form and solved via dual decomposition. The unknowns are the sink sojourn times and the routing flow vector for each sink location. The presence of a mobile sink presents new challenges but the problem structure can still be exploited to find the optimal solution. A distributed algorithm based on the subgradient method and using the sink as leader is proposed and its performance is evaluated through simulation for random networks. The algorithm's requirements in memory are also provided.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2008.060727