Subscribe

Issue No.11 - November (2008 vol.7)

pp: 1374-1387

Wei Wang , National University of Singapore, Singapore

Vikram Srinivasan , National University of Singapore, Singapore

Kee-Chaing Chua , National University of Singapore, Singapore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.68

ABSTRACT

This paper considers the coverage problem for hybrid networks which comprise both static and mobile sensors. The mobile sensors in our network only have limited mobility, i.e., they can move only once over a short distance. In random static sensor networks, sensor density should increase as O(log L + k log log L) to provide k-coverage in a network with a size of L. As an alternative, an all-mobile network can provide k-coverage with a constant density of O(k), independent of network size L. We show that the maximum distance for mobile sensors is O( 1/sqrt(k) log^(4/3)(kL)). We then propose a hybrid network structure, comprising static sensors and a small fraction of O( 1/sqrt(k)) of mobile sensors. For this network structure, we prove that k-coverage is also achievable with a constant sensor density of O(k). Furthermore, for this hybrid structure, we prove that the maximum distance which any mobile sensor has to move is bounded as O(log^(3/4)L). We then propose a distributed relocation algorithm, where each mobile sensor only requires local information in order to optimally relocate itself. We verify our analysis via extensive numerical evaluations and show an implementation of the mobility algorithm on real mobile sensor platforms.

INDEX TERMS

Distributed networks, Wireless communication

CITATION

Wei Wang, Vikram Srinivasan, Kee-Chaing Chua, "Coverage in Hybrid Mobile Sensor Networks",

*IEEE Transactions on Mobile Computing*, vol.7, no. 11, pp. 1374-1387, November 2008, doi:10.1109/TMC.2008.68REFERENCES

- [1] W. Wang, V. Srinivasan, and K.C. Chua, “Trade-Offs between Mobility and Density for Coverage in Wireless Sensor Networks,”
Proc. ACM MobiCom '07, pp. 39-50, 2007.- [2] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Network,”
Proc. IEEE INFOCOM '01, pp. 1380-1387, 2001.- [3] C. Huang and Y. Tseng, “The Coverage Problem in a Wireless Sensor Network,”
Proc. Second ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '03), pp. 519-528, 2003.- [4] H. Zhang and J. Hou, “On Deriving the Upper Bound of $\alpha\hbox{-}{\rm lifetime}$ for Large Sensor Networks,”
Proc. ACM MobiHoc '04, pp. 121-132, 2004.- [9] S. Chellappan, X. Bai, B. Ma, and D. Xuan, “Sensor Networks Deployment Using Flip-Based Sensors,”
Proc. Second IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS), 2005.- [10] J.T. Feddema, R.H. Byrne, J.J. Harrington, D.M. Kilman, C.L. Lewis, R.D. Robinett, B.P.V. Leeuwen, and J.G. Young, “Advanced Mobile Networking, Sensing, and Controls,” Technical Report SAND2005-1661, Sandia Nat'l Laboratories, 2005.
- [12]
MIT Cricket Platform, http:/cricket.csail.mit.edu/, 2008.- [13]
Parallax, http://www.parallax.com/html_pages/robotics/ boebotboebot.asp, 2008.- [16] J. Teng, T. Bolbrock, G. Cao, and T.L. Porta, “Sensor Relocation with Mobile Sensors: Design, Implementation, and Evaluation,”
Proc. Fourth IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS), 2007.- [19] W. Wang, V. Srinivasan, and K.C. Chua, “Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks,”
Proc. ACM MobiCom '05, pp. 270-283, 2005.- [20] Z.M. Wang, S. Basagni, E. Melachrinoudis, and C. Petrioli, “Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime,”
Proc. 38th Ann. Hawaii Int'l Conf. System Science (HICSS), 2005.- [22] Z. Lotker and A. Navarra, “Unbalanced Points and Vertices Problem,”
Proc. First IEEE PERCOM Int'l Workshop Foundations and Algorithms for Wireless Networking (FAWN '06), pp. 96-100, 2006.- [23] Z. Lotker and A. Navarra, “Managing Random Sensor Networks by Means of Grid Emulation,”
Proc. Fifth Int'l IFIP-TC6 Networking Conf. (NETWORKING '06), pp. 856-867, 2006.- [24] P. Hall,
Introduction to the Theory of Coverage Processes. John Wiley & Sons, 1988.- [26] R. Williams,
The Geometrical Foundation of Natural Structure: A Source Book of Design. Dover Publications, 1979.- [27] G. Wang, G. Cao, and T.L. Porta, “Proxy-Based Sensor Deployment for Mobile Sensor Networks,”
Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS), 2004.- [29] E. Kratzel,
Lattice Points. Kluwer Academic Publishers, 1989.- [30] A. Papoulis and S.U. Pillai,
Probability, Random Variables and Stochastic Processes, fourth ed. McGraw Hill, 2002.- [31] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin,
Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.- [32] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein,
Introduction to Algorithms, second ed. MIT Press and McGraw-Hill, 2001.- [35] A. Goel, S. Rai, and B. Krishnamachari, “Sharp Thresholds for Monotone Properties in Random Geometric Graphs,”
Proc. 36th ACM Symp. Theory of Computing (STOC '04), pp. 580-586, 2004.- [36]
Web Based Demo for Mobile Sensors, http://cnds.ece.nus.edu.sg/mobilemobile.html , 2008.- [37]
Video of Mobile Implementations, http://cnds.ece.nus.edu.sg/mobilemobile4.mpg , 2008.- [38] S. Janson, T. Luczak, and A. Ruciński,
Random Graphs. John Wiley & Sons, 2000. |