Comparative Study of Route Reservation Techniques of Ad Hoc Wireless Networks
Comparative Study of Route Reservation Techniques of Ad Hoc Wireless Networks Sanjay Jain Associate Professor, ITM-MCA,Gwalior sanjay.jain.mca@itmuniverse.in
Abstract- In this paper we show the comparative study of route reservation techniques in ad hoc wireless networks. The reservation technique falls into two groups’ reservation-based (RB) communication and non-reservation-based (NRB) communication. In an NRB scheme, an intermediate node can simultaneously serve as relay for more than one source while RB scheme reserves intermediate nodes before the actual transmission begins. The paper describes the Analytical comparison for evaluating the performance, in terms of delay, good put, and throughput of RB and NRB schemes.
Keywords- ad hoc wireless networks, resource reservation, performance analysis, good put, throughput, delay.
I. INTRODUCTION There are two switching techniques used in wired networks- circuit switching and packet switching [1]. The major difference between them is the way resources are shared. Circuit switching provides exclusive access to the resources by means of reservation on the other hand resources are shared on demand, without prior reservation in packet switching. The packet switching is suitable for a wired data network such as the Internet; it is not clear whether this is true in the case of ad hoc wireless networks. In this paper, we compare the two switching paradigms: reservation-based (RB) and non-reservation-based (NRB) switching for ad hoc wireless network. The concepts of reservation and non-reservation are analogous to those of circuit switching and packet switching in wired networks, respectively.
* In an NRB scheme, an intermediate node can simultaneously serve as relay for more than one source. Hence, the resources (in terms of relaying nodes) are shared in an on-demand fashion. This is typical for most of the routing protocols for wireless ad hoc networks proposed in the literature [2].
* In
Abstract- In this paper we show the comparative study of route reservation techniques in ad hoc wireless networks. The reservation technique falls into two groups’ reservation-based (RB) communication and non-reservation-based (NRB) communication. In an NRB scheme, an intermediate node can simultaneously serve as relay for more than one source while RB scheme reserves intermediate nodes before the actual transmission begins. The paper describes the Analytical comparison for evaluating the performance, in terms of delay, good put, and throughput of RB and NRB schemes.
Keywords- ad hoc wireless networks, resource reservation, performance analysis, good put, throughput, delay.
I. INTRODUCTION There are two switching techniques used in wired networks- circuit switching and packet switching [1]. The major difference between them is the way resources are shared. Circuit switching provides exclusive access to the resources by means of reservation on the other hand resources are shared on demand, without prior reservation in packet switching. The packet switching is suitable for a wired data network such as the Internet; it is not clear whether this is true in the case of ad hoc wireless networks. In this paper, we compare the two switching paradigms: reservation-based (RB) and non-reservation-based (NRB) switching for ad hoc wireless network. The concepts of reservation and non-reservation are analogous to those of circuit switching and packet switching in wired networks, respectively.
* In an NRB scheme, an intermediate node can simultaneously serve as relay for more than one source. Hence, the resources (in terms of relaying nodes) are shared in an on-demand fashion. This is typical for most of the routing protocols for wireless ad hoc networks proposed in the literature [2].
* In
References: [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 Ad Hoc 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] C.E. Perkins, Ad Hoc Networking. Addison-Wesley, 2001.