Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Markov-based channel model algorithm for wireless networks
Wireless Networks
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Improving wireless simulation through noise modeling
Proceedings of the 6th international conference on Information processing in sensor networks
Self-monitoring for sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks
International Journal of Distributed Sensor Networks - Selected Papers in Innovations and Real-Time Applications of Distributed Sensor Networks
DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks
IEEE Transactions on Wireless Communications
Energy-efficient data redistribution in sensor networks
ACM Transactions on Sensor Networks (TOSN)
IEEE/ACM Transactions on Networking (TON)
Energy efficient in-network data indexing for mobile wireless sensor networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the monitoring architecture, most existing work focuses on minimizing the number of monitoring nodes. However, with less monitoring points, the false alarm rate may increase as a consequence. In this paper, we study the fundamental tradeoff between the number of monitoring nodes and the false alarm rate in the wireless sensor networks. Specifically, we propose fully distributed monitoring algorithms, to build up a poller-pollee based architecture with the objective to minimize the number of overall pollers while bounding the false alarm rate. Based on the established monitoring architecture, we further explore the hop-by-hop aggregation opportunity along the multihop path from the polee to the poller, with the objective to minimize the monitoring overhead. We show that the optimal aggregation path problem is NP-hard and propose an opportunistic greedy algorithm, which achieves an approximation ratio of 5/4. As far as we know, this is the first proved constant approximation ratio applied to the aggregation path selection schemes over the wireless sensor networks.