Sciweavers

250 search results - page 45 / 50
» Distributed Algorithms for Coloring and Domination in Wirele...
Sort
View
SENSYS
2006
ACM
14 years 2 months ago
Data compression algorithms for energy-constrained devices in delay tolerant networks
Sensor networks are fundamentally constrained by the difficulty and energy expense of delivering information from sensors to sink. Our work has focused on garnering additional si...
Christopher M. Sadler, Margaret Martonosi
INFOCOM
2005
IEEE
14 years 2 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
MOBICOM
2009
ACM
14 years 3 months ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin
TWC
2008
120views more  TWC 2008»
13 years 8 months ago
Cooperation Enforcement and Learning for Optimizing Packet Forwarding in Autonomous Wireless Networks
In wireless ad hoc networks, autonomous nodes are reluctant to forward others' packets because of the nodes' limited energy. However, such selfishness and noncooperation ...
Charles Pandana, Zhu Han, K. J. Ray Liu
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer