A path recovery routing protocol based on clustering coefficient in ad hoc networks
In ad hoc network, nodes communicate with each other through wireless multi-hop links. When a node wants to send data to another node, it uses some routing algorithm to find the path before data delivery. In on-demand routing protocol, the source asks its neighbors to find the route leading to the destination. Route discovery is typically performed via flooding, which consumes a lot of control packets. Due to node mobility, the network topology change frequently and cause the route broken. In this paper, we propose a local path recovery routing protocol based on clustering coefficient (LPRCC) which can reduce the route discovery times when route failure occur. The clustering coefficient is one of properties in complex network. Simulation results show our protocol can decrease the number of control packets and increase route delivery ratio.
Author's Name: Yao, C., Tsai, Y., Huang, W.
Volume: Volume 8
Issues: Issue 2
Keywords: Ad Hoc networks, Clustering coefficient, Complex network, Local recovery, Routing protocol