Skip to main content
SpringerLink
Log in

The Convergecast Scheduling Problem on a Regular Triangular Grid

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1090))

  • 578 Accesses

Abstract

The problem of conflict-free data aggregation in an arbitrary graph is NP-hard. On a square unit grid, in each node of which a sensor is located, the problem is polynomially solvable. For the case when the graph is a regular triangular grid, the upper bound on the length of the schedule of conflict-free data aggregation was previously known. In this paper, the refined estimates are given for the length of the schedule of conflict-free data aggregation on a triangular grid, as well as polynomially solvable cases are found and algorithms for constructing optimal and approximate schedules are proposed.

A. Erzin thanks the Russian Foundation for Basic Research, grant 19–47–540007 and the program of fundamental scientific researches of the SB RAS, project 0314–2019–0014 (contribution: Sects. 1–3), and R. Plonikov thanks the Russian Science Foundation, grant 18–71–00084 (contribution: Sects. 4, 5), for financial support.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Cheng, C.-T., Tse, C.K., Lau, F.C.M.: A delay-aware data collection network structure for wireless sensor networks. IEEE Sens. J. 11(3), 699–710 (2011)

    Article  Google Scholar 

  2. De Souza, E., Nikolaidis, I.: An exploration of aggregation convergecast scheduling. Ad Hoc Netw. 11, 2391–2407 (2013)

    Article  Google Scholar 

  3. Erzin, A.: Solution of the convergecast scheduling problem on a square unit grid when the transmission range is 2. In: Battiti, R., Kvasov, D.E., Sergeyev, Y.D. (eds.) LION 2017. LNCS, vol. 10556, pp. 50–63. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69404-7_4

    Chapter  Google Scholar 

  4. Erzin, A., Plotnikov, R.: Conflict-free data aggregation on a square grid when transmission distance is not less than 3. In: Fernández Anta, A., Jurdzinski, T., Mosteiro, M.A., Zhang, Y. (eds.) ALGOSENSORS 2017. LNCS, vol. 10718, pp. 141–154. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72751-6_11

    Chapter  Google Scholar 

  5. Erzin, A., Plotnikov, R.: Using VNS for the optimal synthesis of the communication tree in wireless sensor networks. Electron. Notes Discrete Math. 47, 21–28 (2015)

    Article  MathSciNet  Google Scholar 

  6. Erzin, A., Plotnikov, R., Mladenovic, N.: Variable neighborhood search variants for min-power symmetric connectivity problem. Comput. Oper. Res. 78, 557–563 (2017)

    Article  MathSciNet  Google Scholar 

  7. Erzin, A., Pyatkin, A.: Convergecast scheduling problem in case of given aggregation tree. the complexity status and some special cases. In: 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP), no. 16. IEEE-Xplore, Prague (2016)

    Google Scholar 

  8. Gagnon, J., Narayanan, L.: Minimum latency aggregation scheduling in wireless sensor networks. In: 11th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, pp. 152–168. Wroclaw, Poland (2014)

    Google Scholar 

  9. Ghods, F., Yousefi, H., Mohammad, A., Hemmatyar, A., Movaghar, A.: MC-MLAS: multi-channel minimum latency aggregation scheduling in wireless sensor networks. Comput. Netw. 57, 3812–3825 (2013)

    Article  Google Scholar 

  10. Hansen, P., Kuplinsky, J., De Werra, D.: Mixed graph colorings. Math. Methods Oper. Res. 45, 145–160 (1997)

    Article  MathSciNet  Google Scholar 

  11. Incel, O.D., Ghosh, A., Krishnamachari, B., Chintalapudi, K.: Fast data collection in tree-based wireless sensor networks. IEEE Trans. Mobi. Comput. 11(1), 86–99 (2012)

    Article  Google Scholar 

  12. Li, H., Hua, Q.-S., Wu, C., Lau, F.C.M.: Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model. HKU CS Tech Report TR-2010-07 (2010). https://doi.org/10.1145/1868521.1868581

  13. Malhotra, B., Nikolaidis, I., Nascimento, M.A.: Aggregation convergecast scheduling in wireless sensor networks. Wireless Netw. 17, 319–335 (2011)

    Article  Google Scholar 

  14. Nguyen, T.D., Zalyubovskiy, V., Choo, H.: Efficient time latency of data aggregation based on neighboring dominators in WSNs. In: IEEE Globecom, pp. 6133827 (2011)

    Google Scholar 

  15. Plotnikov, R., Erzin, A., Mladenovic, N.: Variable neighborhood search-based heuristics for min-power symmetric connectivity problem in wireless networks. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 220–232. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44914-2_18

    Chapter  Google Scholar 

  16. Plotnikov, R., Erzin, A., Zalyubovskiy, V.: Convergecast with unbounded number of channels. In: MATEC Web of Conferences, vol. 125, pp. 03001 (2017). https://doi.org/10.1051/matecconf/201712503001

    Article  Google Scholar 

  17. Wang, P., He, Y., Huang, L.: Near optimal scheduling of data aggregation in wireless sensor networks. Ad Hoc Netw. 11, 1287–1296 (2013)

    Article  Google Scholar 

  18. Xu, X., Li, X.-Y., Mao, X., Tang, S., Wang, S.: A delay-efficient algorithm for data aggregation in multihop wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 22, 163–175 (2011)

    Article  Google Scholar 

  19. Zalyubovskiy, V., Erzin, A., Astrakov, S., Choo, H.: Energy-efficient area coverage by sensors with adjustable ranges. Sensors 9(4), 2446–2460 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, 630090, Russia

    Adil Erzin & Roman Plotnikov

  2. Novosibirsk State University, Novosibirsk, 630090, Russia

    Adil Erzin

Authors
  1. Adil Erzin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Plotnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adil Erzin .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Igor Bykadorov

  2. University of Greenwich, London, UK

    Vitaly Strusevich

  3. University of Aveiro, Aveiro, Portugal

    Tatiana Tchemisova

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Erzin, A., Plotnikov, R. (2019). The Convergecast Scheduling Problem on a Regular Triangular Grid. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2019. Communications in Computer and Information Science, vol 1090. Springer, Cham. https://doi.org/10.1007/978-3-030-33394-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33394-2_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33393-5

  • Online ISBN: 978-3-030-33394-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation