An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks

  • Xu Li
  • Nicola Santoro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4325)


In mobile sensor networks, the coverage improvement problem, i.e., maximizing and/or maintaining overall sensing coverage, is a fundamental research issue attracting many researchers. Existing coverage improvement algorithms such as sensor self-deployment algorithms and sensor relocation protocols enhance coverage with limitations due to their specialized design purposes. In this paper, we propose an integrated self-deployment and coverage maintenance scheme, which solves the coverage improvement problem in a complete sense. The proposed scheme is an integration of four algorithms: a node redundancy determination algorithm, a sensor self-deployment algorithm, a sensor relocation protocol, and a sensor replenishment protocol. By this scheme, redundant sensors are placed together with non-redundant ones in the target field at random; non-redundant sensors autonomously scatter to form a network with maximal coverage after initial placement; all the sensors collaborate to compensate coverage loss throughout network lifetime. Mentionably, we notice that no existing scheme besides ours take into account the impact on coverage from nodal sensing range diminishment. At the end, we summarize the paper and discuss our future work.


Time Slot Boundary Node Node Failure Network Boundary Sensor Deployment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Howard, A., Mataric, M.J., Sukhatme, G.S.: An Incremental Self-Deployment Algorithm for Mobile Sensor Networks. Autonomous Robots 13(2), 113–126 (2002)MATHCrossRefGoogle Scholar
  2. 2.
    Howard, A., Mataric, M.J., Sukhatme, G.S.: Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem. In: Proc. of DARS, pp. 299–308 (2002)Google Scholar
  3. 3.
    Zou, Y., Chakrabarty, K.: Sensor deployment and target localization based on virtual forces. In: Proc. of IEEE INFOCOM, vol. 2, pp. 1293–1303 (2003)Google Scholar
  4. 4.
    Wang, G., Cao, G., Porta, T.L.: Movement-Assisted Sensor Deployment. In: Proc. of IEEE INFOCOM, vol. 4, pp. 2469–2479 (2004)Google Scholar
  5. 5.
    Heo, N., Varshney, P.K.: Energy-Efficient Deployment of Intelligent Mobile Sensor Networks. IEEE Tran. on Systems, Man, and CyberNetics - Part A: Systems and Humans 35(1), 78–92 (2005)CrossRefGoogle Scholar
  6. 6.
    Wu, J., Yang, S.: SMART: A Scan-Based Movement-Assisted Sensor Deployment Method in Wireless Sensor Networks. In: Proc. of IEEE INFOCOM, vol. 4, pp. 2313–2324 (2005)Google Scholar
  7. 7.
    Chellappan, S., Bai, X., Ma, B., Xuan, D.: Sensor Networks Deployment Using Flip-based Sensors. In: Proc. of IEEE MASS (2005)Google Scholar
  8. 8.
    Wang, G., Cao, G., Porta, T.L.: Proxy-Based Sensor Deployment for Mobile Sensor Networks. In: Proc. of IEEE MASS, pp. 493–502 (2004)Google Scholar
  9. 9.
    Wang, G., Cao, G., Porta, T.L., Zhang, W.: Sensor Relocation in Mobile Sensor Networks. In: Proc. of IEEE INFOCOM, pp. 2302–2312 (2005)Google Scholar
  10. 10.
    Li, X., Santoro, N.: ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks. In: Proc. of IEEE LCN/WLN (to appear, 2006)Google Scholar
  11. 11.
    Parker, L.E., Kannan, B., Fu, X., Tang, Y.: Heterogeneous Mobile Sensor Net Deployment Using Robot Herding and Line-of-Sight Formations. In: Proc. of IEEE IROS, vol. 3, pp. 2488–2493 (2003)Google Scholar
  12. 12.
    Mei, Y., Xian, C., Das, S., Hu, Y.C., Lu, Y.: Replacing Failed Sensor Nodes by Mobile Robots. In: Proc. of ICDCS/WWASN (to appear, 2006)Google Scholar
  13. 13.
    Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. In: Proc. of ACM DIALM, pp. 48–55 (1999)Google Scholar
  14. 14.
    Frey, H., Stojmenovic, I.: On Delivery Guarantees of Face and Combined Greedy-Face Routing Algorithms in Ad Hoc and Sensor Networks. In: Proc. of ACM MobiCom (to appear, 2006)Google Scholar
  15. 15.
    Santoro, N.: Election. In: Santoro, N. (ed.) Design and Analysis of Distributed Algorithms (in publication, 2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xu Li
    • 1
  • Nicola Santoro
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations