Improving route discovery in on-demand routing protocols using local topology information in MANETs

ABSTRACT

Most existing routing protocols proposed for MANETs use flooding as a broadcast technique for the propagation of network control packets; a particular example of this is the dissemination of route requests (RREQs), which facilitate route discovery. In flooding, each mobile node rebroadcasts received packets, which, in this manner, are propagated network-wide with considerable overhead. This paper improves on the performance of existing routing protocols by reducing the communication overhead incurred during the route discovery process by implementing a new broadcast algorithm called the adjusted probabilistic flooding on the Ad-Hoc on Demand Distance Vector (AODV) protocol. AODV [3] is a well-known and widely studied algorithm which has been shown over the past few years to maintain an overall lower routing overhead compared to traditional proactive schemes, even though it uses flooding to propagate RREQs. Our results, as presented in this paper, reveal that equipping AODV with fixed and adjusted probabilistic flooding, instead, helps reduce the overhead of the route discovery process whilst maintaining comparable performance levels in terms of saved rebroadcasts and reachability as achieved by conventional AODV\@. Moreover, the results indicate that the adjusted probabilistic technique results in better performance compared to the fixed one for both of these metrics

REFERENCES

• 1: J. Cartigny and D. Simplot. Border node retransmission based probabilistic broadcast protocols in ad-hoc networks. Telecommunication Systems, 22(1-4):189--204, 2003.
• 2: L. M. M. M. Bani Yassein, M. Ould-Khaoua and S. Papanastasiou. Improving the performance of probabilistic flooding in manets. In Proceedings of International Workshop on Wireless Ad-hoc Networks (IWWAN-2005), May 2005.
• 3: L. M. M. M. Bani-Yassein, M. Ould~Khaoua and S. Papanastasiou. Applications of highly adjusted probabilistic broadcasting in manets. In Proceedings of the 4th International Multiconference on Computer Science and Information Technology CSIT 2006, pages 469--476, April 2006.
• 4: L. M. M. M. Bani-Yassein, M. Ould-Khaoua and S. Papanastasiou. Performance analysis of adjusted probabilistic broadcasting in mobile ad hoc networks. International Journal of Wireless Information Networks, pages 1--14, March 2006. Springer Netherlands.
• 5: Wei Peng , Xi-Cheng Lu, On the reduction of broadcast redundancy in mobile ad hoc networks, Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, November 20, 2000, Boston, Massachusetts
• 6: C.K. -K Toh, Ad Hoc Wireless Networks: Protocols and Systems, Prentice Hall PTR, Upper Saddle River, NJ, 2001
• 7: Yu-Chee Tseng , Sze-Yao Ni , Yuh-Shyan Chen , Jang-Ping Sheu, The broadcast storm problem in a mobile ad hoc network, Wireless Networks, v.8 n.2/3, p.153-167, March-May 2002 [doi>10.1023/A:1013763825347]
• 8: Brad Williams , Tracy Camp, Comparison of broadcasting techniques for mobile ad hoc networks, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513825]
• 9: D. C. Y. Sasson and A. Schiper. Probabilistic broadcast for flooding in wireless mobile ad hoc networks. Technical Report IC/2002/54, EPFL, 2002.
• 10: Qi Zhang , Dharma P. Agrawal, Dynamic probabilistic broadcasting in MANETs, Journal of Parallel and Distributed Computing, v.65 n.2, p.220-233, February 2005 [doi>10.1016/j.jpdc.2004.09.006]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network communications

General Terms:
Algorithms, Experimentation, Measurement, Performance

Keywords:
AODV, MANETs, probabilistic broadcasting, reachability