Title: A probabilistic analysis of border node-based MFR routing protocol for vehicular ad hoc networks
Authors: Ram Shringar Raw; Daya K. Lobiyal; Sanjoy Das
Addresses: Dept. of Computer Science & Engineering, Ambedkar Institute of Advanced Communication Technologies and Research, (Formerly Ambedkar Institute of Technology), Govt. of NCT of Delhi, Geeta Colony, Delhi 110031, India ' School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi 110067, India ' Galgotias University, Uttar Pradesh 203201, India
Abstract: In this paper, we examined the significance of position-based routing with border-node-based forwarding for vehicular ad hoc network (VANET) to optimise path length between vehicles. We have mathematically evaluated the performance of border node-based forwarding method such as Border node-based MFR (B-MFR). B-MFR strongly avoids the interior nodes within the transmission range for further transmitting the packets. Furthermore, we have developed a mathematical model for B-MFR to determine average number of hop counts, expected distance between source and destination, and maximum progress of the next-hop node towards the destination node using Poisson distribution for node deployment. Analytical and simulation results indicate that B-MFR can provide efficient routing in VANETs. In our work, results clearly show that using the border-nodes is an advantage to maximise the performance of routing protocol in terms of average number of hops with minimum delay. We have mathematically simulated the proposed protocol in MATLAB and compared the result with existing routing protocol MFR.
Keywords: MANETs; mobile ad hoc networks; VANETs; vehicular ad hoc networks; routing protocols; position-based routing; MFR; most forward progress within radius; B-MFR; border nodes; vehicle distance; mathematical modelling; simulation; vehicular communications; vehicle safety.
International Journal of Computer Applications in Technology, 2015 Vol.51 No.2, pp.87 - 96
Received: 08 May 2021
Accepted: 12 May 2021
Published online: 20 Apr 2015 *