Data networks (2nd ed.)
Routing Fairness Model for QoS Optimization in Wireless Network
SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Queue back-pressure random access in multihop wireless networks: optimality and stability
IEEE Transactions on Information Theory
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
A Fair MAC Protocol for IEEE 802.11-Based Ad Hoc Networks: Design and Implementation
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
There exist several wireless networks that employ some form of Aloha for sharing the medium. The primary feature of Aloha is the random backoff mechanism, which chooses a random interval of time before transmitting the next packet. This mechanism allows a graceful degradation in per-user throughput as more users are added to the network. The optimal design of the backoff mechansim is well known for a narrow band network in which all users are within range. In this paper, we set up and solve a simple optimization problem to calculate the backoff interval for any network topology, for narrow band or spread spectrum. We then provide a few practical protocol designs based on the optimization and discuss the tradeoffs between them. Finally, we present the results of some preliminary simulations showing the performance of these protocols.