Sciweavers

524 search results - page 59 / 105
» An Optimal Lower Bound on the Communication Complexity of Ga...
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 10 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICC
2009
IEEE
190views Communications» more  ICC 2009»
13 years 5 months ago
Low Bound of Energy-Latency Trade-Off of Opportunistic Routing in Multi-Hop Networks
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
Ruifeng Zhang, Jean-Marie Gorce, Katia Jaffr&egrav...
IPSN
2005
Springer
14 years 1 months ago
Matched source-channel communication for field estimation in wireless sensor networks
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
Waheed Uz Zaman Bajwa, Akbar M. Sayeed, Robert D. ...
SECON
2007
IEEE
14 years 2 months ago
Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
INFOCOM
2010
IEEE
13 years 5 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu