The Community for Technology Leaders
RSS Icon
Issue No.12 - December (2009 vol.20)
pp: 1844-1856
Moustafa A. Youssef , Nile University, Cairo
Adel Youssef , Google Inc., Mountain View
Mohamed F. Younis , University of Maryland, Baltimore
Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multihop clusters. Overlapping clusters are useful in many sensor network applications, including intercluster routing, node localization, and time synchronization protocols. We also propose a randomized, distributed multihop clustering algorithm (KOCA) for solving the overlapping clustering problem. KOCA aims at generating connected overlapping clusters that cover the entire sensor network with a specific average overlapping degree. Through analysis and simulation experiments, we show how to select the different values of the parameters to achieve the clustering process objectives. Moreover, the results show that KOCA produces approximately equal-sized clusters, which allow distributing the load evenly over different clusters. In addition, KOCA is scalable; the clustering formation terminates in a constant time regardless of the network size.
Clustering, multihop clustering, overlapping clustering, sensor networks.
Moustafa A. Youssef, Adel Youssef, Mohamed F. Younis, "Overlapping Multihop Clustering for Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 12, pp. 1844-1856, December 2009, doi:10.1109/TPDS.2009.32
[1] A. Abbasi and M. Younis, “A Survey on Clustering Algorithms for Wireless Sensor Networks,” J. Computer Comm., special issue on network coverage and routing schemes for wireless sensor networks, vol. 30, pp. 2826-2841, 2007.
[2] D.J. Baker and A. Ephremides, “The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm,” IEEE Trans. Comm., vol. COM-29, no. 11, pp. 1694-1701, Nov. 1981.
[3] A. Ephremides, J. Wieselthier, and D.J. Baker, “A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling,” Proc. IEEE, vol. 75, no. 1, pp. 56-73, Jan. 1987.
[4] A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh, “Max-Min D-Cluster Formation in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, Mar. 2000.
[5] S. Basagni, “Distributed Clustering for Ad Hoc Networks,” Proc. Int'l Symp. Parallel Architectures, Algorithms and Networks, pp. 310-315, June 1999.
[6] M. Chatterjee, S.K. Das, and D. Turgut, “WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks,” J. Cluster Computing, special issue on mobile ad hoc networking, pp. 193-204, 2002.
[7] C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 15, pp. 1265-1275, Sept. 1997.
[8] S. Basagni, “Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-Hop Wireless Networks,” Proc. Vehicular Technology Conf., vol. 2, 1999.
[9] W.B. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan, “An Application Specific Protocol Architecture for Wireless Microsensor Networks,” IEEE Trans. Wireless Networking, vol. 1, no. 4,pp. 660-670, Oct. 2002.
[10] O. Younis and S. Fahmy, “Distributed Clustering in Ad-Hoc Sensor Networks: A Hybrid, Energy-Efficient Approach,” Proc. IEEE INFOCOM, Mar. 2004.
[11] S. Bandyopadhyay and E. Coyle, “An Energy-Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks,” Proc. IEEE INFOCOM, Mar. 2003.
[12] S. Banerjee and S. Khuller, “A Clustering Scheme for Hierarchical Control in Multi-Hop Wireless Networks,” Proc. IEEE INFOCOM, 2001.
[13] J. Beal, “A Robust Amorphous Hierarchy from Persistent Nodes,” AI Memo, no. 11, 2003.
[14] I.-S. Hwang and C.-Y. Wang, “Dynamic Allocation of Clustering Technique in Ad Hoc Wireless Network,” Proc. Third IEEE Workshop Wireless LANs, Sept. 2001.
[15] B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” Proc. Int'l Conf. Comm. (ICC), 1997.
[16] A.B. McDonald and T. Znati, “A Mobility Based Framework for Adaptive Clustering in Wireless Ad-Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1466-1487, Aug. 1999.
[17] A. Amis and R. Prakash, “Load-Balancing Clusters in Wireless AdHoc Networks,” Proc. Symp. Application-Specific Systems and Software Eng. (ASSET), Mar. 2000.
[18] C. Chiasserini, I. Chlamtac, P. Monti, and A. Nucci, “Energy Efficient Design of Wireless Ad Hoc Networks,” Proc. European Wireless Conf., Feb. 2002.
[19] T.J. Kwon and M. Gerla, “Clustering with Power Control,” Proc. Military Comm. Conf. (MilCom '99), 1999.
[20] M. Demirbas, A. Arora, and V. Mittal, “FLOC: A Fast Local Clustering Service for Wireless Sensor Networks,” Proc. First Workshop Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks, June 2004.
[21] V. Kawadia and P.R. Kumar, “Power Control and Clustering in Ad Hoc Networks,” Proc. IEEE INFOCOM, Mar. 2003.
[22] Y. Xu, J. Heidemann, and D. Estrin, “Geography Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom, pp. 70-84, July 2001.
[23] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” ACM Wireless Networks, vol. 8, no. 5, Sept. 2002.
[24] F. Ye, H. Luo, J. Chung, S. Lu, and L. Zhang, “A Two-Tier Data Dissemination Protocol for Large-Scale Wireless Sensor Networks,” Proc. ACM MobiCom, Sept. 2002.
[25] A. Cerpa and D. Estrin, “ASCENT: Adaptive Self-Configuring Sensor Networks Topologies,” Proc. IEEE INFOCOM, June 2002.
[26] G. Gupta and M. Younis, “Load-Balanced Clustering in Wireless Sensor Networks,” Proc. Int'l Conf. Comm. (ICC '03), May 2003.
[27] S. Ghiasi, A. Srivastava, X. Yang, and M. Sarrafzadeh, “Optimal Energy Aware Clustering in Sensor Networks,” Sensors Magazine, vol. 19, no. 2, pp. 258-269, Jan. 2002.
[28] P. Krishna, N.H. Vaidya, M. Chatterjee, and D.K. Pradhan, “A Distributed Routing Algorithm for Mobile Wireless Networks,” ACM SIGCOMM Computer Comm. Rev., 1997.
[29] A. Youssef, “SALAM: A Scalable Anchor-Free Localization AlgorithM for Wireless Sensor Networks,” PhD dissertation, Computer Science Dept., Univ. of Maryland, 2006.
[30] A. Youssef, A. Agrawala, and M. Younis, “Accurate Anchor-Free Localization in Wireless Sensor Networks,” Proc. First IEEE Workshop Information Assurance in Wireless Sensor Networks (WSNIA '05), Apr. 2005.
[31] Y. Shang and W. Ruml, “Improved MDS-Based Localization,” Proc. IEEE INFOCOM, Mar. 2004.
[32] X. Ji, “Sensor Positioning in Wireless Ad-Hoc Sensor Networks with Multidimensional Scaling,” Proc. IEEE INFOCOM, Mar. 2004.
[33] T. Wu and S.K. Biswas, “A Self-Reorganizing Slot Allocation Protocol for Multi-Cluster Sensor Networks,” Proc. Fourth Int'l Conf. Information Processing in Sensor Networks (IPSN '05), pp. 309-316, Apr. 2005.
[34] L. Zhang, Z. Hu, Y. Li, and X. Tang, “Grouping-Based Clustering Routing Protocol in Wireless Sensor Networks,” Proc. Int'l Conf. Wireless Comm., Networking and Mobile Computing, pp. 2452-2455, Sept. 2007.
[35] Y.-J. Han1, J.-H. Eom1, S.-H. Park1, and T.-M. Chung, “Energy-Efficient Distance Based Clustering Routing Scheme for Long-Term Lifetime of Multi-Hop Wireless Sensor Networks,” Lecture Notes in Computer Science, vol. 4773, pp. 543-546, 2007.
[36] S. Soro et al. “Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering,” Proc. IEEE Int'l Parallel and Distributed Processing Symp. (PDPS), 2005.
[37] C.-Y. Chiu, E.H.K. Wu, and G.-H. Chen, “Stability Aware Cluster Routing Protocol for Mobile Ad-Hoc Networks,” Proc. Ninth Int'l Conf. Parallel and Distributed Systems (ICPADS), 2002.
[38] Y.-L. Chang and C.-C. Hsu, “Routing in Wireless/Mobile Ad-Hoc Networks via Dynamic Group Construction,” Mobile Networks and Application, vol. 5, no. 1, pp. 27-37, May 2000.
[39] M.S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Wireless Networks,” ACM J. Wireless Networks, vol. 1, no. 1, pp. 61-81, 1995.
[40] S. Capkun, M. Hamdi, and J.P. Hubaux, “GPS-Free Positioning in Mobile Ad-Hoc Networks,” Cluster Computing J., vol. 5, no. 2, pp.157-167, Apr. 2002.
[41] Y. Shang, W. Ruml, Y. Zhang, and M.P.J. Fromherz, “Localization from Mere Connectivity,” Proc. ACM MobiHoc '03, pp. 201-212, June 2003.
[42] M. Mamun-Or-Rashid, C.S. Hong, and C.-H. In, “Passive Cluster Based Clock Synchronization in Sensor Network,” Proc. Advanced Industrial Conf. Telecomm./Service Assurance with Partial and Intermittent Resources Conf./E-Learning on Telecomm. Workshop (AICT/SAPIR/ELETE '05), pp. 340-345, July 2005.
[43] T. Rappaport, Wireless Communications: Principles & Practice. Prentice-Hall, 1996.
[44] L. Clare, G. Pottie, and J. Agre, “Self-Organizing Distributed Sensor Networks,” Proc. SPIE Conf. Unattended Ground Sensor Technologies and Applications, pp. 229-237, Apr. 1999.
[45] A. Savvides, C.C. Han, and M. Srivastava, “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors,” Proc. ACM MobiCom, pp. 166-179, July 2001.
[46] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs: Advanced Topics. Marcel Dekker, Inc., 1998.
[47] G.J. Chang and G.L. Nemhauser, “The k-Domination and k-Stability Problem on Graphs,” Technical Report 540, School of Operations Research and Industrial Eng., Corenll Univ., 1982.
[48] The Network Simulator NS-2,, 2009.
[49] B. Krishnamachari, S. Wicker, and R. Bejar, “Phase Transition Phenomena in Wireless Ad-Hoc Networks,” Proc. IEEE GLOBECOM, 2001.
[50] A. Youssef, M. Youssef, M. Younis, and A. Agrawala, “The Overlapped K-Hop (OK) Clustering Algorithm,” Technical Report CS-TR-4735, Dept. of Computer Science, Univ. of Maryland, July 2005.
[51] M. Youssef, A. Youssef, and M. Younis, “Overlapping Multi-Hop Clustering for Wireless Sensor Networks,” Technical Report WINC-TR-1001, Wireless Intelligent Networking Center, Nile Univ., Sept. 2008.
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool