This Article 
 Bibliographic References 
 Add to: 
Contention-Aware Admission Control for Ad Hoc Networks
July/August 2005 (vol. 4 no. 4)
pp. 363-377
An admission control algorithm must coordinate between flows to provide guarantees about how the medium is shared. In wired networks, nodes can monitor the medium to see how much bandwidth is being used. However, in ad hoc networks, communication from one node may consume the bandwidth of neighboring nodes. Therefore, the bandwidth consumption of flows and the available resources to a node are not local concepts, but related to the neighboring nodes in carrier-sensing range. Current solutions do not address how to perform admission control in such an environment so that the admitted flows in the network do not exceed network capacity. In this paper, we present a scalable and efficient admission control framework---Contention-aware Admission Control Protocol (CACP)—to support QoS in ad hoc networks. We present several options for the design of CACP and compare the performance of these options using both mathematical analysis and simulation results. We also demonstrate the effectiveness of CACP compared to existing approaches through extensive simulations.

[1] IEEE Computer Society, “802.11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications,” 1999.
[2] S. Mangold, S. Choi, P. May, O. Klein, G. Hiertz, and L. Stibor, “IEEE 802.11e Wireless LAN for Quality of Service,” Proc. European Wireless, 2002.
[3] R. Rozovsky and P.R. Kumar, “SEEDEX: A MAC Protocol for Ad Hoc Network,” Proc. ACM Symp. Mobile Ad Hoc Networking & Computing, 2001.
[4] G.-S. Ahn, A. Campbell, A. Veres, and L.-H. Sun, “SWAN: Service Differentiation in Stateless Wireless Ad Hoc Networks,” Proc. Infocom, 2002.
[5] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, vol. 353, 1996.
[6] D. Maltz, “Resource Management in Multi-Hop Ad Hoc Networks,” Technical Report CMU CS 00-150, School of Computer Science, Carnegie Mellon Univ., July 2000.
[7] Y.-C. Hsu and T.-C. Tsai, “Bandwidth Routing in Multihop Packet Radio Environment,” Proc. Third Int'l Mobile Computing Workshop, 1997.
[8] T.-W. Chen, J.T. Tsai, and M. Gerla, “QoS Routing Performance in Multihop Multimedia Wireless Networks,” Proc. IEEE Int'l Conf. Universal Personal Comm. (ICUPC), 1997.
[9] C.R. Lin and C.-C. Liu, “An On-Demand QoS Routing Protocol for Mobile Ad Hoc Networks,” IEEE Global Telecomm. Conf., 2000.
[10] C. Zhu and M.S. Corson, “QoS Routing for Mobile Ad Hoc Networks,” Technical Report CSHCN TR 2001-18, Inst. for System Research, Univ. of Maryland, 2001.
[11] C.R. Lin and J.-S. Liu, “QoS Routing in Ad Hoc Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1426-1438, Nov./Dec. 1999.
[12] V. Kanodia, C. Li, A. Sabharwal, B. Sadeghi, and E. Knightly, “Distributed Multi-Hop Scheduling and Medium Access with Delay and Throughput Constraints,” Proc. Seventh Ann. Int'l Conf. Mobile Computing and Networking, 2001.
[13] H. Luo, S. Lu, V. Bharghavan, J. Cheng, and G. Zhong, “A Packet Scheduling Approach to QoS Support in Multihop Wireless Networks,” ACM J. Mobile Networks and Applications, special issue on QoS in heterogeneous wireless networks, 2002.
[14] S.-B. Lee, G.-S. Ahn, X. Zhang, and A. Campbell, “INSIGNIA: An IP-Based Quality of Service Framework for Mobile Ad Hoc Networks,” J. Parallel and Distributed Computing, special issue on wireless and mobile computing and communications, vol. 60, pp. 374-406, 2000.
[15] M.G. Barry, A.T. Campbell, and A. Veres, “Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks,” Proc. Infocom, 2001.
[16] R. Ramanathan and M. Steenstrup, “Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support,” Mobile Networks and Applications, vol. 3, no. 1, pp. 101-119, 1998.
[17] S. Murthy and J.J. Garcia-Luna-Aceves, “A Routing Architecture for Mobile Integrated Services Networks,” Mobile Networks and Applications, vol. 3, no. 4, pp. 391-407, 1999.
[18] S.H. Shah, K. Chen, and K. Nahrstedt, “Dynamic Bandwidth Management for Single-Hop Ad Hoc Wireless Networks,” Proc. IEEE Int'l Conf. Pervasive Computing and Comm., 2003.
[19] M. Kazantzidis, M. Gerla, and S.-J. Lee, “Permissible Throughput Network Feedback for Adaptive Multimedia in AODV MANETs,” IEEE Int'l Conf. Comm., 2001.
[20] K. Fall and K. Varadhan, “NS Notes and Documentation,” The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC, 1997.
[21] G. Bianchi, “Performance Analysis of the IEEE 802. 11 Distributed Coordination Function,” IEEE J. Selected Areas in Comm., vol. 18, no. 3, 2000.
[22] Y. Yang, J. Wang, and R. Kravets, “Achievable Bandwidth Prediction in Multihop Wireless Networks,” Technical Report UIUCDCS-R-2003-2367, Dec. 2003.
[23] P. Gupta and P.R. Kumar, “Capacity of Wireless Networks,” IEEE Trans. Information Theory, no. 2, pp. 388-404, 2000.
[24] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM '94 Conf. Comm. Architectures, Protocols and Applications, 1994.
[25] C. Perkins, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Military Comm. Conf., 1997.
[26] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. INFOCOM, pp. 1405-1413, 1997.
[27] O. Dousse, P. Thiran, and M. Hasler, “Connectivity in Ad-Hoc and Hybrid Networks,” Proc. INFOCOM, pp. 1079-1088, June 2002.

Index Terms:
Index Terms- Admission control, ad hoc network, multihop, QoS routing, Quality of Service, contention-aware, simulations.
Yaling Yang, Robin Kravets, "Contention-Aware Admission Control for Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 4, no. 4, pp. 363-377, July-Aug. 2005, doi:10.1109/TMC.2005.52
Usage of this product signifies your acceptance of the Terms of Use.