Hausdorff Clustering and Minimum Energy Routing for Wireless Sensor Networks

The authors present a new method for data gathering that maximizes lifetime for wireless sensor networks. It involves three parts. First, nodes organize themselves into several static clusters by the Hausdorff clustering algorithm based on node locations, communication efficiency, and network connectivity. Second, clusters are formed only once, and the role of the cluster head is optimally scheduled among the cluster members. We formulate the maximum lifetime cluster-head scheduling as an integer-programming problem and propose a greedy algorithm for its solution. Third, after cluster heads are selected, they form a backbone network to periodically collect, aggregate, and forward data to the base station using minimum energy (cost) routing. This method can significantly lengthen the network lifetime when compared with other known methods.

[1]  David E. Culler,et al.  System architecture directions for networked sensors , 2000, SIGP.

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

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

[4]  Fabian Kuhn,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[5]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Mario Gerla,et al.  On-demand routing in large ad hoc wireless networks with passive clustering , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

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

[8]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

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

[10]  Ravi Prakash,et al.  Load-balancing clusters in wireless ad hoc networks , 2000, Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology.

[11]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[13]  Qing Zhao,et al.  On the lifetime of wireless sensor networks , 2005, IEEE Communications Letters.

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

[15]  Parameswaran Ramanathan,et al.  Fault tolerance in collaborative sensor networks for target detection , 2004, IEEE Transactions on Computers.

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

[18]  Yanwei Wang,et al.  Relative location in wireless networks , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

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

[20]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[21]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[22]  Deborah Estrin,et al.  Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks , 2002 .

[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]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[25]  Krishnendu Chakrabarty,et al.  Location-aided flooding: an energy-efficient data dissemination protocol for wireless-sensor networks , 2005, IEEE Transactions on Computers.

[26]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[27]  Samir Khuller,et al.  A clustering scheme for hierarchical control in multi-hop wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[28]  Lui Sha,et al.  Dynamic clustering for acoustic target tracking in wireless sensor networks , 2003, IEEE Transactions on Mobile Computing.

[29]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

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

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