Mini Overview of Key Issues in Routing for OSPF MANETs
Volume 1 - Issue 2
Alamgir Naushad*, Muhammad Tanveer and Abd Ullah Khan
-
Author Information
Open or Close
- Faculty of Computer Sciences and Engineering, GIK Institute of Engineering Sciences and Technology, Pakistan
*Corresponding author:
Alamgir Naushad, Faculty of Computer Sciences and Engineering, GIK Institute of Engineering Sciences and
Technology, Topi 23640, Pakistan
Received: January 28, 2019; Published: February 04, 2019
DOI:
10.32474/CTCSA.2018.01.000109
Full Text
PDF
To view the Full Article Peer-reviewed Article PDF
Abstract
Open Shortest Path First (OSPF) is a well known and prominent Internet Protocol (IP) for network routing. By deploying a
link state routing (LSR) algorithm OSPF comes under the category of interior gateway routing protocols. In today’s wireless ad
hoc Internet, the current routing domain needs to maintain a peak level of service accessibility and availability, thus OSPF must be
extended to the wireless ad hoc network for maximizing routing performance in the network by taking into account key routing
issues, i.e., optimal Hello Interval, efficient flooding schemes, optimizing the traffic engineering related issues, optimum adjacency
creations, connectivity factors, reducing control overhead, and QoS and security challenges. In addition, OSPF is very effective
in its adoption of handling the network bandwidth utilization, therefore, wireless capacity planning is of utmost importance for
today’s Internet with the possible presence of wireless infrastructure. Improving routing stability in OSPF MANET under topology
change(s) due to variation in link connectivity becomes a very demanding challenge for the research community. Given a fascinating
volume of review for literature and unavoidable importance relating to OSPF extension to MANETs, there has still persist a need to
highlight key issues related with routing in OSPF MANET.
Keywords: MANETs; Routing; OSPF; Traffic Engineering; Connectivity Factors; Capacity Planning; Flooding Schemes
Abstract|
Introduction|
References|