A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks

This work concerns the comparative performance evaluation of protocols for clustering and backbone formation in ad hoc networks characterized by a large number of resource-constrained nodes. A typical example of these networks are wireless sensor networks. The DCA protocol represents those protocols whose backbone construction method is based on selecting nodes as clusterheads and then joining them to form a connected backbone. The algorithm proposed by Wu and Li has been chosen to exemplify those algorithms that build a connected backbone and then prune away redundant nodes. Finally, the algorithm by Wan et al. has been considered here for its more theoretical properties of producing a backbone with a constant approximation factor, linear time complexity and optimal message complexity. In order to obtain a backbone reasonably small at reasonable cost we propose an enhancement of the DCA algorithm, termed DCA-S, which enriches the DCA backbone construction with a recently proposed and resource effective sparsification rule. DCA-S leads to a robust backbone close in size to that generated by the Wan et al. protocol without significantly degrading the performance in terms of all the other relevant metrics.

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

[2]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Xiaoyan Hong,et al.  An ad hoc network with mobile backbones , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

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

[6]  Paolo Santi,et al.  Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks , 2004, EWSN.

[7]  Mahesh K. Marina,et al.  Virtual dynamic backbone for mobile ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[8]  StojmenovicIvan,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002 .

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[10]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[11]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[12]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

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

[14]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[15]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[16]  Sajal K. Das,et al.  Mobility-adaptive protocols for managing large ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[17]  Vaduvur Bharghavan,et al.  The clade vertebrata: spines and routing in ad hoc networks , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[18]  Christian Bettstetter,et al.  Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm , 2001, MobiHoc '01.

[19]  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.

[20]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

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

[22]  Vaduvur Bharghavan,et al.  Spine routing in ad hoc networks , 1998, Cluster Computing.

[23]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[24]  Edward J. Coyle,et al.  Minimizing communication costs in hierarchically-clustered networks of wireless sensors , 2004, Comput. Networks.

[25]  Vaduvur Bharghavan,et al.  Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  Sandro Etalle,et al.  EYES - Energy Efficient Sensor Networks , 2003, PWC.

[27]  Elizabeth M. Belding-Royer,et al.  Multi-Level Hierarchies for Scalable Ad hoc Routing , 2003, Wirel. Networks.

[28]  Mario Gerla,et al.  Multimedia streaming in large-scale sensor networks with mobile swarms , 2003, SGMD.

[29]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..

[30]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[31]  Sajal K. Das,et al.  An on-demand weighted clustering algorithm (WCA) for ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[32]  Mohamed F. Younis,et al.  Fault-tolerant clustering of wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[33]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[34]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..

[35]  J. J. Garcia-Luna-Aceves,et al.  Topology management in ad hoc networks , 2003, MobiHoc '03.

[36]  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.

[37]  Mario Gerla,et al.  Multimedia transport in multihop dynamic packet radio networks , 1995, Proceedings of International Conference on Network Protocols.

[38]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[39]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[40]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, ESA.

[41]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[42]  Edward J. Coyle,et al.  Minimizing communication costs in hierarchically clustered networks of wireless sensors , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[43]  Xiaoyan Hong,et al.  Landmark routing in ad hoc networks with mobile backbones , 2003, J. Parallel Distributed Comput..

[44]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[45]  Paul J.M. Havinga,et al.  Size-Controlled Dynamic Clustering in Mobile Wireless Sensor Networks , 2004 .

[46]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[47]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).