Article Title

AN EFFICIENT MULTI-CONSTRAINED FEASIBLE PATH SELECTION FOR MANET

Authors

S. BASKARAN, II Year M.E, Computer Science & Engineering, Jayam College of Engineering & Technology, Tamilnadu, IndiaFollow
K. TAMIZHARASU, Professor, Dept. of Computer Science & Engg., Jayam College of Engineering & Technology, Tamilnadu, IndiaFollow

Abstract

Quality-of-service (QoS) routing in an Ad-Hoc network is difficult because the network topology may change constantly and the available state information for routing is inherently imprecise. This paper proposes a method for multiconstrained feasible path selection for MANET. We introduce the composite function which allows OLSR to find the feasible path in case of multiple routes are available to reach the same destination. Combinations of additive and non additive QoS metrics are considered to find the best path. Our simulation results show that the QoS version of the OLSR do improve the Packet Delivery Ratio, Throughput, Normalized control overhead, End-to-End delay and Packet loss but with the increased time complexity.

Recommended Citation

BASKARAN, S. and TAMIZHARASU, K. (2016) "AN EFFICIENT MULTI-CONSTRAINED FEASIBLE PATH SELECTION FOR MANET," International Journal of Computer and Communication Technology: Vol. 7: Iss. 4, Article 11.
DOI: 10.47893/IJCCT.2016.1383
Available at: https://www.interscience.in/ijcct/vol7/iss4/11

DOI

10.47893/IJCCT.2016.1383