On Efficient Network Planning and Routing in Large-Scale MANETs

In mobile ad hoc networks (MANETs), hierarchical architecture and distributed approaches are more practical than flat architecture and centralized approaches. In this paper, we propose a suite of protocols that achieve a distributed planning and routing scheme for MANETs. The proposed suite, which is composed of three protocols, offers scalability and extends network lifetime. The first protocol, i.e., the fast distributed connected dominating set (FDDS), constructs the virtual backbone by designing a fast distributed hierarchical algorithm that finds a connected dominating set (CDS) in the network graph. The constructed virtual backbone takes into account the node's limited energy, mobility, and traffic pattern. The second protocol, i.e., FDDS-M, proposes a distributed maintenance protocol that preserves the integrity of the hierarchical structure constructed by FDDS. The third protocol, i.e., FDDS-R, uses an intelligent path-selection fuzzy logic controller that can easily be incorporated in any existing link state routing protocol to select energy-efficient routes. We conducted extensive simulations that compare the operational properties (energy efficiency and network lifetime) of our schemes with others. The results show that our proposed schemes can achieve scalability and energy efficiency and outperform some of well-known approaches in the literature.

[1]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[2]  Joseph P. Macker,et al.  Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations , 1999, RFC.

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

[4]  Christos G. Cassandras,et al.  On maximum lifetime routing in Wireless Sensor Networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

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

[6]  Jie Wu,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2001, Journal of Communications and Networks.

[7]  Israel Cidon,et al.  Propagation and Leader Election in a Multihop Broadcast Environment , 1998, DISC.

[8]  Jie Wu,et al.  A transmission range reduction scheme for power-aware broadcasting in ad hoc networks using connected dominating sets , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[9]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[10]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..

[12]  Wassim El-Hajj,et al.  A fuzzy-based virtual backbone routing for large-scale MANETs , 2008, Int. J. Sens. Networks.

[13]  Jie Wu,et al.  New metrics for dominating set based energy efficient activity scheduling in ad hoc networks , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[14]  Srinivasan Parthasarathy,et al.  Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks , 2004 .

[15]  Wassim El-Hajj,et al.  Fast distributed dominating set based routing in large scale MANETs , 2007, Comput. Commun..

[16]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[17]  Arta Doci Ad Hoc Networks: Technologies and Protocols , 2009, Scalable Comput. Pract. Exp..

[18]  Ding-Zhu Du,et al.  Connected Domination in Multihop Ad Hoc Wireless Networks , 2002, JCIS.

[19]  Piyush Gupta,et al.  An Experimental Scaling Law for Ad Hoc Networks , 2001 .

[20]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[21]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[24]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.