Deakin University
Browse
xiang-targetcoveragethrough-2015.pdf (1.13 MB)

Target coverage through distributed clustering in directional sensor networks

Download (1.13 MB)
Version 3 2024-06-17, 14:52
Version 2 2024-06-06, 09:57
Version 1 2015-09-01, 15:08
journal contribution
posted on 2024-06-17, 14:52 authored by MM Islam, M Ahasanuzzaman, MA Razzaque, MM Hassan, A Alelaiwi, Y Xiang
Maximum target coverage with minimum number of sensor nodes, known as an MCMS problem, is an important problem in directional sensor networks (DSNs). For guaranteed coverage and event reporting, the underlying mechanism must ensure that all targets are covered by the sensors and the resulting network is connected. Existing solutions allow individual sensor nodes to determine the sensing direction for maximum target coverage which produces sensing coverage redundancy and much overhead. Gathering nodes into clusters might provide a better solution to this problem. In this paper, we have designed distributed clustering and target coverage algorithms to address the problem in an energy-efficient way. To the best of our knowledge, this is the first work that exploits cluster heads to determine the active sensing nodes and their directions for solving target coverage problems in DSNs. Our extensive simulation study shows that our system outperforms a number of state-of-the-art approaches.

History

Journal

EURASIP journal on wireless communications and networking

Volume

2015

Article number

167

Pagination

1-18

Location

Heidelberg, Germany

Open access

  • Yes

ISSN

1687-1472

eISSN

1687-1499

Language

eng

Publication classification

C Journal article, C1 Refereed article in a scholarly journal

Copyright notice

2015, The Authors

Publisher

SpringerOpen