ANFIS and agent based bandwidth and delay aware anycast routing in mobile ad hoc networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
In hierarchical tree-based routing for service discovery in a MANET, all routes form a tree infrastructure. Therefore, the transmitted packets from a node may go up to the tree root and down to the leaf node. The routing overhead of the tree-based routing algorithm cannot be avoided if the packet forwarding is based on parent-child relationships, even the destination node may be located near the source node. In order to improve such problem, each node should consider its neighbor nodes as next hop nodes in their routing tables. In this work, we present a shortcut any cast tree routing in MANETs. We minimize control overhead by establishing the routing tables only for certain nodes on an any cast tree. Our scheme can reduce the volume of query messages as well as the reply messages. It also reduces the transmission latency. We also improve the information accuracy of the routing tables by periodically transmitting update messages. The simulation results show that the performance of our shortcut any cast tree routing algorithm is fast and efficient for MANETs.