Sciweavers

1592 search results - page 221 / 319
» Source-Tree Routing in Wireless Networks
Sort
View
MOBICOM
2006
ACM
15 years 6 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
121
Voted
ETFA
2006
IEEE
15 years 4 months ago
Verification of The Minimum Cost Forwarding Protocol for Wireless Sensor Networks
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
William D. Henderson, Steven Tron
89
Voted
ICCCN
2007
IEEE
15 years 7 months ago
On Improving the Reliability of Packet Delivery in Dense Wireless Sensor Networks
—Wireless sensor networks (WSN) built using current Berkeley Mica motes exhibit low reliability for packet delivery. There is anecdotal evidence of poor packet delivery rates fro...
JunSuk Shin, Umakishore Ramachandran, Mostafa H. A...
91
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano
MOBICOM
2006
ACM
15 years 6 months ago
Localized algorithm for aggregate fairness in wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
Shigang Chen, Zhan Zhang