Sciweavers

2149 search results - page 156 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
15 years 7 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 5 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
ADHOC
2006
97views more  ADHOC 2006»
15 years 1 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
VTC
2008
IEEE
173views Communications» more  VTC 2008»
15 years 8 months ago
A Cross-Layer Framework of QoS Routing and Distributed Scheduling for Mesh Networks
Abstract—Cross-layer routing and scheduling algorithms design for wireless backhaul mesh network has attracted much research interest recently. The network is expected to support...
Chi Harold Liu, Athanasios Gkelias, Kin K. Leung
96
Voted
ICNP
2007
IEEE
15 years 8 months ago
A Probabilistic Coverage Protocol for Wireless Sensor Networks
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
Mohamed Hefeeda, Hossein Ahmadi