Abstract

Recent developments in wireless communication and embedded computing technologies have led to the advent of wireless sensor network technology. Hundreds of thousands of these micro sensors can be deployed in many areas including health, environment and battlefield in order to monitor the domain with desired level of accuracy. When wireless sensors are deployed in an area, the lifetime of the network should last as long as possible according to the original amount of energy. Therefore, reducing energy consumption in WSNs is of primary concern. We have proposed a node scheduling solution that solves the coverage and connectivity problem in sensor networks in an integrated manner. In this way we will divide network life time to finite number of rounds and in each round we will generate a coverage bitmap of sensors of the domain and based on this bitmap it will decided which sensors remain active or go to sleep. We will check the connection of the sensor network by using Laplacian of adjancy graph of active nodes in each round. Also the network will be capable of producing desired percentage of coverage by using coverage bitmap. We will define the connected coverage problem as an optimization problem and we will seek a solution for the problem by using Genetic Algorithm optimization method.

Highlights

  • Recent advancements in wireless technology have paved the way for wireless sensor network technology

  • In this paper the authors proof that when Rc ≥ 2Rs, the Ks-coverage (Ks-coverage means an area is covered at least Ks times) guaranty Kc-Connectivity (Kc-Connectivity means there is Kc node disjoint path between each to node of the network)

  • As can be seen in figure network life time increases when percentage coverage slightly decreases from 100 percent, but there is not linear relationship between desired percentage of coverage and network life time

Read more

Summary

Introduction

Recent advancements in wireless technology have paved the way for wireless sensor network technology. Monitoring accuracy, which was hardly achievable by other technology, is more available by wireless sensor networks, even monitoring of some hazardous area, which was, previously impossible or hard to achieve are possible [1,2,3]. When a wireless sensor network was deployed, its lifetime must last as long as possible. One of the approach to prolong network lifetime is topology control [4,5,6] which is referred to using node redundancy for sensing or communication subsystem, when we have more nodes than sufficient, to achieve desired level of connectivity or coverage in the network. We have used topology control to prolong network lifetime. In the same time we have devised a mechanism to provide specified percentage of coverage and we will use this concept to further extend the network lifetime when appropriate.

Related Works
Problem Definition
Connectivity Constraint
Energy Constraint
Medium Size Network
Large Size Network
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.