|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Winter 2011 Mobile Sink Routing Problem Saken Khudaibergenov 
ABSTRACT In large-scale monitoring applications, randomly deployed wireless sensor networks may not be fully connected. Using mobile sink for data collection is one of the feasible solutions. For energy saving, it is necessary to plan a shortest route for the mobile sink. Mobile sink routing problem can be regarded as a special case of TSP with neighborhoods (TSPN) problem. In this paper, we implement simulation of an algorithm called RaceTrack. This algorithm forms a "racetrack" based on the TSP route, which is constructed from the locations of the deployed sensor nodes. By using inner lane heuristic and concave bend heuristic of auto racing, and a shortcut finding step, we optimize the obtained TSP route. |
||||||
|
