This Article 
 Bibliographic References 
 Add to: 
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
April 2006 (vol. 17 no. 4)
pp. 292-306

Abstract—This paper 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. Our aim is twofold: We provide the first simulation-based detailed investigation of techniques for clustering and backbone formation that are among the most representative of this area of ad hoc research. Second, we delve into the nature of the selected protocols to assess the effects of the "degree of localization” on their operations, i.e., how being able to execute the protocol based only on local information affects the overall protocol performance. Extensive ns2-based simulation results show that highly localized protocols are rewarded with good performance with respect to all metrics of interest which include protocol duration, energy consumption, message overhead, route length, and backbone size.

[1] C. Adjih, P. Jacquet, and L. Viennot, “Computing Connected Dominated Sets with Multi-Point Relays,” Ad Hoc & Sensor Wireless Networks 1, vol. 1, pp. 27-39, 2005.
[2] S. Basagni, “Distributed Clustering for Ad Hoc Networks,” Proc. 1999 Int'l Symp. Parallel Architectures, Algorithms, and Networks (I-SPAN '99), pp. 310-315, June 1999.
[3] I. Chlamtac and A. Faragó, “A New Approach to the Design and Analysis of Peer-to-Peer Mobile Networks,” Wireless Networks 5, vol. 3, pp. 149-156, May 1999.
[4] F. Dai and J. Wu, “An Extended Localized Algorithms for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.
[5] D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, “Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons,” Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 717-724, Jan. 2003.
[6] L. Jia, R. Rajaraman, and T. Suel, “An Efficient Distributed Algorithm for Constructing Small Dominating Sets,” Distributed Computing, vol. 15, no. 4, pp. 193-205, Dec. 2004.
[7] B. Liang and Z. Haas, “Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management,” Proc. 19th IEEE Infocom, vol. 3, pp. 1293-1302, Mar. 2000.
[8] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbors Elimination-Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[9] P.-J. Wan, K.M. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks,” ACM/Kluwer Mobile Networks and Applications (MONET) 9, no. 2, pp. 141-149, Apr. 2004.
[10] J. Wu, “An Enhanced Approach to Determine a Small Forward Node Set Based on Multi-Point Relay,” Proc. 58th IEEE Semiann. Vehicular Technology Conf., VTC 2003-Fall, vol. 4, pp. 2774-2777, Oct. 2003.
[11] J. Wu and H. Li, “On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Third ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (Dial M 1999), pp. 7-17, Aug. 1999.

Index Terms:
Ad hoc networks, wireless sensor networks, clustering, backbone formation.
Stefano Basagni, Michele Mastrogiovanni, Alessandro Panconesi, Chiara Petrioli, "Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 292-306, April 2006, doi:10.1109/TPDS.2006.52
Usage of this product signifies your acceptance of the Terms of Use.