Solution of travelling salesman problem applied to Wireless Sensor Networks (WSN) through the MST and B&B methods
Fragment książki (Materiały konferencyjne)
MNiSW
15
WOS
| Status: | |
| Autorzy: | Tito Jonathan E. , Yacelga Marco E. , Paredes Martha C. , Utreras Andres J., Wójcik Waldemar, Ussatova Olga |
| Dyscypliny: | |
| Aby zobaczyć szczegóły należy się zalogować. | |
| Wersja dokumentu: | Drukowana | Elektroniczna |
| Arkusze wydawnicze: | 1 |
| Język: | angielski |
| Strony: | 736 - 747 |
| Web of Science® Times Cited: | 2 |
| Scopus® Cytowania: | 3 |
| Bazy: | Web of Science | Scopus |
| Efekt badań statutowych | NIE |
| Materiał konferencyjny: | TAK |
| Nazwa konferencji: | The Summer XLII-nd IEEE-SPIE Joint Symposium on Photonics, Web Engineering, Electronics for Astronomy and HIgh Energy Physic Experiments |
| Skrócona nazwa konferencji: | XLII SPIE-IEEE-PSP 2018 |
| URL serii konferencji: | LINK |
| Termin konferencji: | 3 czerwca 2018 do 10 czerwca 2018 |
| Miasto konferencji: | Wilga |
| Państwo konferencji: | POLSKA |
| Publikacja OA: | NIE |
| Abstrakty: | angielski |
| 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. |
