An algorithm for sensing coverage problem in tireless sensor networks

Vinh Tran Quang, Takumi Miyoshi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environment, embedded system and so on. In WSNs, substantial nodes are deployed randomly over the entire desired area; therefore, the sensing regions of different nodes may be partially overlapped. This is referred to as the sensing coverage problem. In this paper we first define a maximum sensing coverage region problem (MSCR) in WSNs and then solve the problem by the proposed algorithm. In our method, the maximum monitored area fully covered by a minimum active sensors. The main design features are: selecting a small number of delegated sensor nodes by identifying and removing redundant nodes in high-density networks and assigning them an off-duty operation while guarantees the whole area is k-covered, to make sure all events occurred in that area can be accurately and timely detected. We apply the proposed algorithm to improve LEACH, a hierarchical protocol for WSNs and develop a simulation program to evaluate the performance of the algorithm.

Original languageEnglish
Title of host publicationProceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF
DOIs
Publication statusPublished - 2008
Event2008 IEEE Sarnoff Symposium, SARNOFF - Princeton, NJ
Duration: 2008 Apr 282008 Apr 30

Other

Other2008 IEEE Sarnoff Symposium, SARNOFF
CityPrinceton, NJ
Period08/4/2808/4/30

Fingerprint

Sensor networks
Wireless sensor networks
Sensor nodes
Embedded systems
Network protocols
Monitoring
Sensors

Keywords

  • Algorithm
  • Energy-efficiency
  • Routing protocol
  • Sensing coverage
  • Wireless sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Quang, V. T., & Miyoshi, T. (2008). An algorithm for sensing coverage problem in tireless sensor networks. In Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF [4520056] https://doi.org/10.1109/SARNOF.2008.4520056

An algorithm for sensing coverage problem in tireless sensor networks. / Quang, Vinh Tran; Miyoshi, Takumi.

Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF. 2008. 4520056.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Quang, VT & Miyoshi, T 2008, An algorithm for sensing coverage problem in tireless sensor networks. in Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF., 4520056, 2008 IEEE Sarnoff Symposium, SARNOFF, Princeton, NJ, 08/4/28. https://doi.org/10.1109/SARNOF.2008.4520056
Quang VT, Miyoshi T. An algorithm for sensing coverage problem in tireless sensor networks. In Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF. 2008. 4520056 https://doi.org/10.1109/SARNOF.2008.4520056
Quang, Vinh Tran ; Miyoshi, Takumi. / An algorithm for sensing coverage problem in tireless sensor networks. Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF. 2008.
@inproceedings{d25be33528ee42589f795d13e25b73b8,
title = "An algorithm for sensing coverage problem in tireless sensor networks",
abstract = "Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environment, embedded system and so on. In WSNs, substantial nodes are deployed randomly over the entire desired area; therefore, the sensing regions of different nodes may be partially overlapped. This is referred to as the sensing coverage problem. In this paper we first define a maximum sensing coverage region problem (MSCR) in WSNs and then solve the problem by the proposed algorithm. In our method, the maximum monitored area fully covered by a minimum active sensors. The main design features are: selecting a small number of delegated sensor nodes by identifying and removing redundant nodes in high-density networks and assigning them an off-duty operation while guarantees the whole area is k-covered, to make sure all events occurred in that area can be accurately and timely detected. We apply the proposed algorithm to improve LEACH, a hierarchical protocol for WSNs and develop a simulation program to evaluate the performance of the algorithm.",
keywords = "Algorithm, Energy-efficiency, Routing protocol, Sensing coverage, Wireless sensor networks",
author = "Quang, {Vinh Tran} and Takumi Miyoshi",
year = "2008",
doi = "10.1109/SARNOF.2008.4520056",
language = "English",
isbn = "1424418437",
booktitle = "Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF",

}

TY - GEN

T1 - An algorithm for sensing coverage problem in tireless sensor networks

AU - Quang, Vinh Tran

AU - Miyoshi, Takumi

PY - 2008

Y1 - 2008

N2 - Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environment, embedded system and so on. In WSNs, substantial nodes are deployed randomly over the entire desired area; therefore, the sensing regions of different nodes may be partially overlapped. This is referred to as the sensing coverage problem. In this paper we first define a maximum sensing coverage region problem (MSCR) in WSNs and then solve the problem by the proposed algorithm. In our method, the maximum monitored area fully covered by a minimum active sensors. The main design features are: selecting a small number of delegated sensor nodes by identifying and removing redundant nodes in high-density networks and assigning them an off-duty operation while guarantees the whole area is k-covered, to make sure all events occurred in that area can be accurately and timely detected. We apply the proposed algorithm to improve LEACH, a hierarchical protocol for WSNs and develop a simulation program to evaluate the performance of the algorithm.

AB - Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environment, embedded system and so on. In WSNs, substantial nodes are deployed randomly over the entire desired area; therefore, the sensing regions of different nodes may be partially overlapped. This is referred to as the sensing coverage problem. In this paper we first define a maximum sensing coverage region problem (MSCR) in WSNs and then solve the problem by the proposed algorithm. In our method, the maximum monitored area fully covered by a minimum active sensors. The main design features are: selecting a small number of delegated sensor nodes by identifying and removing redundant nodes in high-density networks and assigning them an off-duty operation while guarantees the whole area is k-covered, to make sure all events occurred in that area can be accurately and timely detected. We apply the proposed algorithm to improve LEACH, a hierarchical protocol for WSNs and develop a simulation program to evaluate the performance of the algorithm.

KW - Algorithm

KW - Energy-efficiency

KW - Routing protocol

KW - Sensing coverage

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=49049090032&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049090032&partnerID=8YFLogxK

U2 - 10.1109/SARNOF.2008.4520056

DO - 10.1109/SARNOF.2008.4520056

M3 - Conference contribution

AN - SCOPUS:49049090032

SN - 1424418437

SN - 9781424418435

BT - Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF

ER -