Randomized algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Simulation Modeling and Analysis
Simulation Modeling and Analysis
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
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
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Smart Environments: Technology, Protocols and Applications (Wiley Series on Parallel and Distributed Computing)
A novel framework for energy and application-aware data gathering in wireless sensor networks
A novel framework for energy and application-aware data gathering in wireless sensor networks
Adaptive random sensor selection for field reconstruction in wireless sensor networks
Proceedings of the Sixth International Workshop on Data Management for Sensor Networks
Stochastic coverage analysis of wireless sensor network with hybrid sensing model
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
QoS-aware data reporting control in cluster-based wireless sensor networks
Computer Communications
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
On the Network Coverage Intensity in the Presence of Clock Asynchrony
Wireless Personal Communications: An International Journal
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.24 |
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall network performance depending on the type of applications. In this paper, we propose a novel coverage-adaptive random sensor scheduling for application-aware data-gathering in wireless sensor networks, with a goal to maximize the network lifetime. The underlying idea is to decide in each round (approximately) k data reporters (sensors) which can meet the desired sensing coverage specified by the users/applications. The selection of these k data reporters is based on a geometric probability theory and a randomization technique with constant computational complexity without exchanging control (location) information with local neighbors. The selected k data reporters for a round form a data gathering tree to get rid of wait-and-forward delay which may result from the random sensor scheduling and are scheduled to remain active (with transceiver on) during that round only, thus saving energy. All sensors have an equal opportunity to report sensed data periodically so the entire monitored area is covered within a fixed delay. Simulation results show that our proposed random sensor scheduling leads to a significant conservation of energy with a small trade-off between coverage and data reporting latency while meeting the coverage requirement given by the users/applications.