Efficient routing protocols for mobile ad hoc network
R. Thiagarajan, M. Moorthi · 2017
An adhoc network is collection of wireless mobile hosts, which form a temporary network by using reconfigurable structure that means it doesn't use fixed infrastructure to form a temporary network. It will connect all nodes through wireless technique. Hence it can change the link between one node to another node during run time, when the link failure problem occurs. There is a limited range for each mobile host's to transmit the packet from source to destination by using wireless transmissions. An efficient routing protocol is presented in this paper to perform the routing in adhoc networks which can use dynamic source routing scheme to transfer the data from source node to the receiver node. Current routing protocol structure is changed, when the host movement is numerous. It needs a small or without overhead during this periods in which the host effort is very less. In the existing technique, temporally ordered routing algorithm (TORA) is the one of the reactive routing protocol and dynamic source routing (DSR) is also type of reactive routing technique are used to design a temporary network by using wireless structure. DSR require more delay and scaling problem arise in DSR technique. Similarly, the TORA form temporary routing loop problem. To avoid this type of problems, the new optimized link state routing (OLSR) is proposed in this paper. It is the best proactive routing protocol for adhoc networks. It follows periodic route metric technique. Multi point relay are used to reduce the control overhead for route maintenance. Also contention problem are reduced in this technique. Comparison between conventional and proposed scheme are carried out to analyze the throughput, energy consumption and overhead.