## 2 Related Work  
A number of different routing protocols have been presented in the literature. Some were used many years ago, and had been implemented in wired networks [11, 14, 17, 24, 25]. Starting with the Routing Information Protocol (RIP) [26] and its modification [27] there is Open Shortest Path First (OSPF) [24, 25, 28] as an open protocol. OSPF is one of the most used Interior Gateway Protocols (IGP) in large enterprise networks. This protocol is an adaptive routing protocol, which means the routing is based on real network parameters. The algorithm proposed in this paper will use some of the OSPF attributes, improving the mechanism of collecting, processing and routing decisions. In large networks the Intermediate System to Intermediate System (IS-IS) is commonly used, as one of link state protocols [29]. The next step after interior gateway protocol implementation is the exterior gateway protocol. Border Gateway Protocol (BGP) is one of the most used protocols for routing information between autonomous systems on the Internet [30]. All these protocols were initially developed for wired networks, but the main logic can be implemented in wireless routing protocols. One of the major problems is stability of the wireless links. This characteristic could produce a problem related to the quality of service as well as the possibility to guarantee services [25, 31]. With regard to the wireless routing protocols, the most important solutions are aimed for _Ad Hoc_ networks [32, 33, 34], addressing table-driven protocols as well as possibility for MANET implementation. Most popular on-demand routing protocols are opposite to table-driven routing protocols. Highly dynamic topology changes, users' connection and traffic density need new protocols especially designed for _Ad Hoc_ networks. _Ad Hoc_ On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) are the most used solutions for these purposes [18, 35]. A lot of authors have offered some improvements for these protocols, trying to optimize networks resources [36, 37]. In some papers, the focus is based on node location information in order to reduce routing overhead [38, 39]. The weakness of each routing protocol is addressed to exciding nodes number, exciding traffic density and network mobility. So, several papers have analyzed the performance of network scalability [40, 41] in order to realize better performances in large networks. The Optimized Link State Routing Protocol (OLSR) [42] is a specifically created protocol based on a well-known link state protocol, and optimized for better network features and resource utilization. Extensions to existing routing protocols, AODV [18], DSR [35] and Simple Opportunistic Adaptive Routing Protocol (SOAR), are presented in [43]. Besides, existing protocols in a hierarchical, two-level MANET, are proposed in [44]. One solution of Hybrid-AODV addressed to packet delivery ratio and delay for large networks is also proposed. Our algorithm is going to optimize packet delivery ratio and in the same time, produce as good as possible load balancing. One fast protocol for small networks is shown in [42]. The reduction of three hops is too small for larger networks and we use it in our work. The implementation for larger network is given in K-hops routing protocol [45]. The authors offer an extension of AODV with at most K hops, but contrary to our solution, they use the flooding mechanism. A protocol for using multiple routes at short time-scales is given in [46, 47]. Some improvements of AODV based on QoS are given in [48]. Hybrid routing protocol addressed at WMNs is given in [49, 50, 51, 52]. This protocol is based on proactive tree formations with periodic network flooding. However, we do not use flooding mechanism in our protocol. Some improvements of network performance by multiple radios and channels are given in [20, 53, 54, 55]. The authors suggest a fully distributed channel assignment algorithm for dynamic traffic adoption.