Minimum connected cover of a query region in heterogeneous wireless sensor networks

  • Authors:

  • Ahmed M. Khedr;Walid Osamy

  • Affiliations:

  • Computer Science Department, Faculty of Sciences, University of Sharjah, Sharjah, United Arab Emirates and Mathematics Department, Faculty of Science, Zagazig University, Zagazig, Egypt;Computer Science Department, Faculty of Computers and Informatics, Banha University, Banha, Egypt

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.07

Visualization

Abstract

Wireless sensor networks are composed of a large number of tiny sensors that have limited resources and yet must form a connected network. The main challenge in the design of sensor networks is the limited battery power of the sensors and the difficulty of replacing and/or recharging these batteries due to the nature of the monitored field. Thus, it is necessary that the sensors be densely deployed and energy-efficient protocols be designed to maximize the network lifetime while meeting the specific application requirements in terms of coverage and connectivity. Given a query over a sensor network the minimum connected sensor cover problem is to select a minimum, or nearly minimum, set of sensors such that the selected sensors cover the query region and form a connected network. In this paper, we propose a new distributed algorithm to find the minimum connected cover of the queried region for heterogeneous sensors, each with arbitrary sensing and transmission radii and different energy levels. Each sensor node in the network determines whether to sense the queried region according to its minimum-weight coverage cost. We provide performance metrics to analyze the performance of our approach and the simulation results show that our approach clearly improves the network lifetime over existing algorithms.