Description: Location based 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 page 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. 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. Terminode routing uses a combination of location-based routing (Terminode Remote Routing, TRR), used when the destination is far, and page link state routing (Terminode Local Routing, TLR), used when the destination is close. TLR uses location independent addresses only. TRR uses a combination of direct paths, perimeter mode, and anchors, as described in the rest of this section. The combination of TLR and TRR is able to keep the scalability benefits of location-based routing, while avoiding problems due to mobility. However, combining TLR and TRR in one protocol poses a number of design challenges (in particular, avoiding loops). Anchored paths are discovered and managed by sources, using one of two low overhead protocols in Terminode Remote Routing(TRR) and Terminode Local Routing(TLR). The algorithms used are Friend Assisted Path Discovery(FAPD) Geographical Map-Based Path Discovery(GMPD) The algorithm Friend Assisted Path Discovery is used to find the destination by using neighboring nodes in each cell. In this case, a large number of nodes are covered and Anchor points are formed which may result in loss of data. These Anchor points are formed due to traffic in nodes. There is waste of time for users when a long distance is travelled and finally the destination is not reached. The algorithm Geographical Map-Based Path Discovery is used to find the destination by covering the nodes based on geographical location. The main use of this algorithm is to reduce the Anchor points formed so that the loss of data can be avoided or minimized. The destination can be reached promptly.