Abstract
Recently, the sweep coverage has attracted much attention from researchers. There have been some works on the sweep coverage. However, none of them takes into account some constraints of real environment. In this paper, we study the minimum t-Sweep Coverage with Mobile Sensors on Two-way Road (SCMMSTR) problem, which is how to schedule mobile sensors’ movement to satisfy the requirement of t-sweep coverage under the constraints of two-way roads such that the number of used mobile sensors is minimized. We first study the Minimum Directed Cycles Set (MDCS) problem to find a set of directed cycles which contains all vertexes such that the total length of these cycles is minimized. A greedy algorithm- Finding Directed Cycles Set (FDCS) algorithm is proposed for the MDCS problem. Secondly, we study the Scheduling Mobile Sensors (SMS) problem which is to schedule mobile sensors along a given set of circles such that the number of required mobile sensors is minimized. We propose the Scheduling Mobile Sensors (SMS) algorithm for the SMS problem. Based on the FDCS algorithm and the SMS algorithm, we propose the Computing Minimum Directed Cycle algorithm for the SCMMSTR problem. Simulation results demonstrate the performance of our algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Li, M., Cheng, W., Liu, K., He, Y., Liu, Y., Liao, X.: Sweep Coverage with Mobile Sensors. IEEE Transactions on Mobile Computing 11(10), 1534–1545 (2011)
Du, J., Li, Y., Liu, H., Sha, K.: On Sweep Coverage with Minimum Mobile sensors. In: International Conference on Parallel and Distributed Systems (2010)
Xi, M., Wu, K., Zhao, J., Liu, Y., Li, M.: Run to Potential: Sweep Coverage in Wireless Sensor Networks. In: International Conference on Parallel Processing (2009)
Wang, W., Srinivasan, V., Chua, K.C.: Trade-offs between Mobility and Density for Coverage in Wireless Sensor Networks. In: Proceedings of ACM MobiCom (2007)
Balister, P., Bollobas, B., Sarkar, A., Kumar, S.: Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length. In: ACM MobiCom (2007)
Hefeeda, M., Bagheri, M.: Randomized k-Coverage Algorithms for Dense Sensor Networks. In: IEEE INFOCOM (2007)
Liu, H., Chen, W., Ma, H., Li, D.: Energy-Efficient Algorithm for the Target Q-coverage Problem in Wireless Sensor Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol. 6221, pp. 21–25. Springer, Heidelberg (2010)
Liu, H., Wan, P., Yi, C., Jia, X., Makki, S., Niki, P.: Maximal Lifetime Scheduling in Sensor Surveillance Networks. In: IEEE INFOCOM (2005)
Chaudhary, M., Pujari, A.K.: Q-Coverage Problem in Wireless Sensor Networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 325–330. Springer, Heidelberg (2009)
Kumar, S., Lai, T.H., Arora, A.: Barrier Coverage with Wireless Sensors. In: ACM MobiCom (2005)
Chen, A., Kumar, S., Lai, T.H.: Designing Localized Algorithms for Barrier Coverage. IEEE Transactions on Mobile Computing (2010)
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)
Ssu, K.-F., Wang, W.-T., Wu, F.-K., Wu, T.-T.: K-Barrier Coverage with a Directional Sensing Model. International Journal on Smart Sensing and Intelligent Systems (2009)
Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier Coverage of Line-Based Deployed Wireless Sensor Networks. In: IEEE INFOCOM (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, X., Chen, S., Chen, W., Li, D. (2013). Sweep Coverage with Mobile Sensors on Two-Way Road. In: Wang, R., Xiao, F. (eds) Advances in Wireless Sensor Networks. CWSN 2012. Communications in Computer and Information Science, vol 334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36252-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-36252-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36251-4
Online ISBN: 978-3-642-36252-1
eBook Packages: Computer ScienceComputer Science (R0)