Maximum Freedom Last Scheduling Algorithm for Downlinks of DSRC Networks

This paper presents a maximum freedom last (MFL) scheduling type algorithm for implementation in dedicated short-range communication (DSRC) downlinks in intelligent transportation systems (ITS). The algorithm is designed to minimize the handoff rate with the maximum possible delay constraint between roadside units (RSU) to the onboard units (OBU). The algorithm has four main stages in which it regulates information transmission. The first is an initialization phase followed by a reverse lineup phase, a transmission time pileup phase and, lastly a partial service phase. When compared to traditional methods such as the first come first serve (FCFS) scheduling algorithm and the earliest deadline algorithm (EDA), the MFL algorithm performs better in terms of service failure rate, system handoff rate, and system utilization rate.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/41297384
• Authors:
  • Chang, Chung-Ju
  • Cheng, Ray-Guang
  • Shih, Hao-Tang
  • Chen, Yih-Shen
• Publication Date: 2007-6

Language

• English

Media Info

• Media Type: Print
• Features: Appendices; Figures; Photos; References;
• Pagination: pp 223-232
• Serial:
  • IEEE Transactions on Intelligent Transportation Systems
  • Volume: 8
  • Issue Number: 2
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
  • ISSN: 1524-9050
  • Serial URL: http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6979

Subject/Index Terms

• TRT Terms: Algorithms; Dedicated short range communications; Intelligent transportation systems; Scheduling
• Subject Areas: Highways; Operations and Traffic Management; Research; Vehicles and Equipment; I90: Vehicles;

Filing Info

• Accession Number: 01054548
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Files: BTRIS, TRIS
• Created Date: Jul 30 2007 8:30AM