A location-based routing method for mobile ad hoc networks

Abstract

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (Terminode Remote Routing, TRR), used when the destination is far, and link state routing (Terminode Local Routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: Friend Assisted Path Discovery and Geographical Map-based Path Discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks, the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms existing location-based or MANET routing protocols.

Simulation study on the impact of the transmission power on the performance of routing protocols under different Mobility Models

“…Position based algorithms overcome the problem related to the maintenance of the routing table in connection oriented algorithms [2,5,26], where the performance degrades quickly when there is an increase in the number of MNs or the speed. Position based routing algorithms eliminate some of the limitations of topology based routing by using geographical information about the MNs to make decision about routing packets.…”

Energy efficient geographic routing for wireless sensor networks.

“…If the same lengthy route is used repeatedly for all the packets, the energy consumption can be quite high. Some alternatives have been developed to address the issue of lengthy paths of stateless routing [23~26], by either using some global state information about the network topology such as anchors [23] and topology-based routing regions [24], both of which are assumed to be known a priori, or by using waypoints [25] that are fed back to the source by the destination at the expense of added communication overhead. On average, those methods obtain paths that are shorter than that of the stateless geographic routing.…”

“…Another method to cut paths short is to use anchor-based geographic routing [23,25], where anchors or waypoints are set as relay nodes. A packet is routed from the source to the destination through a sequence of anchor nodes.…”

“…A packet is routed from the source to the destination through a sequence of anchor nodes. The anchor list can be set in advance [23], or adaptively obtained and fed back to the source after the first packet is routed [25].…”

“…In [23], two methods are proposed to obtain a path with anchors: one is GMPD (Geographic Map-based Path Discovery) and the other is FAPD (Friend Assisted Path Discovery). In GMPD, it is assumed that all the nodes in the network have the density map of the whole network.…”