Sciweavers

2149 search results - page 153 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
101
Voted
DC
2010
15 years 1 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
MOBIWAC
2006
ACM
15 years 7 months ago
Evaluation of multi-radio extensions to AODV for wireless mesh networks
Due to their self-configuring and self-healing capabilities, as well as their low equipment and deployment cost, Wireless Mesh Networks (WMNs) based on commodity hardware present...
Asad Amir Pirzada, Marius Portmann, Jadwiga Induls...
JCO
2006
153views more  JCO 2006»
15 years 1 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
SENSYS
2004
ACM
15 years 7 months ago
Mitigating congestion in wireless sensor networks
Network congestion occurs when offered traffic load exceeds available capacity at any point in a network. In wireless sensor networks, congestion causes overall channel quality t...
Bret Hull, Kyle Jamieson, Hari Balakrishnan
ADHOCNOW
2004
Springer
15 years 7 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi