Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Variable weight sequences for adaptive scheduled access in MANETs
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Hi-index | 0.00 |
Comparison of schedule and contention based MAC protocols is made difficult by their fundamental differences in approach to medium access control. This paper provides a way in which to analyze and compare MAC protocols regardless of their underlying allocation strategy. To that end a framework is developed in which the persistence of any protocol, contention- or schedule-based, can be measured. The framework is used to measure and compare the persistence levels of two prototypical contention- and schedule-based MACs, IEEE 802.11 and Scheduled p-Persistence. An ideal persistence that provides lexicographically max-min fair access to the channel is characterized, and used as a bandwidth allocation scheme. In addition to reducing the unfairness, simulations employing the ideal persistence values show increased throughput and decreased delay and drop rate when compared to either Scheduled p-Persistence or IEEE 802.11.