EETO: an energy-efficient target-oriented clustering protocol in wireless sensor networks

  • Authors:
  • Weifang Cheng;Xiangke Liao;Changxiang Shen;Dezun Dong

  • Affiliations:
  • School of Computer, National University of Defense Technology, China;School of Computer, National University of Defense Technology, China;School of Computer, National University of Defense Technology, China;School of Computer, National University of Defense Technology, China

  • Venue:
  • ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A large number of sensors are usually deployed around some discrete targets in wireless sensor networks for target surveillance purpose. In such networks, clustering is beneficial not only to network management and data aggregation, but also to the target coverage issues. This paper builds a target coverage relation model for target surveillance networks. Based on this model, we abstract the clustering as finding the minimum K-hop dominating set which is proved to be NP complete. Then, we propose a distributed energy-efficient target-oriented clustering protocol (EETO). EETO partitions the network into multiple connected sub-branches based on the corresponding target-oriented relation graph. Each sub-branch is a cluster, where the cluster members are all the K-hop coverage neighbors of the cluster head. EETO groups the sensors which cover the same target set into one cluster. Therefore, related data can be aggregated timely and completely at the cluster head. The message overhead of EETO is only O(1), which is scalable. Detailed simulation results show that EETO reduces energy consumption, improves load balancing and prolongs the coverage lifetime of the network.