Potential game model to detect holes in sensor networks

Authors:
Y. B. Reddy
Affiliations:
Grambling State University, LA
Venue:
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Year:
2009

Citing 9
Cited 0

The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
JAM: A Jammed-Area Mapping Service for Sensor Networks

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
The holes problem in wireless sensor networks: a survey

ACM SIGMOBILE Mobile Computing and Communications Review
Topological hole detection in wireless sensor networks and its applications

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Differential games in large-scale sensor-actuator networks

Proceedings of the 5th international conference on Information processing in sensor networks
Coverage and hole-detection in sensor networks via homology

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
A Location-free Algorithm of Energy-Efficient Connected Coverage for High Density Wireless Sensor Networks

Discrete Event Dynamic Systems
Sensor coverage in wireless ad hoc sensor networks

International Journal of Sensor Networks
Energy-efficient connected-coverage in wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Identifying sensor holes is one of the important subjects in wireless sensor networks. Holes happen when one or more sensors are not functioning or few sensors are missing during deployment in any designated area. The presence of holes hinders the information flow in sensor networks. Different coverage models are developed recently and very few or no attempt was made to detect the sensor holes using game models. This paper presents the potential game model for detecting holes in sensor networks.