Skip to main content

Solving Efficient Target-Oriented Scheduling in Directional Sensor Networks by DCA

  • Conference paper
  • First Online:
  • 637 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1121))

Abstract

Unlike convectional omnidirectional sensors that consistently have an omniangle of detecting range, directional sensors may have a restricted point of detecting range because of specialized requirements or cost considerations. A directional sensor system comprises of various directional sensors, which can switch to several directions to broaden their detecting capacity to cover every one of the objectives in a given territory. Power preservation is still a significant issue in such directional sensor networks. In this paper, we consider the multiple directional cover sets (MDCS) problem of organizing the directions of sensors into a group of non-disjoint cover sets to extend the network lifetime. It is an NP-complete problem. Firstly, a new model of MDCS is introduced in the form of Mixed Binary Integer Linear Programming (MBILP). Secondly, we investigate a new method based on DC programming and DC algorithm (DCA) for solving MDCS. Numerical results are presented to demonstrate the performance of the algorithm.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Cai, Y., Lou, W., Li, M., Li, X.Y.: Energy Efficient target-oriented scheduling in directional sensor networks. IEEE Trans. Comput. 58(9), 1259–1274 (2009)

    Article  MathSciNet  Google Scholar 

  2. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. ACM Trans. Multimedia Comput. Commun. Appl. 40(8), 102–114 (2002)

    Article  Google Scholar 

  3. Szewczyk, R., Mainwaring, A., Polastre, J., Anderson, J., Culler, D.: An analysis of a large scale habitat monitoring application. In: Proceedings ACM Conference, Embedded Networked Sensor Systems (SenSys) (2004)

    Google Scholar 

  4. Rahimi, M., Baer, R., Iroezi, O.I., Garcia, J.C., Warrior, J., Estrin, D., Srivastava, M.: Cyclops: in situ image sensing and interpretation in wireless sensor networks. In: Proceedings of ACM Conference on Embedded Networked Sensor Systems (SenSys) (2005)

    Google Scholar 

  5. Feng, W., Kaiser, E., Feng, W.C., Baillif, M.L.: Panoptes: scalable low-power video sensor networking technologies. ACM Trans. Multimedia Comput. Commun. Appl. 1(2), 151–167 (2005)

    Article  Google Scholar 

  6. Djugash, J., Singh, S., Kantor, G., Zhang, W.: Range-only slam for robots operating cooperatively with sensor networks. In: Proceedings of IEEE Conference, Robotics and Automation (2006)

    Google Scholar 

  7. Le Thi, H.A., Pham Dinh, T.: A continuous approach for globally solving linearly constrained quadratic zero - one programming problems. Optimization 50, 93–120 (2001)

    Article  MathSciNet  Google Scholar 

  8. Nguyen Quang, T.: Approches locales et globales bases sur la programmation DC et DCA pour des problemes combinatoires en variables mixtes 0-1: applications a la planification operationnelle, These de doctorat dirigee par Le Thi H.A Informatique Metz (2010)

    Google Scholar 

  9. Nguyen, V.V.: Methodes exactes basees sur la programmation DC et nouvelles coupes pour l optimisation en variables mixtes zero-un, These de doctorat dirigee par Pham Dinh T. and Le Thi H.A , LMI, INSA Rouen (2006)

    Google Scholar 

  10. Ta, A.S., Le Thi, H.A., Ha, T.S.: Solving relaxation orienteering problem using DCA-CUT. In: Modelling, Computation and Optimization in Information and Management Sciences, Advances in Intelligent Systems and Computing AISC 359, pp. 191–202 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anh Son Ta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ta, A.S., Le Thi, H.A., Pham Dinh, T. (2020). Solving Efficient Target-Oriented Scheduling in Directional Sensor Networks by DCA. In: Le Thi, H., Le, H., Pham Dinh, T., Nguyen, N. (eds) Advanced Computational Methods for Knowledge Engineering. ICCSAMA 2019. Advances in Intelligent Systems and Computing, vol 1121. Springer, Cham. https://doi.org/10.1007/978-3-030-38364-0_5

Download citation

Publish with us

Policies and ethics