Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Carrier-sense medium access control (MAC) protocols such as the IEEE 802.11 distributed coordination function (DCF) avoid collisions by holding up pending packet transmission requests when a carrier signal is observed above a certain threshold. However, this often results in unnecessarily conservative communication, thus making it difficult to maximize the utilization of the spatial spectral resource. This paper shows that a higher aggregate throughput can be achieved by allowing more concurrent communications and adjusting the communication distance on the fly, which needs provisions for the following two areas. On the one hand, carrier sense-based MAC protocols do not allow aggressive communication attempts when they are within the carrier senseable area. On the other hand, the communication distance is generally neither short nor adjustable because multihop routing protocols strive for providing minimum hop paths. This paper proposes a new MAC algorithm, called multiple access with salvation army (MASA), which adopts less sensitive carrier sensing to promote more concurrent communications and adjusts the communication distance adaptively via "packet salvaging" at the MAC layer. Extensive simulation based on the ns-2 has shown MASA to outperform the DCF, particularly in terms of packet delay. We also discuss the implementation of MASA based on the DCF specification.
Yu, Chansu; Shin, Kang G.; and Song, Lubo, "Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks" (2007). Electrical Engineering & Computer Science Faculty Publications. 96.
Yu, C., Shin, K. G., & Song, L. (April 01, 2007). Maximizing communication concurrency via link-layer packet salvaging in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 6, 4, 449-462.
© 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.