Energy-efficient distributed clustering in wireless sensor networks

The deployment of wireless sensor networks in many application areas requires self-organization of the network nodes into clusters. Clustering is a network management technique, since it creates a hierarchical structure over a flat network. Quite a lot of node clustering techniques have appeared in the literature, and roughly fall into two families: those based on the construction of a dominating set and those which are based solely on energy considerations. The former family suffers from the fact that only a small subset of the network nodes are responsible for relaying the messages, and thus cause rapid consumption of the energy of these nodes. The latter family uses the residual energy of each node in order to decide about whether it will elect itself as a leader of a cluster or not. This family's methods ignore topological features of the nodes and are used in combination with the methods of the former family. We propose an energy-efficient distributed clustering protocol for wireless sensor networks, based on a metric for characterizing the significance of a node, w.r.t. its contribution in relaying messages. The protocol achieves small communication complexity and linear computation complexity. Experimental results attest that the protocol improves network longevity.

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

[2]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[3]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[4]  Rami Langar,et al.  Mobility-aware clustering algorithms with interference constraints in wireless mesh networks , 2009, Comput. Networks.

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

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

[7]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[8]  Dimitrios Gunopulos,et al.  Online outlier detection in sensor data using non-parametric models , 2006, VLDB.

[9]  Yu-Chee Tseng,et al.  Wireless sensor networks for emergency navigation , 2006, Computer.

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

[11]  Hyuk Lim,et al.  J-Sim: a simulation and emulation environment for wireless sensor networks , 2006, IEEE Wireless Communications.

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

[13]  A. Agrawala,et al.  WSN16-5: Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks , 2006, IEEE Globecom 2006.

[14]  Prasun Sinha,et al.  Structure-Free Data Aggregation in Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[15]  Makoto Takizawa,et al.  A Survey on Clustering Algorithms for Wireless Sensor Networks , 2010, 2010 13th International Conference on Network-Based Information Systems.

[16]  Samuel Pierre,et al.  On the Planning of Wireless Sensor Networks: Energy-Efficient Clustering under the Joint Routing and Coverage Constraint , 2009, IEEE Transactions on Mobile Computing.

[17]  Levente Buttyán,et al.  PANEL: Position-based Aggregator Node Election in Wireless Sensor Networks , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

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

[19]  Robin Kravets,et al.  Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[20]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Jie Wu,et al.  An Energy Efficient Clustering Scheme in Wireless Sensor Networks , 2007, Ad Hoc Sens. Wirel. Networks.

[23]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[24]  Deborah Estrin,et al.  Habitat monitoring with sensor networks , 2004, CACM.

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

[26]  Wendi B. Heinzelman,et al.  Cluster head election techniques for coverage preservation in wireless sensor networks , 2009, Ad Hoc Networks.

[27]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[28]  Alessandro Panconesi,et al.  Localized protocols for ad hoc clustering and backbone formation: a performance comparison , 2006, IEEE Transactions on Parallel and Distributed Systems.

[29]  Deborah Estrin,et al.  Geography-informed energy conservation for ad hoc networks , 2001, ACM/IEEE International Conference on Mobile Computing and Networking.

[30]  Li-Chun Wang,et al.  Distributed clustering algorithms for data-gathering in wireless mobile sensor networks , 2007, J. Parallel Distributed Comput..

[31]  Jie Wu,et al.  EECS: an energy efficient clustering scheme in wireless sensor networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[32]  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).

[33]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

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

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

[36]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[37]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[38]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[39]  Ossama Younis,et al.  Node clustering in wireless sensor networks: recent developments and deployment challenges , 2006, IEEE Network.

[40]  Jian Pei,et al.  An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation , 2007, IEEE Transactions on Parallel and Distributed Systems.

[41]  Shashi Phoha,et al.  Self-organizing sensor networks for integrated target surveillance , 2006, IEEE Transactions on Computers.