The Community for Technology Leaders
RSS Icon
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
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.
Distributed networks, Wireless communication
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.68
[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.
[5] S. Kumar, T. Lai, and J. Balogh, “On k-Coverage in a Mostly Sleeping Sensor Network,” Proc. ACM MobiCom '04, pp. 144-158, 2004.
[6] P.-J. Wan and C.-W. Yi, “Coverage by Randomly Deployed Wireless Sensor Networks,” IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2658-2669, 2006.
[7] G. Wang, G. Cao, and T.L. Porta, “Movement-Assisted Sensor Deployment,” Proc. IEEE INFOCOM '04, pp. 2469-2479, 2004.
[8] Y. Zou and K. Chakrabarty, “Sensor Deployment and Target Localization Based on Virtual Forces,” Proc. IEEE INFOCOM '03, pp. 1293-1303, 2003.
[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.
[11] T. Leighton and P.W. Shor, “Tight Bounds for Minimax Grid Matching, with Applications to the Average Case Analysis of Algorithms,” Combinatorica, vol. 9, no. 2, pp. 161-187, 1989.
[12] MIT Cricket Platform, http:/, 2008.
[13] Parallax, boebotboebot.asp, 2008.
[14] B. Liu, P. Brass, O. Dousse, P. Nain, and D. Towsley, “Mobility Improves Coverage of Sensor Networks,” Proc. ACM MobiHoc '05, pp. 300-308, 2005.
[15] M. Zhang, X. Du, and K. Nygard, “Improving Coverage Performance in Sensor Networks by Using Mobile Sensors,” Proc. IEEE Military Comm. Conf. (MILCOM '05), pp. 3335-3341, 2005.
[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.
[17] J. Wu and S. Yang, “SMART: A Scan-Based Movement-Assisted Sensor Deployment Method in Wireless Sensor Networks,” Proc. IEEE INFOCOM '05, pp. 2313-2324, 2005.
[18] J. Luo and J.P. Hubaux, “Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks,” Proc. IEEE INFOCOM '05, pp. 1735-1746, 2005.
[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.
[21] S. Chellappan, W. Gu, X. Bai, and D. Xuan, “Deploying Wireless Sensor Networks under Limited Mobility Constraints,” IEEE Trans. Mobile Computing, vol. 6, no. 10, pp. 1142-1157, Oct. 2007.
[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.
[25] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” Proc. First ACM Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 28-39, 2003.
[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.
[28] G. Wang, G. Cao, T.L. Porta, and W. Zhang, “Sensor Relocation in Mobile Sensor Networks,” Proc. IEEE INFOCOM '05, pp.2302-2312, 2005.
[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.
[33] A. Goldberg and R. Tarjan, “A New Approach to the Maximum-Flow Problem,” J. ACM, vol. 35, no. 4, pp. 921-940, 1988.
[34] A. Goldberg and R. Tarjan, “Finding Minimum-Cost Circulations by Successive Approximation,” Math. Operations Research, vol. 15, no. 3, pp. 430-466, 1990.
[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, , 2008.
[37] Video of Mobile Implementations, , 2008.
[38] S. Janson, T. Luczak, and A. Ruciński, Random Graphs. John Wiley & Sons, 2000.
[39] W. Hoeffding, “Probability Inequalities for Sums of Bounded Random Variables,” J. Am. Statistical Assoc., vol. 58, no. 301, pp. 13-30, 1963.
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool