Data Gathering by Mobile Sinks in Wireless Sensor Networks
碩士 === 淡江大學 === 資訊工程學系資訊網路與通訊碩士班 === 103 === Mobile sinks are extensively used for data gathering in Wireless Sensor Networks (WSNs). In this study, we focus on how to shorten the length of traveling path. We propose that the mobile sink visits the overlapping areas of communication regions of senso...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/re4ua3 |
| Summary: | 碩士 === 淡江大學 === 資訊工程學系資訊網路與通訊碩士班 === 103 === Mobile sinks are extensively used for data gathering in Wireless Sensor Networks (WSNs). In this study, we focus on how to shorten the length of traveling path. We propose that the mobile sink visits the overlapping areas of communication regions of sensors instead of sensors one by one. We use the Traveling Salesperson Problem (TSP) algorithm to plan an optimal traveling path to reduce the delay time of data gathering. The benefit of the proposed method is that the number of visiting points is reduced after integration of the visiting points. Our experimental results show that the proposed algorithm delivers good results in terms of time complexity, space complexity, and length of traveling path.
|
|---|