A Greedy Routing Protocol for Improving Service Quality in Vehicular ad hoc Networks

سال انتشار: 1399
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 540

فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

DCBDP06_071

تاریخ نمایه سازی: 25 اسفند 1399

چکیده مقاله:

Vehicular Ad-hoc Networks (VANETs) are an emerging field, whereby vehicle-to-vehicle communications can enable many new applications such as safety and entertainment services. Most VANET applications are enabled by different routing protocols. The design of such routing protocols, however, is quite challenging due to the dynamic nature of nodes in VANETs. In this paper, a greedy algorithm, namely PTGA, was proposed for improving service quality in routing in VANETs. PTGA is an efficient, greedy, transmission algorithm based on scheduler which operates based on three strategies of FFC (further first car), TCW (time correction waiting) and RRP (Reduce Redundant Packets). FFC strategy selects the farthest receiving vehicle as the sender when the angles of the sender and receiver are identical. TCW strategy is used for correcting scheduler error in an intersection and RRP strategy is used for avoiding unnecessary packet transmission on two roads near each other. The results of simulations, conducted by NS-2, indicated that the proposed method was able to improve packet delivery rate, throughput and end-to-end delay.

کلیدواژه ها:

VANETs ، greedy routing ، quality of service (QoS) ، packet delivery rate

نویسندگان

Paria Kiafar

Department of computer engineering, Seraj University, Tabriz, Iran

Ali Ghaffari

Department of computer engineering, Tabriz branch, Islamic azad university, Tabriz, Iran

Mohammad Miri Shallo

Department of computer engineering, Seraj University, Tabriz, Iran