IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v16y2020i5p1550147720907052.html
   My bibliography  Save this article

Heuristic mobile data gathering for wireless sensor networks via trajectory control

Author

Listed:
  • Jianxin Ma
  • Shuo Shi
  • Xuemai Gu
  • Fanggang Wang

Abstract

This article focuses on the problem of scheduling the optimal paths of multiple mobile elements (e.g. robots, vehicles, etc.) to minimize the travel distance and balance the energy consumption and the data gathering latency in wireless sensor networks for smart cities. To partition the network for the multiple mobile elements and compute the trajectories of the multiple mobile elements, we utilize the sensor’s communication range and construct a multiple mobile elements scheduling problem. A heuristic mobile data gathering approach is proposed to solve this problem, which includes the following three steps. The sensor nodes are preliminarily partitioned into four levels, and then the clusterheads are further partitioned, and the traveling tour is scheduled for each cluster. After the first two steps, all the sensor nodes are partitioned reasonably for the multiple mobile elements. In the last step, the traveling tour is scheduled for each cluster, and the meeting point of each clusterhead is determined. We compare the proposed heuristic mobile data gathering with the existing approaches. The results indicate that the travel distance and the data gathering latency are reduced significantly, which further validates that the communication range is beneficial to minimize the travel distance.

Suggested Citation

  • Jianxin Ma & Shuo Shi & Xuemai Gu & Fanggang Wang, 2020. "Heuristic mobile data gathering for wireless sensor networks via trajectory control," International Journal of Distributed Sensor Networks, , vol. 16(5), pages 15501477209, May.
    • Handle: RePEc:sae:intdis:v:16:y:2020:i:5:p:1550147720907052
    DOI: 10.1177/1550147720907052
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147720907052
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147720907052?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    2. Kai Zhou & Mustafa R. Kılınç & Xi Chen & Nikolaos V. Sahinidis, 2018. "An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver," Journal of Global Optimization, Springer, vol. 70(3), pages 497-516, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wex, Felix & Schryen, Guido & Feuerriegel, Stefan & Neumann, Dirk, 2014. "Emergency response in natural disaster management: Allocation and scheduling of rescue units," European Journal of Operational Research, Elsevier, vol. 235(3), pages 697-708.
    2. CASTRO, Marco & SÖRENSEN, Kenneth & VANSTEENWEGEN, Pieter & GOOS, Peter, 2012. "A simple GRASP+VND for the travelling salesperson problem with hotel selection," Working Papers 2012024, University of Antwerp, Faculty of Business and Economics.
    3. Andrzej Grzybowski, 2009. "A Note On A Single Vehicle And One Destination Routing Problem And Its Game-Theoretic Models," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 3(1), pages 71-76, December.
    4. Du, Mingyang & Cheng, Lin & Li, Xuefeng & Tang, Fang, 2020. "Static rebalancing optimization with considering the collection of malfunctioning bikes in free-floating bike sharing system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    5. Nourinejad, Mehdi & Zhu, Sirui & Bahrami, Sina & Roorda, Matthew J., 2015. "Vehicle relocation and staff rebalancing in one-way carsharing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 98-113.
    6. F. Angel-Bello & Y. Cardona-Valdés & A. Álvarez, 2019. "Mixed integer formulations for the multiple minimum latency problem," Operational Research, Springer, vol. 19(2), pages 369-398, June.
    7. Peter Reiter & Walter Gutjahr, 2012. "Exact hybrid algorithms for solving a bi-objective vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 19-43, March.
    8. Bakker, Steffen J. & Wang, Akang & Gounaris, Chrysanthos E., 2021. "Vehicle routing with endogenous learning: Application to offshore plug and abandonment campaign planning," European Journal of Operational Research, Elsevier, vol. 289(1), pages 93-106.
    9. N. A. Arellano-Arriaga & J. Molina & S. E. Schaeffer & A. M. Álvarez-Socarrás & I. A. Martínez-Salazar, 2019. "A bi-objective study of the minimum latency problem," Journal of Heuristics, Springer, vol. 25(3), pages 431-454, June.
    10. Day, Jamison M. & Daniel Wright, P. & Schoenherr, Tobias & Venkataramanan, Munirpallam & Gaudette, Kevin, 2009. "Improving routing and scheduling decisions at a distributor of industrial gasses," Omega, Elsevier, vol. 37(1), pages 227-237, February.
    11. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    12. Malladi, Krishna Teja & Quirion-Blais, Olivier & Sowlati, Taraneh, 2018. "Development of a decision support tool for optimizing the short-term logistics of forest-based biomass," Applied Energy, Elsevier, vol. 216(C), pages 662-677.
    13. Luigi Di Puglia Pugliese & Francesca Guerriero, 2016. "On the shortest path problem with negative cost cycles," Computational Optimization and Applications, Springer, vol. 63(2), pages 559-583, March.
    14. Wang, Congke & Liu, Yankui & Yang, Guoqing, 2023. "Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    15. Enrique Benavent & Antonio Martínez, 2013. "Multi-depot Multiple TSP: a polyhedral study and computational results," Annals of Operations Research, Springer, vol. 207(1), pages 7-25, August.
    16. Jayanth Krishna Mogali & Joris Kinable & Stephen F. Smith & Zachary B. Rubinstein, 2021. "Scheduling for multi-robot routing with blocking and enabling constraints," Journal of Scheduling, Springer, vol. 24(3), pages 291-318, June.
    17. Lo, Shirleen Lee Yuen & How, Bing Shen & Leong, Wei Dong & Teng, Sin Yong & Rhamdhani, Muhammad Akbar & Sunarso, Jaka, 2021. "Techno-economic analysis for biomass supply chain: A state-of-the-art review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 135(C).
    18. Takeshima, Hiroyuki, 2015. "Market imperfections for tractor service provision in Nigeria: International perspectives and empirical evidence:," IFPRI discussion papers 1424, International Food Policy Research Institute (IFPRI).
    19. Stefan Fedtke & Nils Boysen, 2017. "Gantry crane and shuttle car scheduling in modern rail–rail transshipment yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 473-503, March.
    20. John Bowers & Helen Cheyne & Gillian Mould & Miranda Page, 2015. "Continuity of care in community midwifery," Health Care Management Science, Springer, vol. 18(2), pages 195-204, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:16:y:2020:i:5:p:1550147720907052. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.