A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink
Konferenz: European Wireless 2006 - 12th European Wireless Conference 2006 - Enabling Technologies for Wireless Multimedia Communications
02.04.2006 - 05.04.2006 in Athens, Greece
Tagungsband: European Wireless 2006
Seiten: 7Sprache: EnglischTyp: PDF
Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt
Autoren:
Gatzianas, Marios; Georgiadis, Leonidas (Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, GR, Thessaloniki, Greece)
Georgiadis, Leonidas (Center for Research and Technology Hellas)
Inhalt:
This paper considers an interferencefree 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 time when the first node runs out of energy, subject to power/energy constraints is cast into a linear program and solved via dual formulation. The unknowns are the sink sojourn times and the routing flow vector for each sink location. 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 and message exchanges are also provided.