Coverage-aware self-scheduling in sensor networks

One important measurement of a sensor network's performance is how well the sensor network can monitor a covered area, namely network coverage. We propose a scheme to improve the network coverage of a sensor network. We assume that each sensor can probabilistically detect a nearby event, and build a probabilistic model of network coverage by considering the data correlation among neighboring sensors. We also define the sensing denomination (SD) of a sensor using the network coverage model. A sensor's SD is regarded as the measurement of its contribution to the network coverage. The more the contribution of a sensor to the network coverage, the higher the sensor's SD is. Based on the location information of neighboring sensors, each sensor can calculate its SD value in a distributed manner. We then propose coverage-aware self-scheduling, in which sensors periodically calculate their SD values and probabilistically schedule their active and hibernating states according to their SD values, so that sensors with higher SD values have more chance to stay active. With the same amount of energy consumed, better network coverage can be achieved by applying the scheme. We then demonstrate through a numerical study that the scheme improves sensor network coverage considerably.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[3]  Jan M. Rabaey,et al.  Energy aware routing for low energy ad hoc sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[4]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[5]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[6]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[7]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[8]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Chris Savarese.  LOCATIONING IN DISTRIBUTED AD-HOC WIRELESS SENSOR NETWORKS , 2001 .

[10]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[11]  Jan M. Rabaey,et al.  Location in distributed ad-hoc wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[12]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[15]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[16]  Miodrag Potkonjak,et al.  Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure , 2001, MobiHoc '01.

[17]  Gregory J. Pottie,et al.  Self-organizing distributed sensor networks , 1999, Defense, Security, and Sensing.