Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An Efficient Location-Aided Routing Protocol for Mobile Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
Design and analysis of an MST-based topology control algorithm
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
In this paper, we propose a Target-Aimed Triangular Routing (TATR) protocol that uses global positioning system (GPS). 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, we 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 node 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, simulation 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).