Advertisement

Sweep-Coverage with Energy-Restricted Mobile Wireless Sensor Nodes

  • Meng Yang
  • Donghyun Kim
  • Deying Li
  • Wenping Chen
  • Hongwei Du
  • Alade O. Tokuta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7992)

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.

Keywords

Sensor Node Wireless Sensor Network Mobile Node Heuristic Algorithm Mobile Sensor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wan, P., Yi, C.: Coverage by Randomly Deployed Wireless Sensor Networks. IEEE Transactions on Information Theory 52(6), 2658–2669 (2006)MathSciNetCrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Meng Yang
    • 1
  • Donghyun Kim
    • 2
  • Deying Li
    • 1
  • Wenping Chen
    • 1
  • Hongwei Du
    • 3
    • 4
  • Alade O. Tokuta
    • 2
  1. 1.School of InformationRenmin University of ChinaBeijingChina
  2. 2.Department of Mathematics and Computer ScienceNorth Carolina Central UniversityDurhamUSA
  3. 3.Department of Computer Science and TechnologyHarbin Institute of Technology Shenzhen Graduate SchoolShenzhenChina
  4. 4.Shenzhen Key Laboratory of Internet Information CollaborationShenzhenChina

Personalised recommendations