Abstract
Wireless sensors can be deployed in boundary regions to replace human in intruder detection. Given a deployment of such a wireless sensor network, we present a method to compute a path crossing the minimum number of distinct sensors from a source to a destination.Then, we propose the selfish path problem, in which the intruder is always getting more closer to the destination, and we design a greedy algorithm for this problem. We implement these algorithms and compare the number of sensors crossed by a random path, a line segment path, a selfish path, and two paths generated by Dijkstra’s algorithm and an adapted Bellman-Ford algorithm. Some important empirical results are obtained.
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 subscriptionsReferences
Arora, A., Ramnath, R., Ertin, E. et al.: ExScal: Elements of an extreme scale wireless sensor network. In: Proceedings of the 11th IEEE International Conference on Real-Time Computing Systems and Applications, HongKong (2005)
Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)
de Berg, M., Choeng, O., van Kreveld, M.: Computational Geometry: Algorithm and Application, 3rd edn. Springer, Heidelberg (2008)
Chan, D.Y.C., Kirkpatrick, D.: Approximating barrier resilience for arrangements of non-identical disk sensors. In: Bar-Noy, A., Halldórsson, M.M. (eds.) ALGOSENSORS 2012. LNCS, vol. 7718, pp. 42–53. Springer, Heidelberg (2013)
Chen, A., Kumar, S., Lai, T.-H.: Local barrier coverage in wireless sensor networks. Ieee trans. mobile comput. 9(4), 491–504 (2010)
Chen, A., Li, Z., Lai, T.-H., Liu, C.: One-way barrier coverage with wireless sensors. In: Proceedings of IEEE INFOCOM 2011, pp. 626–630 (2011)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Huang, C.-F., Tseng, Y.-C.: The coverage problem in a wireless sensor network. In: Proceedings of WSNA 2003, pp. 115–121 (2003)
Kumar, S., Lai, T.H., Balogh, J.: On k-coverage in a mostly sleeping sensor network. In: Proceedings of MobiCom 2004, pp. 144–158 (2004)
Kumar, S., Lai, T.-H., Arora, A.: Barrier coverage with wireless sensors. J. Wireless Netw. 13, 817–834 (2007)
Kumar, S., Lai, T.-H., Posner, M.E., Sinha, P.: Optimal sleep-wakeup algorithms for barriers of wireless sensors. In: Proceedings of BROADNETS 2007, pp. 327–336 (2007)
Kumar, S., Lai, T.-H., Balogh, J.: On k-coverage in a mostly sleeping sensor network. J. Wireless Netw. 14(3), 277–294 (2008)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of IEEE INFOCOM 2001, vol. 3, pp. 1380–1387 (2001)
Ssu, K.-F., Wang, W.-T., Feng-Kuang, W., Tzu-Ting, W.: K-barrier coverage with a directional sensing model. Int. J.Smart Sens. and Intell. Syst. 2(1), 79–93 (2009)
Tang, J., Zhu, B., Zhang, L., Hincapie, R.: Wakeup scheduling in roadside directional sensor networks. In: Proceedings of IEEE GLOBECOM 2011, pp. 1–6 (2011)
Yang, H., Li, D., Zhu, Q., Chen, W., Hong, Y.: Minimum energy cost k-barrier coverage in wireless sensor networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol. 6221, pp. 80–89. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fan, C., Yang, Q., Zhu, B. (2015). Computing an Optimal Path with the Minimum Number of Distinct Sensors. In: Xu, K., Zhu, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2015. Lecture Notes in Computer Science(), vol 9204. Springer, Cham. https://doi.org/10.1007/978-3-319-21837-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-21837-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21836-6
Online ISBN: 978-3-319-21837-3
eBook Packages: Computer ScienceComputer Science (R0)