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

DOI

10.2991/icwcsn-16.2017.140How to use a DOI?

Keywords

wireless sensor networks; wireless sensor network routing; sensor's groups; energy efficiency; network lifetime; net arcs

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.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ghoul Rafia
AU  - Jing He
AU  - Toure Fatoumata Dite Mama
PY  - 2016/12
DA  - 2016/12
TI  - Finding the Overlapped Covered Sub-regions , and the Maximum Covered Regions inWSN by Using Net Arcs (NA)Method
BT  - Proceedings of the 3rd International Conference on Wireless Communication and Sensor Networks (WCSN 2016)
PB  - Atlantis Press
SP  - 685
EP  - 693
SN  - 2352-538X
UR  - https://doi.org/10.2991/icwcsn-16.2017.140
DO  - 10.2991/icwcsn-16.2017.140
ID  - Rafia2016/12
ER  -