抽象的な

PERFORMANCE BASED SECURE OPTIMIZED ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORK

Anoop Kumar Jain, Sambhav Jain and Anita Namdev

In mobile ad hoc networks (MANETs), accurate throughput-constrained Quality of Service (QoS) routing and admission control have proven difficult to achieve, mainly due to node mobility and contention for channel access. QoS related with band width utilization is very interesting because band width is the most critical resource in mobile ad hoc networks. The QoS issue must also be studied with a growing node density. This is because the beauty of attaining wider band width link is highly appreciated when the band width resource is scarce due to congestion and high traffic. In this paper, a comparative analysis of two proactive protocols: Destination Sequence Distance Vector (DSDV) and OLSR (Optimized Link State Routing) is conducted in their traditional best effort routing part. Evaluation of their performance is compared against with band width management metrics. Based on the result of the comparative analysis we develop secure QoS versions of the OLSR protocol. Algorithm is introduced that allow OLSR to find the maximum bandwidth path with optimal number of MPR (Multipoint Relay), show through simulation and proof that this algorithm does improve Secure Qos in the aspect of bandwidth. The simulation results show that our secure QoS versions of the OLSR routing protocol more efficient than existing works.