Sciweavers

295 search results - page 5 / 59
» An approximation algorithm for the wireless gathering proble...
Sort
View
TPDS
2002
173views more  TPDS 2002»
14 years 9 months ago
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
Stephanie Lindsey, Cauligi S. Raghavendra, Krishna...
ALGOSENSORS
2009
Springer
15 years 4 months ago
Self-stabilizing Deterministic Gathering
Abstract. In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, a...
Yoann Dieudonné, Franck Petit
WINET
2010
159views more  WINET 2010»
14 years 8 months ago
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
Weiping Shang, Peng-Jun Wan, Xiaodong Hu
ALGOSENSORS
2009
Springer
15 years 4 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal