Lock and Forward Hierarchical Routing Algorithm in MANET

LOCK AND FORWARD HIERARCHICAL ROUTING ALGORITHM IN MANET Routing in Ad-hoc mobile network can be typical process because it is a dynamic environment. Nodes can join and leave a cluster dynamically. Traditional routing algorithm can not be successful due to various reasons. A new -lock and forward hierarchical routing algorithm in MANET- is proposed in this paper in which so many unit clusters come together and form a logical tree structure for forwarding messages among them and also to nearby fixed cell structures. A route discovery process is initiated by a node which wants to send such message to destination. This can be done through multicast or broadcast. If finally by either method a message finds its final destination node, then it starts backward on the same path to source. This message also does a reverse tracing because it follows the same path back and locks each node in its path on its way back. Locking period is 4 times of the total traversal period from source to destination. Then finally message is routed on this locked path. Because we lock all the nodes on the way so we call it lock and forward hierarchical routing. It is hierarchical because all the cluster head make a logical tree structure in their-s buffer by storing some details in routing table. This locked path can be dissolved if a node thinks that this is very much necessary for him to move to a new location. There can also be unguarnteed routing without locking the nodes on its path. This is similar to UDP protocol in TCP/IP environment and can be done by multicast or broadcast. Security enhancements can be done through Authentication and identity check of a node. Each node will provide its MAC address / IP address, digital signature and CH certificate for identification and authentication.