%0 Journal Article
%T Efficient Heuristic Based on Clustering Approach for OLSR
%A Ali Choukri
%A Ahmed Habbani
%A Mohamed El Koutbi
%J Journal of Computer Networks and Communications
%D 2013
%I Hindawi Publishing Corporation
%R 10.1155/2013/597461
%X Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present paper comes within the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to be implemented in OLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss. 1. Introduction MANETs are mobile radio networks with no infrastructure, allowing a quick and easy implementation. They may also be coupled to a LAN to extend the coverage of existing infrastructure. Nodes can appear, disappear, and move independently from each other. The network topology is scalable. Terminals can communicate within the limit of its radio power. A diagram of multihop communication is necessary to allow two remote nodes to communicate. In this communication scheme, each terminal can be used as router to relay other terminals communications. The configuration of these multihop roads is carried out by routing protocol. To be effective, these routing protocols must consider the intrinsic characteristics of the network (topology changing), terminals (memory size and computing capacity limited), and the medium of communication (bandwidth limited, interference). Many of the routing protocols for ad-hoc networks are classified as either proactive or reactive routing protocols. Proactive routing protocols try to collect information about the MANET through proactive exchange of messages about their local topology. These protocols reach rapidly their limits when increasing density and mobility of nodes. However, reactive protocols find a route on demand by flooding the network with route request packets and require an important delay to find and to use the route that links up two nodes. Currently there are many routing protocols for each type of network. However, even this efficiency on small and medium size networks, neither of them can be used on large scales because they generate too much control traffic or would require too large routing tables. One solution commonly proposed for routing on large scales is to introduce a hierarchical routing by grouping
%U http://www.hindawi.com/journals/jcnc/2013/597461/