A probabilistic analysis of border node-based MFR routing protocol for vehicular ad hoc networks
by Ram Shringar Raw; Daya K. Lobiyal; Sanjoy Das
International Journal of Computer Applications in Technology (IJCAT), Vol. 51, No. 2, 2015

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.

Online publication date: Mon, 20-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com