Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/14111
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorTodd, Terence D.en_US
dc.contributor.advisorDongmei Zhao, Ted Szymanksien_US
dc.contributor.authorHammad, Abdulla A.en_US
dc.date.accessioned2014-06-18T17:06:21Z-
dc.date.available2014-06-18T17:06:21Z-
dc.date.created2014-04-23en_US
dc.date.issued2014-04en_US
dc.identifier.otheropendissertations/8939en_US
dc.identifier.other10020en_US
dc.identifier.other5512901en_US
dc.identifier.urihttp://hdl.handle.net/11375/14111-
dc.description<p>This thesis proposes different scheduling algorithm to be implemented on the Roadside Units in ITS environment. Both variable and constant bit rate cases are considered.</p>en_US
dc.description.abstract<p>Vehicular Ad-hoc Networks (VANETs) will be an integral part of future Intelligent Trans- portation Systems (ITS). In highway settings where electrical power connections may not be available, road-side infrastructure will often be powered by renewable energy sources, such as solar power. For this reason, energy efficient designs are desirable.</p> <p>This thesis considers the problem of energy efficient downlink scheduling for road- side infrastructure. In the first part of the thesis, the constant bit rate (CBR) air interface case is investigated. Packet-based and timeslot-based scheduling models for the theoretical minimum energy bound are considered. Timeslot-based scheduling is then formulated as a Mixed Integer Linear Program (MILP). Following this, three energy efficient online scheduling algorithms with varying complexity are introduced. Results from a variety of experiments show that the proposed scheduling algorithms perform well when compared to the energy lower bounds.</p> <p>In the second part of the thesis, the variable bit rate (VBR) air interface option is considered. Offline scheduling formulations are derived that provide lower bounds on the energy required to fufill vehicle requests. An integer linear program (ILP) is introduced which can be solved to find optimal offline VBR schedules. Two flow graph based models are then introduced. The first uses Generalized Flow (GF) graphs and the second uses time expanded graphs (TEGs) to model the scheduling problem. Four online scheduling algorithms with varying energy efficiency, fairness and computational complexities are developed. The proposed algorithms’ performance is examined under different traffic scenarios and they are found to perform well compared to the lower bound.</p>en_US
dc.subjectITSen_US
dc.subjectVANETen_US
dc.subjectVehicularen_US
dc.subjectGreenen_US
dc.subjectSchedulingen_US
dc.subjectRSUen_US
dc.subjectElectrical and Electronicsen_US
dc.subjectPower and Energyen_US
dc.subjectSystems and Communicationsen_US
dc.subjectElectrical and Electronicsen_US
dc.titleDownlink Traffic Scheduling in Green Vehicular Roadside Infrastructureen_US
dc.typethesisen_US
dc.contributor.departmentElectrical and Computer Engineeringen_US
dc.description.degreeDoctor of Philosophy (PhD)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
1.15 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue