Analysis of backoff protocols for multiple access channels
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Statistical QoS routing for IEEE 802.11 multihop ad hoc networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
In multi-hop wireless networks, flows that traverse the same geographical vicinity contend for the same wireless channel capacity. This is in sharp contrast with wireline networks, where only flows that traverse the same link contend for its capacity. Providing bandwidth guaranteed service in ad hoc networks therefore requires consideration of the underlying interference model. To address this issue, we first separate the underlying scheduling problem from QoS routing with guaranteed bandwidth, by presenting clique (complete subgraph) based constraints as the feasibility conditions for flows. We use packet level simulations in OPNET to compare the throughput achieved by distributed MAC protocol like 802.11b with the capacity predicted by our theoretical constraints. Simulations demonstrate that clique constraints are sufficient if they are satisfied on a network whose link capacities are scaled by a factor β according to the variation in interference range used by our interference model. As an example, we integrate our link capacity estimation model to the QOLSR routing protocol functioning. Simulation results show that QOLSR protocol yields better performance compared to the best-effort OLSR protocol.