Skip to main content
SpringerLink
Log in

Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10556))

Included in the following conference series:

Abstract

In this paper a conflict-free data aggregation problem, known as a Convergecast Scheduling Problem, is considered. It is NP-hard in the arbitrary wireless network. The paper deals with a special case of the problem when the communication graph is a square grid with unit cells and when the transmission range is 2 (in \(L_1\) metric). Earlier for the case under consideration we proposed a polynomial time algorithm with a guaranteed accuracy bound. In this paper we have shown that the proposed algorithm constructs an optimal solution to the problem.

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. Erzin, A., Plotnikov, R.: Using VNS for the optimal synthesis of the communication tree in wireless sensor networks. Electro. Notes Discrete Math. 47, 21–28 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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 

  3. 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). doi:10.1007/978-3-319-44914-2_18

    Chapter  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. 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 

  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, Article 16, 6 p. IEEE-Xplore, Prague (2016)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  10. 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 

  11. 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 Technical report TR-2010-07, Source: DBLP (2010)

    Google Scholar 

  12. 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 

  13. 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 

  14. Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10(4), 692–701 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gagnon, J., Narayanan, L.: Minimum latency aggregation scheduling in wireless sensor networks. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014. LNCS, vol. 8847, pp. 152–168. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46018-4_10

    Google Scholar 

Download references

Acknowledgments

This work was supported by RFBR (grant 16-07-00552) and the Ministry of Education and Science of the Republic of Kazakhstan (project No. 0115PK00550).

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk State University, Novosibirsk, Russia

    Adil Erzin

Authors
  1. Adil Erzin
    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. University of Trento, Trento, Italy

    Roberto Battiti

  2. University of Calabria, Rende, Italy

    Dmitri E. Kvasov

  3. University of Calabria, Rende, Italy

    Yaroslav D. Sergeyev

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Erzin, A. (2017). Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2. In: Battiti, R., Kvasov, D., Sergeyev, Y. (eds) Learning and Intelligent Optimization. LION 2017. Lecture Notes in Computer Science(), vol 10556. Springer, Cham. https://doi.org/10.1007/978-3-319-69404-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69404-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69403-0

  • Online ISBN: 978-3-319-69404-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation