Sciweavers

Share
528 search results - page 1 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
WINET
2010
159views more  WINET 2010»
11 years 3 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
ICDCS
2006
IEEE
11 years 11 months ago
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...
Shashidhar Gandham, Ying Zhang, Qingfeng Huang
ALGOSENSORS
2009
Springer
11 years 12 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
SRDS
2010
IEEE
11 years 3 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
COMCOM
2010
276views more  COMCOM 2010»
11 years 5 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
books