A flooding based routing algorithm for Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are videly in use in rescue, military operations, scientific and business areas. Many studies are addressed in MANETs because of their need to long lasting liveness, fault tolerance, dynamic addressing, collusion prevention, mobility management and security. Especially, self clustering, backbone construction and routing are the most interesting academic and industrial research areas in MANETs. A wide range of studies addressed the routing problem in MANETs. Many previous studies address the clustering and routing problems as seperate subjects. However, routing approaches which are specific to the clustering methodologies may have many advantages in terms of efficiency and availability. In this study, a flooding based routing algorithm is proposed. First, a detailed description of the algorithm is explained, then the analysis and test results using the ns2 simulator are given which show that the designed algorithm is scalable and has favorable performance.

[1]  M. Jiang,et al.  Cluster based routing protocol (CBRP) , 1999 .

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Kayhan Erciyes,et al.  A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[4]  Xue Liu,et al.  A survey of multicast routing protocols for mobile Ad-Hoc networks , 2009, IEEE Communications Surveys & Tutorials.

[5]  Yanlin Wang,et al.  A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks , 2003, GCC.

[6]  Mieso K. Denko,et al.  AN AODV-Based Clustering and Routing Scheme for Mobile Ad Hoc Networks , 2006 .

[7]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[8]  J. Kaiser,et al.  Survey of mobile ad hoc network routing protocols , 2005 .

[9]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[10]  D. West.  Introduction to Graph Theory , 1995 .

[11]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[12]  Yi Pan,et al.  An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks , 2004, ISPA.

[13]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[14]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[15]  Orhan Dagdeviren,et al.  A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks , 2006, International Conference on Computational Science.

[16]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.

[17]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[18]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[19]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .