Open Access Open Access  Restricted Access Subscription or Fee Access

Efficient Traffic Free Routing Protocol for Mobile Ad-hoc Networks

P. Visu, Dr. J. Janet, S. Koteeswaran

Abstract


Mobile Ad-hoc Networks shows unexpected behavior with multiple data streams under heavy traffic load such as multimedia data when it is sent to common destination. The main reason for packet loss in mobile ad hoc networks is due to congestion. In the current design, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. In the current design, the routing protocols are not congestion adaptive. The way in which the congestion is handled results in longer delay and more packet loss. When a new route is needed the routing protocols take significant overhead in finding it. In this paper we propose an Efficient congestion Adaptive Routing Protocol for Mobile Ad-hoc Networks, which out performs even during constrained situation. In order to analyze the performance we have chosen popular routing protocols such as AODV and DSR. We strongly argue that routing should not only be aware of but also be adaptive to network congestion.


Keywords


Ad-Hoc Networks, Routing Protocols, Mobile Computing, Congestion Adaptivity.

Full Text:

PDF

References


J.J. Garcia-Luna-Aceves and M. Spohn, “Source-Tree Routing in Wireless Networks,” Proc. IEEE Int’l Conf. Network Protocols (ICNP), 1999.

C. Gui and P. Mohapatra, “SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, 2003.

Z. Haas, J. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE Infocom, 2002.

Y.-C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. ACM Int’l Conf. Mobile Computing and Networking (MobiCom), 2002.

J. Broch, D. Johnson, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” IETF Internet draft, Oct. 1999.

D. Johnson and D. Maltz, Ad Hoc Networking. Addison-Wesley, 2001.

B. Karp and H.T. Kung, “Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM/IEEE Int’l Conf. Mobile Computing and Networking (MobiCom ’00), pp. 243-254, Aug. 2000.

S.-J. Lee and M. Gerla, “Dynamic Load-Aware Routing in Ad Hoc Networks,” Proc. IEEE Int’l Conf. Comm., pp. 3206-3210, June 2001.

S.-J. Lee, E.M. Royer, and C.E. Perkins, “Scalability Study of the Ad Hoc On-Demand Distance Vector Routing Protocol,” ACM/ Wiley Int’l J. Network Management, vol. 13, no. 2, pp. 97-114, Mar. 2003.

M. Marina and S. Das, “On-Demand Multipath Distance Vector Routing in Ad Hoc Networks,” Proc. IEEE Int’l Conf. Network Protocols (ICNP), pp. 14-23, 2001.

A. Nasipuri and S.R. Das, “On-Demand Multipath Routing for Mobile Ad Hoc Networks,” Proc. IEEE Int’l Conf. Computer Comm. and Networks (IC3N), Oct. 1999.

NS-2, Network Simulater, http://www.isi.edu/nsnam/ns/, 2006.

H. Raghavendra and D.A. Tran, “Congestion Adaptive Routing in Ad Hoc Networks (Short Version),” Proc. ACM Int’l Conf. Mobile Computing and Networking (MOBICOM), Oct. 2004.


Refbacks

  • There are currently no refbacks.