Steiner Zone Yaklaşımı İle Bölünmüş Kablosuz Algılayıcı Ağlarda Hareketli Veri Toplama
- 31 July 2020
- journal article
- Published by International Journal of Informatics Technologies in Bilişim Teknolojileri Dergisi
- Vol. 13 (3), 217-224
- https://doi.org/10.17671/gazibtd.660517
Abstract
Wireless sensor networks (WSNs) typically operate in harsh environmental conditions. Hardware constraints and external damage from inhospitable surroundings leave the nodes susceptible to node failures. Depending on the damage scale, the network can be subject to partitioning which segments the network into multiple isolated connected components. A prompt reactive approach to restore network connectivity is to employ a mobile data collector (MDC) that visits and collects data from partitions periodically. Availability of the wireless data communication through multi-hop routing in a partitioned network complicates designating the shortest possible route for data collection. This paper regards the mentioned data collection problem as the Close-enough Traveling Salesman Problem (CETSP) and employs Steiner zone approach to designate respective data collection points for corresponding partitions. We have assessed the proposed approach in terms of the number of points visited for data collection and the total travel distance of the MDC. Obtained results indicate that the proposed approach can reduce the number of data collection points up to 67% and total travel distance up to 42%.Keywords
Funding Information
- TÜBİTAK (EEEAG-177050)
This publication has 18 references indexed in Scilit:
- An energy-efficient path determination strategy for mobile data collectors in wireless sensor networkComputers and Electrical Engineering, 2015
- An Efficient Mobile Data Collector Based Data Aggregation Scheme for Wireless Sensor NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2015
- Topology management techniques for tolerating node failures in wireless sensor networks: A surveyComputer Networks, 2014
- Overview of Wireless Sensor NetworkPublished by IntechOpen ,2012
- The multiple traveling salesman problem: an overview of formulations and solution proceduresOmega, 2006
- The Close Enough Traveling Salesman Problem: A Discussion of Several HeuristicsPublished by Springer Science and Business Media LLC ,2006
- Approximation algorithms for TSP with neighborhoods in the planeJournal of Algorithms, 2003
- Wireless sensor networks: a surveyComputer Networks, 2002
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962