The Community for Technology Leaders
RSS Icon
Issue No.12 - December (2009 vol.8)
pp: 1649-1662
Chris Y.T. Ma , Purdue University, West Lafayette
David K.Y. Yau , Purdue University, West Lafayette
Jren-Chit Chin , Purdue University, West Lafayette
Nageswara S.V. Rao , Oak Ridge National Lab, Oak Ridge
Mallikarjun Shankar , Oak Ridge National Lab, Oak Ridge
Mobile sensors can be used to effect complete coverage of a surveillance area for a given threat over time, thereby reducing the number of sensors necessary. The surveillance area may have a given threat profile as determined by the kind of threat, and accompanying meteorological, environmental, and human factors. In planning the movement of sensors, areas that are deemed higher threat should receive proportionately higher coverage. We propose a coverage algorithm for mobile sensors to achieve a coverage that will match—over the long term and as quantified by an RMSE metric—a given threat profile. Moreover, the algorithm has the following desirable properties: 1) stochastic, so that it is robust to contingencies and makes it hard for an adversary to anticipate the sensor's movement, 2) efficient, and 3) practical, by avoiding movement over inaccessible areas. Further to matching, we argue that a fairness measure of performance over the shorter time scale is also important. We show that the RMSE and fairness are, in general, antagonistic, and argue for the need of a combined measure of performance, which we call efficacy. We show how a pause time parameter of the coverage algorithm can be used to control the trade-off between the RMSE and fairness, and present an efficient offline algorithm to determine the optimal pause time maximizing the efficacy. Finally, we discuss the effects of multiple sensors, under both independent and coordinated operation. Extensive simulation results—under realistic coverage scenarios—are presented for performance evaluation.
Wireless sensor network, mobile application, distributed systems.
Chris Y.T. Ma, David K.Y. Yau, Jren-Chit Chin, Nageswara S.V. Rao, Mallikarjun Shankar, "Matching and Fairness in Threat-Based Mobile Sensor Coverage", IEEE Transactions on Mobile Computing, vol.8, no. 12, pp. 1649-1662, December 2009, doi:10.1109/TMC.2009.83
[1] R.W. Lee and J.J. Kulesz, “A Risk-Based Sensor Placement Methodology,” technical report, Computational Sciences and Eng. Division, Oak Ridge Nat'l Laboratory, 2006.
[2] K. Dantu, M. Rahimi, H. Shah, S. Babel, A. Dhariwal, and G.S. Sukhatme, “Robomote: Enabling Mobility in Sensor Networks,” Proc. Int'l Conf. Information Processing in Sensor Networks (IPSN), 2005.
[3] X. Du and F. Lin, “Maintaining Differentiated Coverage in Heterogeneous Sensor Networks,” EURASIP J. Wireless Comm. and Networking, vol. 5, no. 4, pp. 565-572, 2005.
[4] J. Jeong, S. Sharafkandi, and D.H.C. Du, “Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks,” Proc. Workshop Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks (DIWANS), 2006.
[5] M. Cardei, “Energy-Efficient Target Coverage in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2005.
[6] R. Iyengar, K. Kar, and S. Banerjee, “Low-Coordination Topologies for Redundancy in Sensor Networks,” Proc. ACM MobiHoc, 2005.
[7] Y.-C. Wang, C.-C. Hu, and Y.-C. Tseng, “Efficient Deployment Algorithms for Ensuring Coverage and Connectivity of Wireless Sensor Networks,” Proc. Int'l Wireless Internet Conf. (WICON '05), 2005.
[8] X. Bai, S. Kuma, D. Xua, Z. Yun, and T.H. La, “Deploying Wireless Sensors to Achieve Both Coverage and Connectivity,” Proc. ACM MobiHoc, 2006.
[9] C. Gui and P. Mohapatra, “Power Conservation and Quality of Surveillance in Target Tracking Sensor Networks,” Proc. ACM MobiCom, 2004.
[10] R.J. Nemzek, J.S. Dreicer, D.C. Torney, and T.T. Warnock, “Distributed Sensor Networks for Detection of Mobile Radioactive Sources,” IEEE Trans. Nuclear Science, vol. 51, no. 4, 2004.
[11] S. Megerian, F. Koushanfar, G. Qu, G. Veltri, and M. Potkonjak, “Exposure in Wireless Sensor Networks: Theory and Practical Solutions,” Wireless Network, vol. 8, no. 5, pp. 443-454, 2002.
[12] G. Wang, G. Cao, and T.L. Porta, “Movement-Assisted Sensor Deployment,” Proc. IEEE INFOCOM, 2004.
[13] Y. Zou and K. Chakrabarty, “Sensor Deployment and Target Localization Based on Virtual Forces,” Proc. IEEE INFOCOM, 2003.
[14] Z. Vincze, D. Vass, R. Vida, A. Vidacs, and A. Telcs, “Adaptive Sink Mobility in Event-Driven Multi-Hop Wireless Sensor Networks,” Proc. Int'l Conf. Integrated Internet Ad Hoc and Sensor Networks (InterSense '06), 2006.
[15] B. Liu, P. Brass, O. Dousse, P. Nain, and D. Towsley, “Mobility Improves Coverage of Sensor Networks,” Proc. ACM MobiHoc, 2005.
[16] J.P. Hespanha, K.H. Jin, and S. Sastry, “Multiple-Agent Probabilistic Pursuit-Evasion Games,” Proc. 38th IEEE Conf. Decision and Control, vol. 3, 1999.
[17] R. Vidal, O. Shakernia, H.J. Kim, D.H. Shim, and S. Sastry, “Probabilistic Pursuit-Evasion Games: Theory, Implementation and Experimental Evaluation,” IEEE Trans. Robotics and Automation, vol. 18, no. 5, pp. 662-669, Oct. 2002.
[18] L. Schenato, S. Oh, and S. Sastry, “Swarm Coordination for Pursuit Evasion Games Using Sensor Networks,” Proc. Int'l Conf. Robotics and Automation, 2005.
[19] N. Bisnik, A. Abouzeid, and V. Isler, “Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric,” Proc. ACM MobiCom, 2006.
[20] R. Sim and N. Roy, “Global A-Optimal Robot Exploration in SLAM,” Proc. IEEE Int'l Conf. Robotics and Automation (ICRA '05), 2005.
[21] A. Singh, A. Krause, C. Guestrin, W. Kaiser, and M. Batalin, “Efficient Planning of Informative Paths for Multiple Robots,” Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI '07), 2007.
[22] C. Stachniss, G. Grisetti, and W. Burgard, “Information Gain-Based Exploration Using Rao-Blackwellized Particle Filters,” Proc. Conf. Robotics: Science and Systems, 2005.
[23] B. Zhang and G.S. Sukhatme, “Adaptive Sampling for Estimating a Scalar Field Using a Robotic Boat and a Sensor Network,” Proc. IEEE Int'l Conf. Robotics and Automation, 2007.
[24] A.R. Cassandra, L.P. Kaelbling, and J.A. Kurien, “Acting under Uncertainty: Discrete Bayesian Models for Mobile-Robot Navigation,” Proc. 1996 IEEE/RSJ Int'l Conf. Intelligent Robots and Systems (IROS '96), 1996.
[25] P. Whaite and F.P. Ferrie, “Autonomous Exploration: Driven by Uncertainty,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 3, pp. 193-205, May 1997.
[26] F. Bourgault, A.A. Makarenko, S.B. Williams, B. Grocholsky, and H.F. Durrant-Whyte, “Information Based Adaptive Robotic Exploration,” Proc. IEEE/RSJ Int'l Conf. Intelligent Robots and Systems, 2002.
[27] A. Doucet, N. de Freitas, K. Murphy, and S. Russell, “Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks,” Proc. 16th Conf. Uncertainty in Artificial Intelligence (UAI '00), 2000.
[28] J.J. Leonard and H.F. Durrant-Whyte, “Simultaneous Map Building and Localization for an Autonomous Mobile Robot,” Proc. IEEE Int'l Workshop Intelligent Robots and Systems, 1991.
[29] G. Hollinger and S. Singh, “Proofs and Experiments in Scalable, Near-Optimal Search by Multiple Robots,” Proc. Conf. Robotics: Science and Systems, 2008.
[30] W.K. Hastings, “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika, vol. 57, pp. 97-109, 1970.
[31] N.A. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, “Equation of State Calculations by Fast Computing Machines,” J. Chemical Physics, vol. 21, pp. 1087-1092, 1953.
[32] J.-C. Chin, Y. Dong, W.-K. Hon, and D.K.Y. Yau, “On Intelligent Mobile Target Detection in a Mobile Sensor Network,” Proc. IEEE Int'l Conf. Mobile Ad Hoc and Sensor Systems (MASS '07), 2007.
[33] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in AdHoc Wireless Networks,” Mobile Computing, vol. 353, 1996.
[34] R. Brent, Algorithms for Minimization without Derivatives. Prentice-Hall, 1973.
[35] “LandscanTM Global Population Database,” Oak Ridge Nat'l Laboratory, http://www.ornl.govlandscan, 2009.
[36] A. Krause, C. Guestrin, A. Gupta, and J. Kleinberg, “Near-Optimal Sensor Placements: Maximizing Information While Minimizing Communication Cost,” Proc. Int'l Conf. Information Processing in Sensor Networks (IPSN), 2006.
46 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool