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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on wireless communications Vol. 7; no. 3; pp. 984 - 994
Main Authors:	Gatzianas, M., Georgiadis, L.
Format:	Journal Article
Language:	English
Published:	Piscataway, NJ IEEE 01.03.2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!