Overlapping-Node Removal Algorithm Considering the Sensing Coverage of the Node in WSN

Lee, Doo-Wan; Kim, Chang-Joon; Jang, Kyung-Sik

doi:10.1007/978-94-007-5860-5_70

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, keeping the WSN connected is also important because sensing data may need to be sent to the data center [6].The paper [7]proposed an overlapping-node Removal Algorithm (ODRA) that utilizes the backup node to detect the nodes in WSN sensing coverage overlapping node.…”

Section: Introductionmentioning

confidence: 99%

Finding the Overlapped Covered Sub-regions , and the Maximum Covered Regions inWSN by Using Net Arcs (NA)Method

Ghoul¹,

He²,

Mama³

2017

Proceedings of the 3rd International Conference on Wireless Communication and Sensor Networks (WCSN 2016)

View full text Add to dashboard Cite

Abstract-One of the fundamental issues in WSN is the design of energy efficient approaches that achieve full area coverage and maintain the connectivity of the whole network. Coverage reflects how well a sensor field is monitored. In order to monitor the area of interest in the most efficient way, finding the connected covered sub-regions allows the use of Sleep scheduling techniques that put cooperatively the nodes monitoring these areas into sleep-mode without increasing the response time of the network. In our work, we use the idea of graph theory and we propose a new method called Net Arcs (NA) that transform the graph model from theory state to the real time. We use some techniques to find the all overlapped covered sub-regions (2-Edges) and (3-Edges) and we ensure the connectivity of the network by finding the maximum covered regions. Finding these sub-regions increases WSN lifetime and provides improved coverage performance.

show abstract

Section: Introductionmentioning

confidence: 99%