Sciweavers

2149 search results - page 6 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
MOBICOM
2004
ACM
15 years 3 months ago
SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks
Capacity improvement is one of the principal challenges in wireless networking. We present a link-layer protocol called Slotted Seeded Channel Hopping, or SSCH, that increases the...
Paramvir Bahl, Ranveer Chandra, John Dunagan
ICNP
2005
IEEE
15 years 3 months ago
Stability and Sensitivity for Congestion Control in Wireless Networks with Time Varying Link Capacities
While extensive efforts have been devoted to providing optimization based, distributed congestion control schemes for efficient bandwidth utilization and fair allocation in both ...
Guohua Zhang, Yiyu Wu, Yonghe Liu
ALGOSENSORS
2009
Springer
15 years 4 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
92
Voted
MOBICOM
2009
ACM
15 years 4 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
ECRTS
2007
IEEE
15 years 3 months ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher