Towards an Efficient QoS Based Selection of Neighbors in QOLSR

OLSR is a well-known proactive protocol for wireless networks. Although very efficient by many points, it suffers from the drawbacks of not taking into account QoS metrics such as delay or bandwidth. To overcome this pitfall, some QOLSR (QoS OLSR) solutions have been designed. Nevertheless, they still provide weak performance regarding QoS metrics. In this paper, we introduce a novel and simple neighbor selection to allow routing with OLSR along quasi-optimal QoSpaths. Simulation results show that our solution outperforms solutions from the literature by providing efficient QoS paths (less than $2\%$overhead from optimal paths) by selecting a very small set of neighbors to route packets.