A New Efficient and Energy-aware Clustering Algorithm for the OLSR Protocol

Integrating quality of service (QoS) in a mobile ad hoc network (MANET) is a difficult challenge and a very tedious task. It requires to find a compromise between several QoS parameters. The energy criterion is one of the most important of these parameters that will provide a long lifetime for a given MANET. This paper proposes a new clustering algorithm for the OLSR routing protocol which consumes less energy and enhances transmission delay. This algorithm manages nodes density and mobility; and gives major improvements regarding the number of elected clusters Head. We have conducted some comparison with other clustering algorithms to prove the efficiency of our algorithm. Our main objective is to elect a reasonable number of clusters Head that will serve for hierarchical routing using OLSR as a routing protocol. The second objective is to increase the network lifetime by considering the Ad hoc residual energy when taking routing decisions. We have found that our algorithm optimize the end to end delay by adopting a selective forwarding approach based on the hierarchical routing model