Sciweavers

220 search results - page 9 / 44
» Routing in Wireless Networks with Position Trees
Sort
View
DCOSS
2005
Springer
14 years 2 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
GLOBECOM
2007
IEEE
14 years 3 months ago
A TDMA-based Scheduling and Routing Algorithm for Data-Centric Wireless Sensor Networks
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
Yean-Fu Wen, Frank Yeong-Sung Lin, Hung-Shi Wang
INFOCOM
2012
IEEE
11 years 11 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
AINA
2008
IEEE
13 years 10 months ago
Flexible Address Configurations for Tree-Based ZigBee/IEEE 802.15.4 Wireless Networks
A number of IEEE 802.15.4 devices can be connected by a tree topology as proposed by ZigBee specification. Address configuration in tree-based ZigBee networks needs to assign ever...
Li-Hsing Yen, Wei-Ting Tsai
NETWORKING
2007
13 years 10 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...