A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

Vinh Tran-Quang, Takumi Miyoshi

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environments and embedded systems. WSNs consist of many nodes spread randomly over a wide area; therefore, the sensing regions of different nodes may overlap partially. This is called the "sensing coverage problem". In this paper, we define a maximum sensing coverage region (MSCR) problem and present a novel gossip-based sensing-coverage-aware algorithm to solve the problem. In the algorithm, sensor nodes gossip with their neighbors about their sensing coverage region. In this way, nodes decide locally to forward packets (as an active node) or to disregard packets (as a sleeping or redundant node). Being sensing-coverage-aware, the redundant node can cut back on its activities whenever its sensing region is k-covered by enough neighbors. With the distributed and low-overhead traffic benefits of gossip, we spread energy consumption to different sensor nodes, achieve maximum sensing coverage with minimal energy consumption in each individual sensor node, and prolong the whole network lifetime. We apply our algorithm to improve LEACH, a clustering routing protocol for WSNs, and develop a simulation to evaluate the performance of the algorithm.

Original languageEnglish
Pages (from-to)2275-2287
Number of pages13
JournalComputer Networks
Volume53
Issue number13
DOIs
Publication statusPublished - 2009 Aug 28

Fingerprint

Wireless sensor networks
Sensor nodes
Energy utilization
Routing protocols
Embedded systems
Monitoring

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

A novel gossip-based sensing coverage algorithm for dense wireless sensor networks. / Tran-Quang, Vinh; Miyoshi, Takumi.

In: Computer Networks, Vol. 53, No. 13, 28.08.2009, p. 2275-2287.

Research output: Contribution to journalArticle

@article{51d63c56bede4d0986d0a9dc5d60dcde,
title = "A novel gossip-based sensing coverage algorithm for dense wireless sensor networks",
abstract = "Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environments and embedded systems. WSNs consist of many nodes spread randomly over a wide area; therefore, the sensing regions of different nodes may overlap partially. This is called the {"}sensing coverage problem{"}. In this paper, we define a maximum sensing coverage region (MSCR) problem and present a novel gossip-based sensing-coverage-aware algorithm to solve the problem. In the algorithm, sensor nodes gossip with their neighbors about their sensing coverage region. In this way, nodes decide locally to forward packets (as an active node) or to disregard packets (as a sleeping or redundant node). Being sensing-coverage-aware, the redundant node can cut back on its activities whenever its sensing region is k-covered by enough neighbors. With the distributed and low-overhead traffic benefits of gossip, we spread energy consumption to different sensor nodes, achieve maximum sensing coverage with minimal energy consumption in each individual sensor node, and prolong the whole network lifetime. We apply our algorithm to improve LEACH, a clustering routing protocol for WSNs, and develop a simulation to evaluate the performance of the algorithm.",
keywords = "Algorithm, Energy efficiency, Gossip-based, Routing protocol, Sensing coverage, Wireless sensor networks",
author = "Vinh Tran-Quang and Takumi Miyoshi",
year = "2009",
month = "8",
day = "28",
doi = "10.1016/j.comnet.2009.04.003",
language = "English",
volume = "53",
pages = "2275--2287",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "13",

}

TY - JOUR

T1 - A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

AU - Tran-Quang, Vinh

AU - Miyoshi, Takumi

PY - 2009/8/28

Y1 - 2009/8/28

N2 - Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environments and embedded systems. WSNs consist of many nodes spread randomly over a wide area; therefore, the sensing regions of different nodes may overlap partially. This is called the "sensing coverage problem". In this paper, we define a maximum sensing coverage region (MSCR) problem and present a novel gossip-based sensing-coverage-aware algorithm to solve the problem. In the algorithm, sensor nodes gossip with their neighbors about their sensing coverage region. In this way, nodes decide locally to forward packets (as an active node) or to disregard packets (as a sleeping or redundant node). Being sensing-coverage-aware, the redundant node can cut back on its activities whenever its sensing region is k-covered by enough neighbors. With the distributed and low-overhead traffic benefits of gossip, we spread energy consumption to different sensor nodes, achieve maximum sensing coverage with minimal energy consumption in each individual sensor node, and prolong the whole network lifetime. We apply our algorithm to improve LEACH, a clustering routing protocol for WSNs, and develop a simulation 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 environments and embedded systems. WSNs consist of many nodes spread randomly over a wide area; therefore, the sensing regions of different nodes may overlap partially. This is called the "sensing coverage problem". In this paper, we define a maximum sensing coverage region (MSCR) problem and present a novel gossip-based sensing-coverage-aware algorithm to solve the problem. In the algorithm, sensor nodes gossip with their neighbors about their sensing coverage region. In this way, nodes decide locally to forward packets (as an active node) or to disregard packets (as a sleeping or redundant node). Being sensing-coverage-aware, the redundant node can cut back on its activities whenever its sensing region is k-covered by enough neighbors. With the distributed and low-overhead traffic benefits of gossip, we spread energy consumption to different sensor nodes, achieve maximum sensing coverage with minimal energy consumption in each individual sensor node, and prolong the whole network lifetime. We apply our algorithm to improve LEACH, a clustering routing protocol for WSNs, and develop a simulation to evaluate the performance of the algorithm.

KW - Algorithm

KW - Energy efficiency

KW - Gossip-based

KW - Routing protocol

KW - Sensing coverage

KW - Wireless sensor networks

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

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

U2 - 10.1016/j.comnet.2009.04.003

DO - 10.1016/j.comnet.2009.04.003

M3 - Article

VL - 53

SP - 2275

EP - 2287

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 13

ER -