This Article 
 Bibliographic References 
 Add to: 
Route Reservation in Ad Hoc Wireless Networks
January 2007 (vol. 6 no. 1)
pp. 56-71
This paper investigates whether and when route reservation-based (RB) communication can yield better delay performance than non-reservation-based (NRB) communication in ad hoc wireless networks. In addition to posing this fundamental question, the requirements (in terms of route discovery, medium access control (MAC) protocol, and pipelining, etc.) for making RB switching superior to NRB switching are also identified. A novel analytical framework is developed and the network performance under both RB and NRB schemes is quantified. It is shown that if the aforementioned requirements are met, then RB schemes can indeed yield better delay performance than NRB schemes. This advantage, however, comes at the expense of lower throughput and goodput compared to NRB schemes.

[1] D. Bertsekas and R. Gallager, Data Networks. Prentice Hall, 1992.
[2] E.M. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Comm. Magazine, vol. 6, no. 2, pp. 46-55, Apr. 1999.
[3] G. Ferrari and O.K. Tonguz, “Performance of Ad Hoc Wireless Networks with Aloha and PR-CSMA MAC Protocols,” Proc. IEEE GLOBECOM, pp. 2824-2829, Dec. 2003.
[4] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999.
[5] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in AdHoc Wireless Networks,” Mobile Computing, T. Imielinski and H.Korth, eds., pp. 153-181, 1996.
[6] V. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM, pp. 1405-1413, Apr. 1997.
[7] S.-J. Lee, M. Gerla, and C.-K. Toh, “A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks,” IEEE Network, vol. 13, no. 4, pp. 48-54, Jul.-Aug. 1999.
[8] S. Das, R. Castaneda, and J. Yan, “Simulation-Based Performance Evaluation of Routing Protocols for Mobile Ad Hoc Networks,” ACM Mobile Networks and Applications, vol. 5, no. 3, pp. 179-189, Sept. 2000.
[9] A. Boukerche, “Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks,” ACM Mobile Networks and Applications, vol. 9, no. 4, pp. 333-342, Aug. 2004.
[10] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[11] N. Bansal and Z. Liu, “Capacity, Delay, and Mobility in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, vol. 2, pp. 1553-1563, Apr. 2003.
[12] E. Perevalov and R. Blum, “Delay-Limited Throughput of Ad Hoc Networks,” IEEE Trans. Comm., vol. 52, no. 11, pp. 1957-1968, Nov. 2004.
[13] M.J. Neely and E. Modiano, “Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks,” Proc. Int'l Conf. Broadband Networks (BROADNET), pp. 428-438, Oct. 2004.
[14] S. Chen and K. Nahrstedt, “Distributed Quality-of-Service Routing in Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1488-1505, Aug. 1999.
[15] C.R. Lin and J. Liu, “QoS Routing in Ad Hoc Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1426-1438, Aug. 1999.
[16] S. Lee, G.-S. Ahn, X. Zhang, and A.T. Campbell, “INSIGNIA: An IP-Based Quality of Service Framework for Mobile Ad Hoc Networks,” J. Parallel and Distributed Computing, vol. 60, pp. 374-406, Apr. 2000.
[17] L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, “RSVP: A New Resource Reservation Protocol,” IEEE Network, vol. 7, no. 5, pp. 8-18, Sept. 1993.
[18] A. Talukdar, B. Badrinath, and A. Acharya, “MRSVP: A Resource Reservation Protocol for an Integrated Services Network with Mobile Hosts,” ACM Wireless Networks, vol. 7, no. 1, pp. 5-19, Jan. 2001.
[19] C.-C. Tseng, G.-C. Lee, and R.-S. Liu, “HMRSVP: A Hierarchical Mobile RSVP Protocol,” Proc. IEEE Int'l Conf. Distributed Computing Systems Workshops (ICDCS), pp. 467-472, Apr. 2001.
[20] S. Panichpapiboon, G. Ferrari, N. Wisitpongphan, and O.K. Tonguz, “Route Reservation in Ad Hoc Networks: Is It a Good Idea?” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), pp. 2045-2050, Mar. 2005.
[21] S. Panichpapiboon, G. Ferrari, and O.K. Tonguz, “Sensor Networks with Random versus Uniform Topology: MAC and Interference Considerations,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 2111-2115, May 2004.
[22] G. Ferrari, B. Baruffini, and O.K. Tonguz, “Spectral Efficiency-Connectivity Tradeoff in Ad Hoc Wireless Networks,” Proc. Int'l Symp. Information Theory and Its Applications (ISITA '04), pp. 451-456, Oct. 2004.
[23] T.S. Rappaport, Wireless Communications Principles and Practice. Prentice Hall, 1996.
[24] S. Panichpapiboon, G. Ferrari, and O.K. Tonguz, “Optimal Transmit Power in Wireless Sensor Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 10, pp. 1432-1447, Oct. 2006.
[25] A. Papoulis and S.U. Pillai, Probability, Random Variables and Stochastic Processes, fourth ed. McGraw-Hill, 2002.
[26] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[27] B. Schrick and M.J. Riezenman, “Wireless Broadband in a Box,” IEEE Spectrum, vol. 39, no. 6, pp. 38-43, June 2002.
[28] C.E. Perkins, Ad Hoc Networking. Addison-Wesley, 2001.
[29] S. Park and B. Van Voorst, “Anticipated Route Maintenance (ARM) in Location-Aided Mobile Ad Hoc Networks,” Proc. IEEE GLOBECOM, pp. 2809-2813, Nov. 2001.
[30] G. Tunnicliffe, A. Murch, A. Sathyendran, and P. Smith, “Analysis of Traffic Distribution in Cellular Networks,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1984-1988, May 1998.
[31] L. Kleinrock, Queuing Systems Vol. 1. John Wiley & Sons, 1975.
[32] J. Medhi, Stochastic Models in Queuing Theory. Elsevier Science Publishers, 2003.
[33] J. Kurose and K. Ross, Computer Networking: A Top-Down Approach, second ed. Addison-Wesley, 2002.
[34] N. Abramson, “Multiple Access in Wireless Digital Networks,” Proc. IEEE, vol. 82, pp. 1360-1370, Sept. 1994.
[35] J. Kleinberg and E. Tardos, “Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks,” J. Computer and System Sciences, vol. 57, pp. 61-73, 1998.
[36] R. Hofstad, G. Hooghiemstra, and D. Znamenski, Distances in Random Graphs with Finite Mean and Infinite Variance Degrees, Feb. 2003, preprint, .
[37] L. Hu, “Distributed Code Assignments for CDMA Packet Radio Networks,” IEEE/ACM Trans. Networking., vol. 1, no. 6, pp. 668-677, Dec. 1993.
[38] J. Garcia-Luna-Aceves and J. Raju, “Distributed Assignment of Codes for Multihop Packet-Radio Networks,” Proc. IEEE Military Comm. Conf. (MILCOM), pp. 450-454, Nov. 1997.
[39] O.K. Tonguz and G. Ferrari, Ad Hoc Wireless Networks: A Communication-Theoretic Perspective. Wiley and Sons, 2006.

Index Terms:
Ad hoc wireless networks, resource reservation, performance analysis, bit error rate, goodput, throughput, delay.
Sooksan Panichpapiboon, Gianluigi Ferrari, Nawaporn Wisitpongphan, Ozan K. Tonguz, "Route Reservation in Ad Hoc Wireless Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 1, pp. 56-71, Jan. 2007, doi:10.1109/TMC.2007.13
Usage of this product signifies your acceptance of the Terms of Use.