A bidding protocol for deploying mobile sensors

In some harsh environments, manually deploying sensors is impossible. Alternative methods may lead to imprecise placement resulting in coverage holes. To provide the required high coverage in these situations, we propose to deploy sensor networks composed of a mixture of mobile and static sensors in which mobile sensors can move from dense areas to sparse areas to improve the overall coverage. This paper presents a bidding protocol to assist the movement of mobile sensors. In the protocol, static sensors detect coverage holes locally by using Voronoi diagrams, and bid for mobile sensors based on the size of the detected hole. Mobile sensors choose coverage holes to heal based on the bid. Simulation results show that our algorithm provides suitable tradeoff between coverage and sensor cost.

[1]  Daniel E. Koditschek,et al.  Robot planning and control via potential functions , 1989 .

[2]  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).

[3]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[4]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[5]  Nael B. Abu-Ghazaleh,et al.  Infrastructure tradeoffs for sensor networks , 2002, WSNA '02.

[6]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  E. Kleinberg,et al.  Approximation algorithms for set cover and related problems , 1998 .

[9]  Thomas F. La Porta,et al.  Proxy-based sensor deployment for mobile sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[10]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[11]  S. Sitharama Iyengar,et al.  Sensor placement for grid coverage under imprecise detections , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[12]  Qun Li,et al.  Distributed algorithms for guiding navigation across a sensor network , 2003, MobiCom '03.

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

[14]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[15]  Gregory J. Pottie,et al.  Wireless sensor networks , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[16]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[17]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[18]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[19]  Gaurav S. Sukhatme,et al.  Robomote: enabling mobility in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[20]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[21]  Gaurav S. Sukhatme,et al.  Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[22]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[23]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[24]  Alfred O. Hero,et al.  Using proximity and quantized RSS for sensor localization in wireless networks , 2003, WSNA '03.

[25]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[26]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[27]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[28]  Proceedings. 11th IEEE International Conference on Network Protocols , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[29]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[30]  Hanif D. Sherali,et al.  Prolonging sensor network lifetime with energy provisioning and relay node placement , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[31]  Bruce Randall Donald,et al.  Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.