TY - JOUR
N2 - 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.
L1 - http://www.czasopisma.pan.pl/Content/110223/PDF/36_1651_new.pdf
L2 - http://www.czasopisma.pan.pl/Content/110223
PY - 2019
IS - No 2
EP - 267-276
KW - Minimum bend Shortest Paths
KW - Travelling salesman problem
KW - Binary integer programming
KW - Edge orientation index
KW - Vertex Bend Index
KW - Vertex-Edge Incident Matrix
A1 - Thomas, Sanu
A1 - Mathew, Thomaskutty
PB - Polish Academy of Sciences Committee of Electronics and Telecommunications
VL - vol. 65
SP - 267-276
T1 - Minimum Bend Shortest Rectilinear Route Discovery for a Moving Sink in a Grid Based Wireless Sensor Network
DA - 2019.06.13
UR - http://www.czasopisma.pan.pl/dlibra/publication/edition/110223
DOI - 10.24425/ijet.2019.126310
ER -