Performance Comparison And Analysis Of Table-Driven And On-Demand Routing Protocols For Mobile Ad-Hoc Networks

Autor: Narendra Singh Yadav, R.P.Yadav
Jazyk: angličtina
Rok vydání: 2008
Předmět:
DOI: 10.5281/zenodo.1335199
Popis: Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the table- driven protocol and the Ad hoc On- Demand Distance Vector routing (AODV), an On –Demand protocol and evaluates both protocols based on packet delivery fraction, normalized routing load, average delay and throughput while varying number of nodes, speed and pause time.
{"references":["E. M. Royer and C. K. Toh, \"A review of current routing protocols for\nad hoc mobile wireless networks,\" IEEE Personal Communications\nmagazine, April 1999, pp. 46-55.","C. E. Perkins and P. Bhagwat, \"Highly Dynamic Destination-Sequenced\nDistance-Vector Routing (DSDV) for Mobile Computers,\" in\nProceedings of ACM SIGCOMM 1994, August 1994, pp. 234-244.","S. Murhty and J. J. Garcia-Luna-Aceves, \"An Efficient Routing\nProtocol for Wireless Networks,\" ACM Mobile Networks and\nApplications Journal, Special Issue on Routing in Mobile\nCommunication Networks, Vol. 1, no. 2, October 1996, pp. 183-197.","C. C. Chiang, H. K. Wu, W. Liu and M. Gerla, \"Routing in Clustered\nMulti-Hop Mobile Wireless Networks with Fading Channel,\" in\nProceedings of IEEE SICON 1997, April 1997, pp. 197-211.","J. J. Garcia-Luna-Aceves and M. Spohn, \"Source-Tree Routing in\nWireless Networks,\" in Proceedings of IEEE ICNP 1999, October 1999,\npp. 273-282.","D. B. Johnson and D. A. Malta, \"Dynamic Source Routing in Ad Hoc\nWireless Networks,\" Mobile Computing, Kluwer Academic Publishers,\nvol. 353, 1996, pp. 153-181.","C. E. Perkins and E. M. Royer, \"Ad Hoc On-Demand Distance Vector\nRouting,\" Proceedings of IEEE Workshop on Mobile Computing\nSystems and Applications 1999, February 1999, pp. 90-100.","V. D. Park and M. S. Corson, \"A Highly Adaptive Distributed Routing\nAlgorithm for Mobile Wireless Networks,\" in Proceedings of IEEE\nINFOCOM 1997, April 1997, pp. 1405-1413.","Y. Ko and N. H. Vaidya, \"Location-Aided Routing (LAR) in Mobile Ad\nHoc Networks,\" in Proceedings of ACM MOBICOM 1998, October\n1998, pp. 66-75.\n[10] C. K. Toh, \"Associativity-Based Routing for Ad Hoc Mobile Networks,\"\nWireless Personal Communications, vol. 4, no. 2, March 1997, pp. 1-36.\n[11] P. Sinha, R. Shivkumar and V. Bharghavan, \"CEDAR: A Core\nExtraction Distributed Ad Hoc Routing Algorithm,\" IEEE Journal on\nSelected Areas in Communications, vol. 17, no. 8, August 1999, pp.\n1454-1466.\n[12] Z. J. Haas, \"The Routing Algorithm for the Reconfigurable Wireless\nNetworks,\" in Proceedings of ICUPC 1997, vol. 2, October 1997, pp.\n562-566.\n[13] R. S. Sisodia, B. S. Manoj and C. Siva Ram Murthy, \"A Preferred Link-\nBased Routing Protocol for Ad Hoc Wireless Networks,\" Journal of\nCommunications and Networks, vol. 4, no. 1, march 2002, pp. 14-21.\n[14] Andrew S. Tanenbaum, Computer Networks. Fourth Edition, Prentice\nHall, ch. 5, pp. 357-360.\n[15] Andrew S. Tanenbaum, Computer Networks. Fourth Edition, Prentice\nHall, ch. 5, pp. 360-366.\n[16] K. Fall and K. Vardhan, The Network Simulator (ns-2). Available:\nhttp://www.isi.edu/nsnam/ns\n[17] T. S. Rappaport, Wireless Communications, Principles & Practices.\nPrentice Hall, 1996, ch. 3, pp. 70-74."]}
Databáze: OpenAIRE