@ARTICLE{Thomas_Sanu_Minimum_2019,
author={Thomas, Sanu and Mathew, Thomaskutty},
volume={vol. 65},
number={No 2},
pages={267-276},
howpublished={online},
year={2019},
publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
abstract={In a rectilinear route, a moving sink is restricted to travel either horizontally or vertically along the connecting edges. We present a new algorithm that finds the shortest round trip rectilinear route covering the specified nodes in a grid based Wireless Sensor Network. The proposed algorithm determines the shortest round trip travelling salesman path in a two-dimensional grid graph. A special additional feature of the new path discovery technique is that it selects that path which has the least number of corners (bends) when more than one equal length shortest round trip paths are available. This feature makes the path more suitable for moving objects like Robots, drones and other types of vehicles which carry the moving sink. In the prosed scheme, the grid points are the vertices of the graph and the lines joining the grid points are the edges of the graph. The optimal edge set that forms the target path is determined using the binary integer programming.},
type={ArtykuĹ‚y / Articles},
title={Minimum Bend Shortest Rectilinear Route Discovery for a Moving Sink in a Grid Based Wireless Sensor Network},
URL={http://www.czasopisma.pan.pl/Content/110223/PDF/36_1651_new.pdf},
doi={10.24425/ijet.2019.126310},
keywords={Minimum bend Shortest Paths, Travelling salesman problem, Binary integer programming, Edge orientation index, Vertex Bend Index, Vertex-Edge Incident Matrix},
}