MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Performance analysis of exponential backoff
IEEE/ACM Transactions on Networking (TON)
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A survey of practical issues in underwater networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Low-power acoustic modem for dense underwater sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
A MAC protocol for ad-hoc underwater acoustic sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Understanding spatio-temporal uncertainty in medium access with ALOHA protocols
Proceedings of the second workshop on Underwater networks
A CDMA-based medium access control for underwater acoustic sensor networks
IEEE Transactions on Wireless Communications
Understanding and exploiting the acoustic propagation delay in underwater sensor networks
Understanding and exploiting the acoustic propagation delay in underwater sensor networks
Random access game and medium access control design
IEEE/ACM Transactions on Networking (TON)
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
RIPT: A Receiver-Initiated Reservation-Based Protocol for Underwater Acoustic Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The key aspect in the design of any contention-based medium access control (MAC) protocol is the mechanism to measure and resolve simultaneous contention. Generally, terrestrial wireless MACs can only observe success or collision of a contention attempt through carrier sense. An implicit estimate of the number of contenders occurs through repeated observation and changing back-off contention window. Recent work in underwater MAC protocols suggest there it is possible to directly count the number of contenders by exploiting the spatio-temporal uncertainty inherent to high-latency underwater acoustic medium. Prior work has shown how to use counting in underwater MACs, and how to optimize contention windows in radio MACs. In this paper, we quantify bounds to convergence time for MAC protocols employing exact contender counting. We show that perfect counting allows contention to converge quickly, independent of network density, with an asymptotic limit of 3.6 contention rounds on average. We confirm this analysis with simulation of a specific underwater MAC protocol, and suggest the opportunity for the results to generalize for any radio-based MACs that estimate contenders.