Computational geometry: an introduction
Computational geometry: an introduction
Computational complexity of art gallery problems
IEEE Transactions on Information Theory
A discrete-time battery model for high-level power estimation
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions
Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
A survey of application distribution in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Mobile object tracking in wireless sensor networks
Computer Communications
Optimal cluster-head deployment in wireless sensor networks with redundant link requirements
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Boundary coverage and coverage boundary problems in wireless sensor networks
International Journal of Sensor Networks
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Connected K-target coverage problem in wireless sensor networks with different observation scenarios
Computer Networks: The International Journal of Computer and Telecommunications Networking
Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Low-connectivity and full-coverage three dimensional wireless sensor networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
LACAS: learning automata-based congestion avoidance scheme for healthcare wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on wireless and pervasive communications for healthcare
Matching and Fairness in Threat-Based Mobile Sensor Coverage
IEEE Transactions on Mobile Computing
Adaptive listen for energy-efficient medium access control in wireless sensor networks
Multimedia Tools and Applications
Journal of Systems and Software
Reputation-based role assignment for role-based access control in wireless sensor networks
Computer Communications
IEEE Transactions on Network and Service Management
Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
Topology control based on optimally rigid graph in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Network and Computer Applications
Hi-index | 0.24 |
Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must be reduced for effective utilization of the available resources. If two nodes have the same coverage area in their active state, and if both the nodes are activated simultaneously, it leads to redundancy in network and wastage of precious sensor resources. In this paper, we address the problem of network coverage and connectivity and propose an efficient solution to maintain coverage, while preserving the connectivity of the network. The proposed solution aims to cover the area of interest (AOI), while minimizing the count of the active sensor nodes. The overlap region of two sensor nodes varies with the distance between the nodes. If the distance between two sensor nodes is maximized, the overall coverage area of these nodes will also be maximized. Also, to preserve the connectivity of the network, each sensor node must be in the communication range of at least one other node. Results of simulation of the proposed solution indicate up to 95% coverage of the area, while consuming very less energy of 9.44J per unit time in the network, simulated in an area of 2500m^2.