Earticle

초록

영어

As vehicular networks become popular and many vehicles want to access data through a roadside unit. In this paper, there was a vehicle to roadside communication and we propose scheduling schemes for efficient delivery of data packets in vehicular adhoc network. On the basis of priority scheduling algorithm vehicles can download/upload the data from RSU. In this paper we can control the congestion and delay of data by assigning the priorities to the message. The process with highest priority is executed first and highest priority is assign to those processes which have the smallest data size and this scheme is the smallest data size first scheduling(SDF) . If the two processes having the same data size then we can assign the priority on the basis of first come first serve scheduling (FCFS). We can combine these two algorithms and the new algorithm D*A. is introduced. This algorithm is responsible for only sending the commercial messages and the safety messages will be send on the different channel. The emergency messages will be sending through control channel with help of EDF scheduling. This paper increases the efficiency and throughput of the process and decreases the turnaround time for the process.

목차

Abstract
 1. Introduction
 2. Literature Work
 3. Data Delivery in VANET
 4. Proposed Scheme
  4.1 System Model
  4.2 Message Prioritization
  4.3 Congestion Control Approach
  4.4 Roadside Unit Scheduling Schemes
 5. Performance Evaluation
  5.1 Experimental Setup
 6. Conclusion and Future Work
 Acknowledgements
 References

키워드

저자

• Neha Verma [ Department of Information Technology, Maharishi Markandeshwar University ]
• Rakesh Kumar [ Department of Information Technology, Maharishi Markandeshwar University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Advanced Science and Technology

• 간기

  월간

• pISSN

  2005-4238

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605