An Efficient ORR Protocol for Wireless Mesh Networks

Routing protocols of Wireless Mesh Networks (W MNs) are mainly classified into two types proactive and reactive, which flood the packets during route discovery or dissemination and thus have limited scalability. The other routing protocols like geographic and hierarchical protocols handle the scalability at the cost of more state information maintained at each node. Orthogonal Rendezvous Routing Protocol (ORRP) is a lightweight, scalable routing protocol which maintains even distribution of state information and thus avoids from a single point of failure. The problem associated with the ORRP is the deviation of the beam of directional antenna when we cannot find path along the orthogonal directions. In this paper we propose an efficient Orthogonal Rendezvous Routing Protocol to determine when the mandatory deviation is required, and also how to avoid the unnecessary deviation at the intermediate nodes along the orthogonal path. We have carried out extensive simulation experiments. The simulation results indicate that the performance of our proposed Modified ORRP is substantially improved when compared with the basic