A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Computational geometry.
Coverage Issue in Sensor Networks with Adjustable Ranges
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
The coverage problem in a wireless sensor network
Mobile Networks and Applications
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
Exact distributed Voronoi cell computation in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Distributed voronoi diagram computation in wireless sensor networks
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Connected K-target coverage problem in wireless sensor networks with different observation scenarios
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Variable radii connected sensor cover in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence
Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence
A distributed algorithmic framework for coverage problems in wireless sensor networks
International Journal of Parallel, Emergent and Distributed Systems - Advances in Parallel and Distributed Computational Models
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Monitoring a large area with wireless sensor networks (WSNs) requires a very large number of sensor nodes which entails more energy consumption. One of the main design challenges in the WSNs is energy efficiency to prolong the network operable lifetime. Generally, most of the energy is spent for radio communication between sensor nodes. Another important requirement of WSN is that it should be self-organising, i.e. sensing ranges and transmission ranges are dynamically restructured with changing topology. Moreover, sensor nodes with variable sensing and transmission ranges facilitate less energy consumption and enhance the capacity of WSN significantly. An effective approach for energy conservation is turning off extraneous nodes, while the remaining nodes stay active to provide continuous monitoring service. An efficient planning of WSN using this approach can control the energy consumption of the whole network. In this paper, by using computational geometry theoretic, we propose a general algorithmic framework for dynamic topology construction of WSN for a given environmental monitoring application.