Abstract
Mobile Ad-hoc network (MANET) is the guiding technology of ubiquitous era and a cornerstone in the 4G communication architecture. MANET has limited resources and characterized with high mobility and frequent topology change. Routing in MANET should follow these constrains, otherwise, it can severely degrade the performance of MANET. Owing to Greedy routing (GFS) nature in MANET, a certain part of the MANET becomes congested before other parts. In such area the nodes have failed to forward packets in a timely manner or drop them, thus such nodes called Network Holes. This paper presents a simple and efficient enhanced GFS routing algorithm called Intelligent Fuzzy logic Greedy forwarding Scheme (IFGFS). IFGFS consider the De-congestion level of each mobile node as another selective metric besides distance. In order to validate our algorithm, we rely on a wide simulation experiments. The evaluation results showed the correctness of our new proposed algorithm the adaptive- congestion IFGFS which maximize the performance of the network.
Highlights
The functionality qualifications of Mobile Ad-hoc networks (MANETs) are envisioned to become an essential component of overall next-generation wireless network functionalities (Belkadi, 2010; Boukerche et al, 2011; Ambhaikar& Sharma, 2010; Kavitha&Vanaja, 2015)
Owing to Greedy routing (GFS) nature in MANET, a certain part of the MANET becomes congested before other parts
This paper presents a simple and efficient enhanced GFS routing algorithm called Intelligent Fuzzy logic Greedy forwarding Scheme (IFGFS)
Summary
The functionality qualifications of Mobile Ad-hoc networks (MANETs) are envisioned to become an essential component of overall next-generation wireless network functionalities (Belkadi, 2010; Boukerche et al, 2011; Ambhaikar& Sharma, 2010; Kavitha&Vanaja, 2015). MANETs are networks formed without a central administration. They consist of mobile nodes on the fly. The mobile nodes in ad hoc networks communicate wirelessly, and can serve as both hosts and routers at the same time (Zheng et al, 2011; Hiremath&Joshi, 2012; De Rango et al, 2012; Chen&Weng, 2012; Rajaram&Sugesh, 2011). Due to its implementation simplicity and efficiency, Cartesian forwarding policy (Sandeep et al, 2017; Palaniappan, 2015; Mouzehkesh et al, 2013; Jannu&Jana, 2016; Hassan, et al, 2014) is the most used with the majority of recently proposed position-based routing protocols. GFS follows the shortest path (optimal path), since it makes the largest possible movement towards the destination
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call