Worst and best information exposure paths in wireless sensor networks

Authors:
Bang Wang;Kee Chaing Chua;Wei Wang;Vikram Srinivasan
Affiliations:
Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore;Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore;Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore;Department of Electrical and Computer Engineering (ECE), National University of Singapore (NUS), Singapore
Venue:
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Year:
2005

Citing 6
Cited 1

Exposure in wireless Ad-Hoc sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Sensor deployment strategy for target detection

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Introduction to Algorithms

Introduction to Algorithms
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems

Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes the concept of information exposure for a point and for a path based on estimation theory. The information exposure of a point is defined as the probability that the absolute value of estimation error is less than some threshold; and the information exposure for a path is the average information exposure of all points along the path. The higher the information exposure, the higher the confidence level that some information of a target is exposed and the better the target is monitored. An approximation algorithm is proposed to solve the problem of finding the worst (best) information exposure path in wireless sensor networks, and its performance is evaluated via simulations. Furthermore, a heuristic for adaptive sensor deployment is proposed to increase the information exposure of the worst information exposure path.