Zgadzam się
Nasza strona zapisuje niewielkie pliki tekstowe, nazywane ciasteczkami (ang. cookies) na Twoim urządzeniu w celu lepszego dostosowania treści oraz dla celów statystycznych. Możesz wyłączyć możliwość ich zapisu, zmieniając ustawienia Twojej przeglądarki. Korzystanie z naszej strony bez zmiany ustawień oznacza zgodę na przechowywanie cookies w Twoim urządzeniu.
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.
