Optimization of mobile drain route in a wireless sensor network

Authors

  • Liubov Melnikova Kharkiv National University of Radio Electronics,
  • Yelena Linnyk Kharkiv National University of Radio Electronics,
  • Mykola Kryvoshapka Kharkiv National University of Radio Electronics,
  • Valerii Barsuk Kharkiv National University of Radio Electronics,

DOI:

https://doi.org/10.30837/pt.2019.1.07

Keywords:

Wireless sensor net, Validity time, Mobile drain, Travelling salesman problem

Abstract

The article describes the introduction of a mobile drain as one of the promising methods of energy balancing in wireless sensor networks. In order to reduce the data transfer delay time during the polling of routers, the article states and solves the problem of optimizing the mobile drain route, presented in the form of the traveling salesman problem. To assess the efficiency and effectiveness of the method for solving the problem, an experimental study was conducted using the Matlab package. The traveling salesman problem was solved for uniform and normal distribution of distances between network routers. The values of the sample average length of the optimal mobile drain route and the length of the route without optimization on a sample of 500 experiments were obtained. The reliability of the simulation results is confirmed by recursive estimates of the length of the route. It is shown that the use of optimization when choosing a mobile drain route in wireless sensor networks makes it possible, on average, to reduce the length of a bypass path of a mobile drain by 30-40% compared with a random bypass depending on the law of the distribution of distances between nodes. Minimizing the length of the mobile drain route reduces the polling time of routers in the sensor network and ensures a decrease in the delay of data transmission in the network with an increase in the network lifetime.

References

Ефименко М. С., Клымив С. И., Саткенов Р. Б. Беспроводные сенсорные сети. Молодой ученый. 2018. №51. С. 40-42. URL: https://moluch.ru/archive/237/55115.

Wenguo Y., Tiande G. The non-uniform property of energy consumption and its solution to the wireless sensor network. Education Technology and Computer Science 2010: Proceedings of the Second International Workshop. Wuhan, China, March 6-7, 2010. IEEE, 2010. Р. 186-192.

Vullers R.J.M., Van Schaijk R., Doms I., Van Hoof C., Mertens R. Micropower energy harvesting. Solid-State Electronics. 2009. Vol. 53, No. 7. P. 684-693. DOI: https://doi.org/10.1016/j.sse.2008.12.011.

Zhang H., Shen H. Balancing Energy Consumption to Maximize Network Lifetime in Data-Gathering Sensor Networks. IEEE Trans. Parallel Distrib. Syst. 2009. Vol. 20, № 10. P. 1526–1539. DOI: https://doi.org/10.1109/TPDS.2008.252.

Галкин П. В. Анализ энергопотребления узлов беспроводных сенсорных сетей. ScienceRise. 2014. № 2 (2). С. 55-61. URL: http://nbuv.gov.ua/UJRN/texc_2014_2_11.

Комаров М. М. Разработка и исследование метода энергетической балансировки беспроводной стационарной сенсорной сети с автономными источниками питания. Диссертация на соискание ученой степени кандидата технических наук. М.: 2012. 136 с.

Алексеева Е. В. Построение математических моделей целочисленного линейного программирования. Примеры и задачи: Учеб. пособие. Новосиб. гос. ун-т., Новосибирск, 2012. 131 с.

Applegate D.L., Bixby R.E., Chvatal V., Cook W.J. The traveling salesman problem: a computational study. Princeton University Press. 2007. 608 p.

Основи теорії телекомунікаційних систем: підручник. Під ред. Поповського В.В. Харків: ХНУРЕ. 2018. 368 с.

Ефремов С. Г. Разработка системы активного беспроводного сбора данных в интралогистике. М.: 2011. 270с.

Решения компании MEMSIC для беспроводных сенсорных сетей. URL: http://www.memsic.com/wireless-sensor-networks.

Проблеми телекомунікацій № 1(24) (2019)

Downloads

Published

2019-11-27

Issue

No. 1(24) (2019)

Section

Articles

License

Copyright (c) 2019 Liubov Melnikova, Yelena Linnyk, Mykola Kryvoshapka, Valerii Barsuk

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Authors who publish with this journal agree to the following terms:
  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).