Abstract
Most of the existing results in sweep-coverage focused on minimizing the number of the mobile sensor nodes by carefully planning their corresponding trajectories such that each target of interest can be periodically monitored (within every t time unit). However, the starting locations of the mobile sensors, at which the service depots (or equivalently base stations) of the nodes are usually located, are never considered in the trajectory planning. In order to provide sweep-coverage for a long period of time, each node also needs to periodically visit a base station to replace a battery or refueled (within every T time unit). Motivated by this observation, this paper introduces two new sweep-coverage problems, in which each mobile sensor node is required to visit a base station periodically, namely (t,T)-SCOPe-1 and (t,T)-SCOPe-M, each of which considers one single base station and M base stations for all of the nodes, respectively. We prove those problems are NP-hard and propose heuristic algorithms for them. In addition, we conduct simulations to evaluate the average performance of the proposed algorithms and study their average behavior characteristics.
This research was jointly supported by National Natural Science Foundation of China under grants 61070191 and 91124001, and the National Research Foundation for the Doctoral Program of Higher Education of China under grant 20100004110001. This work was also supported in part by US National Science Foundation CREST No. HRD-0833184 and by US Army Research Office No. W911NF-0810510. This work received the support from the National Natural Science Foundation of China under Grants 61100191,and by Shenzhen Strategic Emerging Industries Program under Grant No. ZDSY20120613125016389 and JSE201007140001A, and Natural Scientific Research Innovation Foundation in Harbin Institute of Technology under project HIT.NSFIR.2011128.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wan, P., Yi, C.: Coverage by Randomly Deployed Wireless Sensor Networks. IEEE Transactions on Information Theory 52(6), 2658–2669 (2006)
Bai, X.: Deploying Four-connectivity and Full-coverage Wireless Sensor Networks. In: Proc. of the 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2008), Phoenix, AZ (2008)
Huang, C.F., Tseng, Y.C.: The Coverage Problem in a Wireless Sensor Network. In: Proc. of the 2nd International Workshop on Wireless Sensor Networks and Applications (WSNA 2003), San Diego, CA (2003)
Kumar, S., Lai, T.H., Arora, A.: Barrier Coverage with Wireless Sensors. In: Proc. of the 11th Annual International Conference on Mobile Computing and Networking (MobiCom 2005), Cologne, Germany (2005)
Kim, D., Kim, J., Li, D., Kwon, S.-S., Tokuta, A.O.: On Sleep-wakeup Scheduling of Non-penetrable Barrier-coverage of Wireless Sensors. In: Proceedings of the IEEE Global Communications Conference (GLOBECOM 2012) (December 2012)
Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong Barrier Coverage of Wireless Sensor Networks. In: Proc. of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2008), Hong Kong, China (2008)
Yang, G., Qiao, D.: Barrier Information Coverage with Wireless Sensors. In: Proc. of the 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2009), Rio de Janeiro, Brazil (2009)
Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier Coverage of Line-based Deployed Wireless Sensor Networks. In: Proc. of the 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2009), Rio de Janeiro, Brazil (2009)
Yang, G., Qiao, D.: Multi-round Sensor Deployment for Guaranteed Barrier Coverage. In: Proc. of the 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2010), San Diego, CA (2010)
Chen, A., Li, Z., Lai, T., Liu, C.: One-way Barrier Coverage with Wireless Sensors. In: Proc. of the 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2011), Shanghai, China (2011)
Cheng, W., Li, M., Liu, K., Liu, Y., Li, X.Y., Liao, X.: Sweep Coverage with Mobile Sensors. In: Proc. of IEEE International Parallel & Distributed Processing Symposium (IPDPS 2008), Miami, FL (2008)
Du, J., Li, Y., Liu, H., Sha, K.: On Sweep Coverage with Minimum Mobile Sensors. In: Proc. of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems (ICPADS 2010), Shanghai, China, pp. 283–290 (2010)
Zhao, D., Ma, H., Liu, L.: Mobile Sensor Scheduling for Timely Sweep Coverage. In: 2012 IEEE Wireless Communications and Networking Conference (WCNC 2012), Paris, France (2012)
Cheng, T.M., Savkin, A.V., Javed, F.: Decentralized Control of a Group of Mobile Robots for Deployment in Sweep Coverage. Robotics and Autonomous Systems 59(7-8), 497–507 (2011)
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
Yang, M., Kim, D., Li, D., Chen, W., Du, H., Tokuta, A.O. (2013). Sweep-Coverage with Energy-Restricted Mobile Wireless Sensor Nodes. In: Ren, K., Liu, X., Liang, W., Xu, M., Jia, X., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2013. Lecture Notes in Computer Science, vol 7992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39701-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-39701-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39700-4
Online ISBN: 978-3-642-39701-1
eBook Packages: Computer ScienceComputer Science (R0)