Abstract
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible number of sensors to be deployed, their positions and operation chatacteristics needed to perform the tracking task. To avoid an expensive massive deployment, we try to take advantage of possible coverage ovelaps over space and time, by introducing a novel combinatorial model that captures such overlaps.
Under this model, we abstract the tracking network design problem by a combinatorial problem of covering a universe of elements by at least three sets (to ensure that each point in the network area is covered at any time by at least three sensors, and thus being localized). We then design and analyze an efficient approximate method for sensor placement and operation, that with high probability and in polynomial expected time achieves a Θ(logn ) approximation ratio to the optimal solution. Our network design solution can be combined with alternative collaborative processing methods, to suitably fit different tracking scenaria.
This work was partially supported by the IST/FET/Global Computing Programme of the European Union, under contact number IST-2005-15964 (AEOLUS).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Moshkovitz, D., Safra, M.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms (TALG) 2(2), 153–177 (2006)
Aspnes, J., Goldberg, D., Yang, Y.: On the computational complexity of sensor network localization. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol. 3121, pp. 32–44. Springer, Heidelberg (2004)
Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. Comput. 51(12) (2002)
Dhilon, S.S., Chakrabarty, K., Iyengar, S.S.: Sensor placement for grid coverage under imprecise detections. In: FUSION 2002. Proc. 5th Int. Conf. Information Fusion, Annapolis, MD, pp. 1–10 (July 2002)
Duh, R.-c., Fuerer, M.: Approximation of k -Set Cover by Semi-Local Optimization. In: ACM STOC (1997)
Feige, U.: A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM) 45(4), 634–652 (1998)
Gui, C., Mohapatra, P.: Power conservation and quality of surveillance in target tracking sensor networks. In: Proc. ACM MobiCom Conference (2004)
Gupta, R., Das, S.R.: Tracking moving targets in a smart sensor network. In: Proc. VTC Symp. (2003)
Halldorsson, M.M.: Approximating Discrete Collections via Local Improvements. In: ACM SODA (1995)
Halldorsson, M.M.: Approximating k-Set Cover and Complementary Graph Coloring. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 1084, Springer, Heidelberg (1996)
Jain, S., Demmer, M., Patra, R., Fall, K.: Using Redundancy to Cope with Failures in a Delay Tolerant Network. In: Proc. SIGCOMM 2005 (2005)
Liu, J., Liu, J., Reich, J., Cheung, P., Zhao, F.: Distributed group management for track initiation and maintenance in target localization applications. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, Springer, Heidelberg (2003)
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM (JACM) 41(5), 960–981 (1994)
Poduri, S., Sukhatme, G.S.: Constrained coverage in mobile sensor networks. In: ICRA 2004. Proc. IEEE Int. Conf. Robotics and Automation, New Orleans, LA, April-May 2004, pp. 40–50 (2004)
Rao, N.S.V.: Computational complexity issues in operative diagnosis of graph based systems. IEEE Trans. Comput. 42(4) (April 1993)
Shorey, R., Ananda, A., Chan, M.C., Ooi, W.T.: Mobile, Wireless, and Sensor Networks: Technology, Applications, and Future Directions. Wiley, Chichester (2006)
Zhang, W., Cao, G.: Optimizing tree reconfiguration for mobile target tracking in sensor networks. In: Proc. IEEE InfoCom (2004)
Zhao, F., Guibas, L.: Wireless Sensor Networks: An Information Processing Approach. Morgan Kaufmann, San Francisco (2004)
Zou, Y., Chakrabarty, K.: Sensor deployment and target localization based on virtual forces. In: Proc. IEEE InfoCom, San Francisco, CA, pp. 1293–1303 (April 2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikoletseas, S., Spirakis, P.G. (2008). Efficient Sensor Network Design for Continuous Monitoring of Moving Objects. In: Kutyłowski, M., Cichoń, J., Kubiak, P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2007. Lecture Notes in Computer Science, vol 4837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77871-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-77871-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77870-7
Online ISBN: 978-3-540-77871-4
eBook Packages: Computer ScienceComputer Science (R0)