Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
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
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Performance measurements of motes sensor networks
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Localization from Connectivity in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
A MAC Protocol to Reduce Sensor Network Energy Consumption Using a Wakeup Radio
IEEE Transactions on Mobile Computing
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Redundancy and coverage detection in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Determining active sensor nodes for complete coverage without location information
International Journal of Ad Hoc and Ubiquitous Computing
IEEE Communications Magazine
A three-tiered node scheduling scheme for sparse sensing in wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
One of the major requirements for new wireless sensor networks is to extend the lifetime of the network. Node-scheduling techniques have been used extensively for this purpose. Some existing approaches rely mainly on location information through global positioning system (GPS) devices for designing efficient scheduling strategies. However, integration of GPS devices with sensor nodes is expensive and increases the cost of deployment dramatically. In this paper we present a location-free solution for node scheduling. Our scheme is based on a graph theoretical approach using minimum dominating sets. We propose a heuristic to extract a collection of dominating sets. Each set consists of a group of working nodes which ensures a high level of network coverage. At each round, one set is responsible for covering the sensor field while the nodes in other sets are in sleep mode. We evaluate our solution through simulations and discuss our future research directions.