Open Access Open Access  Restricted Access Subscription or Fee Access

Performance Evaluation of Scalable Ad-Hoc Network Using Dynamic Address Routing (DART)

T Shankar, A. Karthikeyan, V. Srividhya

Abstract


In this paper we develop a scalable network layer routing protocol for mobile ad hoc networks and also compared the Dynamic Address Routing (DART) performances like overhead and throughput with respect to network size and dataflow with the existing Protocol. Dynamic Address Routing (DART) addresses this scalability problem by separating the address of a node into two separate numbers: a) a unique and static node identifier, serving the same purpose as today's IP addresses and b) a dynamic routing address, which indicates the node's current position in the network topology. The use of dynamic routing addresses creates an opportunity for route aggregation which in the case of DART, greatly improves scalability. The paper describes the method of address allocation, which executes locally on each node, and relies only on routing updates from immediate neighbors to select an available and accurate routing address. Dynamic Address Routing (DART) does not require any geographical location information, nor does it make any assumption as to the underlying medium. Wireless Omni directional links, as well as directional and even wired links are supported equally well. In addition, nodes participating in a DART network do not require any manual network configuration, making Dynamic Address Routing (DART) a strong candidate for future mesh networking applications in additional to current ad hoc networking applications. The simulations for different scenarios are run and compared graphs are obtained. The analysis of these graphs shows the increase in number of Flows and network size the reduction in the overhead of the network. It is also shown by the graphs that the overall throughput of the network is increased.

Keywords


Dynamic Address Routing (DART), Scalability, Wireless Ad Hoc Routing Protocol, Temporally Ordered Routing Algorithm (TORA).

Full Text:

PDF

References


Nicholas Negroponte, “Being wireless, 2002,”www.wired.com/wired/archive/10.10/wireless.htm PersonalTelco Project, “Personaltelco,”

“Consume.net project: Trip the loop, make your switch, consume the net!,” www.consume.net. “Wireless anarchy,” www.wirelessanarchy.com.

Ram Ramanathan and Martha Steenstrup, “Hierarchically-organized, multihop mobile wireless networks for quality-of service support,” Mobile Networks and Applications, vol. 3, no. 1, pp. 101–119.

X. Hong, M. Gerla, G. Pei, and C. Chiang, “A group mobility model for ad hoc wireless networks,” 1999.

I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in SIGCOMM’01. ACM, 2001.

Charles Perkins and Pravin Bhagwat, “Highly dynamic destinationsequenced distance-vector routing (DSDV) for mobile computers,” in ACM SIGCOMM’94, 1994.

Jungkeun Yoon, Mingyan Liu, and Brian Noble, “Random waypoint considered harmful,” in INFOCOM, 2003.Yih-Chun Hu, Adrian Perrig, and David B. Johnson, “Ariadne: A secure on-demand routing protocol for ad hoc networks,” in Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MobiCom 2002), Sept. 2002.

Lidong Zhou and Zygmunt J. Haas, “Securing ad hoc networks,” IEEE Network, vol. 13, no. 6, pp. 24–30, 1999. Sergio Marti, T. J. Giuli, Kevin Lai, and Mary Baker, “Mitigating routing misbehavior in mobile ad hoc networks,” in Mobile Computing and Networking, 2000, pp. 255–265.

C. Perkins, “Ad hoc on demand distance vector routing,” 1997. David B Johnson and David A Maltz, “Dynamic source routing in ad hoc wireless networks,” in Mobile Computing, vol. 353. Kluwer Academic Publishers, 1996. B. A. Woodward, “A distance routing effect algorithm for mobility (DREAM),” in ACM/IEEE MobiCom, 1998.

Y.-B. Ko and N.H. Vaidya, “Location-aided routing (LAR) in mobile ad hoc networks,” in ACM/IEEE MobiCom, 1998.

Xiaoyan Hong, Kaixin Xu, and Mario Gerla, “Scalable routing protocols for mobile ad hoc networks,” IEEE NETWORK, vol. 16, no. 4, 2002.

Z. Haas, “A new routing protocol for the reconfigurable Wireless networks,” 1997.

Guangyu Pei, Mario Gerla, and Tsu-Wei Chen, “Fisheye state routing: A routing scheme for ad hoc wireless networks,” in ICC (1), 2000, pp. 70–74.

Paul F. Tsuchiya, “The landmark hierarchy : A new hierarchy for routing in very large networks,” in SIGCOMM. 1988, ACM.

Benjie Chen and Robert Morris, “L+: Scalable landmark routing and address lookup for multi-hop wireless networks,” 2002.

L. Kleinrock and F. Kamoun, “Hierarchical routing for large networks: Performance evaluation and optimization,,”.

Xiaoyan Hong, Kaixin Xu, and Mario Gerla, “Scalable routing protocols for mobile ad hoc networks,” IEEE NETWORK, vol. 16, no. 4, 2002.

Z. Haas, “A new routing protocol for the reconfigurable wireless networks,” 1997.

Guangyu Pei, Mario Gerla, and Tsu-Wei Chen, “Fisheye state routing: A routing scheme for ad hoc wireless networks,” in ICC (1), 2000, pp.70–74

Paul F. Tsuchiya, “The landmark hierarchy : A new hierarchy for routing in very large networks,” in SIGCOMM. 1988, ACM.

Benjie Chen and Robert Morris, “L+: Scalable landmark routing and address lookup for multi-hop wireless networks,” 2002.

L. Kleinrock and F. Kamoun, “Hierarchical routing for large networks: Performance evaluation and optimization,,” Computer Networks, vol. 1, 1977.

Aline C. Viana, Marcelo D. de Amorim, Serge Fdida, and Jos F.de Rezende, “Indirect routing using distributed location information,” ACM Mobile Networks Applications, Special Issue on Mobile and Pervasive Computing, 2003.

A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and Stoica, “Geographic routing without location information,” in ACM MobiCom, 2003.

James Newsome and Dawn Song, “Gem: graph embedding for routing and data-centric storage in sensor networks without geographic information,” in SenSys ’03: Proceedings of the 1st international conferenceon Embedded networked sensor systems, New York, NY, USA, 2003, pp. 76–88, ACM Press.

I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in SIGCOMM’01. ACM, 2001.

David Karger, Eric Lehman, Tom Leighton, Mathhew Levine, Daniel Lewin, and Rina Panigrahy, “Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web,” in ACM Symposium on Theory of Computing, May 1997, pp.

Jungkeun Yoon, Mingyan Liu, and Brian Noble, “Random waypoint considered harmful,” in INFOCOM, 2003


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.