Solution of travelling salesman problem applied to Wireless Sensor Networks (WSN) through the MST and B&B methods

Waldemar Wójcik, Jonathan E. Tito, MARCO ESTEBAN YACELGA PINTO, Martha Cecilia Paredes Paredes, Andres J. Utreras, Olga Ussatova

2018

Closed access Metadata (CSL-JSON)

DOI 10.1117/12.2501579

Data confidence 70 medium

How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

During this investigation, Traveling Salesman Problem or TSP is applied in a Wireless Sensor Network (WSN), through a free simulator named Castalia and programming codes on JAVA and GNU/Linux Scripting in order to implement two methods for solving the TSP. First method, consist of Minimum Spanning Tree (MST) with the 2-opt algorithm and the second one is Branch and Bound (B&B) method related to the Held-Karp lower bound. Likewise, the Prim, Boruvka and Kruskal algorithms will be compared in order to determine, which of them solves the MST problem in less time, through the simulator which defines two scenarios for three models of motas: TelosB, Imote2, and Zolertia. Finally, some parameters will be also compared, such as throughput and energy consumption for each scenario, node model and solving method of the TSP, and conclude what is the best method that could be applied to a WSN.