Preview

Comparative Study of Route Reservation Techniques of Ad Hoc Wireless Networks

Powerful Essays
Open Document
Open Document
2505 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
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



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.

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Nt1310 Unit 7

    • 410 Words
    • 2 Pages

    Note that the fact that the on-demand approach of the AODV protocol minimizes routing table information. AODV uses traditional routing tables as it is a reactive routing protocol. To determine whether routing information is up-to-date and to prevent routing loops sequence numbers are used. The maintenance of time-based states is a crucial feature of AODV which suggests that a routing entry that isn't recently used is expired. In case of route breakage, the neighbours are notified. The discovery of the route from source to destination relies on query and reply cycles and intermediate nodes store the route information within the type of route table entries along the…

    • 410 Words
    • 2 Pages
    Satisfactory Essays
  • Best Essays

    Cordeiro, C., Gossain, H., and Agrawa, D. "Multicast over wireless mobile ad hoc networks: present and future directions", IEEE Network, 17(1), 2003.…

    • 1489 Words
    • 5 Pages
    Best Essays
  • Powerful Essays

    It230 Unit 3 Assignment 1

    • 5629 Words
    • 23 Pages

    General assessment of the selected routing protocol identify its functionality and how an algorithm should be developed to the specific routing protocol.…

    • 5629 Words
    • 23 Pages
    Powerful Essays
  • Satisfactory Essays

    Unit 2 Lab 2.1

    • 374 Words
    • 2 Pages

    Wi-Fi wireless networks support ad hoc connections between devices. Ad hoc Wi-Fi networks are pure peer to peer compared to those utilizing wireless routers as an intermediate device.…

    • 374 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    show that the proposed framework is fast (two rounds of communication among nodes, regardless of network size) and outperforms an existing method.…

    • 8009 Words
    • 33 Pages
    Good Essays
  • Good Essays

    Regan, P. (2004). Chapter 12: Introduction to Routers and Routing in Wide Area Networks. Prentice-Hall.…

    • 554 Words
    • 3 Pages
    Good Essays
  • Better Essays

    Standardsresearch

    • 1197 Words
    • 5 Pages

    IEEE 802.22. (2012, January 15). Working group for wireless regional area networks. Retrieved from http://standards.ieee.org/news/2011/80222wg_award.html…

    • 1197 Words
    • 5 Pages
    Better Essays
  • Satisfactory Essays

    Wireless Network

    • 268 Words
    • 2 Pages

    Last and forth most is determining the location of the wireless devices, as there are many different object that hinder the signal of the access point with all mode from Ad hoc to the standard infrastructure. While they all can be affected, each has special consideration to their locations.…

    • 268 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Bs311 Unit 3 Essay

    • 3508 Words
    • 15 Pages

    Designing secure key distribution in an ad-hoc network might be an extremely hard task. Any reliance on a certificate of authority is not trivial at all, for the same reasons that reliance in any centralized authority is problematic. Additional problems include the increased packet sizes required by authentication extensions, unicast/multicast routing, Quality of Service support and power aware routing. Furthermore, due to the limited transmission range of wireless network interfaces, multiple hops may be needed to exchange data between nodes in the network (c.f.…

    • 3508 Words
    • 15 Pages
    Powerful Essays
  • Good Essays

    (c) Data throughput in sensor networks is a bigger concern than that in mobile ad hoc networks.…

    • 1413 Words
    • 6 Pages
    Good Essays
  • Powerful Essays

    References: ISCO . (2012) 802.11ac: The Fifth Generation of Wi-Fi Technical White Paper. [Online] Available from: http://www.cisco.com/c/en/us/products/collateral/ wireless /aironet-3600-series/white_paper_c11-713103.html.[Accessed: 5th October 2014].…

    • 2329 Words
    • 8 Pages
    Powerful Essays
  • Satisfactory Essays

    Mr. Paper

    • 358 Words
    • 2 Pages

    Step 1. Given an IP address and mask of 172.20.0.0/24 (address/mask), design an IP addressing scheme that satisfies:…

    • 358 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Bluetooth Technology

    • 2009 Words
    • 9 Pages

    Alterovitz Ron. (2001) Message Routing Over a (Bluetooth) Scatternet, Computer Science Department, California Institute of Technology.…

    • 2009 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    An ad-hoc network also called WiFi Direct network is a network where stations communicate only peer to peer (P2P). There is no base and no one gives permission to talk. This is accomplished using the Independent Basic Service Set (IBSS).…

    • 384 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    juniper

    • 185777 Words
    • 1143 Pages

    JNCIA Juniper™ Networks Certified Internet Associate Study Guide by Joseph M. Soricelli with John L. Hammond, Galina Diker Pildush, Thomas E. Van Meter, and Todd M. Warble This book was originally developed by Juniper Networks Inc. in conjunction with Sybex Inc. It is being offered in electronic format because the original book (ISBN: 0-7821-4071-8) is now out of print.…

    • 185777 Words
    • 1143 Pages
    Powerful Essays