TATR: TARGET-AIMED TRIANGULAR ROUTING ALGORITHM FOR MOBILE AD HOC NETWORK

Abstract

In this thesis, design of a Target-Aimed Triangular Routing (TATR) routing algorithm that uses global positioning system (GPS) is presented. The TATR uses geographical position information to achieve the minimum number of intermediate nodes that form a routing path and to create a progressive routing path that always aims for the target (destination) node. In entire networks, the routing path which is constructed by minimum number of the intermediate nodes can reduce an electric power consumption of nodes that do not participate in routing path. And the routing path that always aims for the target node prevents unnecessary increase of intermediate nodes. In this scheme, TATR first decide a projection-line, which is the line between the sender node and the target node, and then three types of route request (RREQ) packets are exchanged by a sender node and its neighboring nodes. The neighboring with the largest shadow-line value is chosen as the next sender node. The routing path that used a TATR scheme minimized the number of intermediate nodes. Finally, experimental results show that the proposed TATR scheme can reduce the number of intermediate nodes in the routing path below that of Location-Aided Routing (LAR) algorithm.