A virtual square grid-based coverage algorithm of redundant node for wireless sensor network

A virtual square grid-based coverage algorithm (VSGCA) is proposed in this paper. Each sensor node divides its sensing range into virtual square grids, if all the grids are covered by neighbors, the target node is redundant node. Compared with some previous algorithms, VSGCA can guarantee the covera...

Full description

Saved in:
Bibliographic Details
Published inJournal of network and computer applications Vol. 36; no. 2; pp. 811 - 817
Main Authors Liu, Yanheng, Suo, Longxiang, Sun, Dayang, Wang, Aimin
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Ltd 01.03.2013
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Coverage
Energy conservation
Exact sciences and technology
Radiocommunications
Software
Square grid
Telecommunications
Telecommunications and information theory
Theoretical computing
Wireless sensor network (WSN)
Coverage
Square grid
Energy conservation
Wireless sensor network (WSN)
Redundancy
Grid
Wireless network
Sensor array
Computational complexity
Online AccessGet full text

Cover

More Information
Summary:A virtual square grid-based coverage algorithm (VSGCA) is proposed in this paper. Each sensor node divides its sensing range into virtual square grids, if all the grids are covered by neighbors, the target node is redundant node. Compared with some previous algorithms, VSGCA can guarantee the coverage and connectivity in the whole network and has a computational complexity of O(n×M), which is less than most of other algorithms. Simulation results show that VSGCA can achieve better performance with fewer active nodes and lower computational complexity.
ISSN:1084-8045
1095-8592
DOI:10.1016/j.jnca.2012.12.003