Skip to main content
Article thumbnail
Location of Repository

Maximum network lifetime in wireless sensor networks with adjustable sensing ranges

By Mihaela Cardei, Jie Wu, Mingming Lu and Mohammad O. Pervaiz

Abstract

Abstract — This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient power management can extend network lifetime. In this paper we consider a large number of sensors with adjustable sensing range that are randomly deployed to monitor a number of targets. Since targets are redundantly covered by more sensors, in order to conserve energy resources, sensors can be organized in sets, activated successively. In this paper we address the Adjustable Range Set Covers (AR-SC) problem that has as its objective finding a maximum number of set covers and the ranges associated with each sensor, such that each sensor set covers all the targets. A sensor can participate in multiple sensor sets, but sum of the energy spent in each set is constrained by the initial energy resources. In this paper we mathematically model solutions to this problem and design heuristics that efficiently compute the sets. Simulation results are presented to verify our approaches

Topics: wireless sensor networks, energy efficiency, sensor scheduling
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.9735
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.fau.edu/~mihael... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.