Steiner Zone Yaklaşımı İle Bölünmüş Kablosuz Algılayıcı Ağlarda Hareketli Veri Toplama

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