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/13444
Title: On/Off Sleep Scheduling in Energy Efficient Vehicular Roadside Infrastructure
Authors: Mostofi, Shokouh
Advisor: Todd, Terence D.
Dongmei Zhao, George Karakostas
Department: Electrical and Computer Engineering
Keywords: Vehicular networks;Green wireless communication networks;Roadside infrastructure;Energy efficiency;Scheduling;Sleep cycling;Graph theory;Electrical and Computer Engineering;Systems and Communications;Electrical and Computer Engineering
Publication Date: Oct-2013
Abstract: <p>Smart downlink scheduling can be used to reduce infrastructure-to-vehicle energy costs in delay tolerant roadside networks. In this thesis this type of scheduling is incorporated into ON/OFF roadside unit sleep activity, to further reduce infrastructure power consumption. To achieve significant power savings however, the OFF-to-ON sleep transitions may be very lengthy, and this overhead must be taken into account when performing the scheduling. The OFF/ON sleep transitions are incorporated into a lower bound on energy use for the constant bit rate air interface case. An online scheduling algorithm referred to as the Flow Graph Sleep Scheduler (FGS) is then introduced which makes locally optimum ON/OFF cycle decisions. This is done by computing energy estimates needed both with and without a new OFF/ON cycle. The energy calculation can be efficiently done using a novel minimum ow graph formulation. We also consider the fixed transmit power, variable bit rate, air interface case. As before, a lower bound on RSU energy use is computed by formulating and solving an integer program. Results from a variety of experiments show that the proposed scheduling algorithms perform well when compared to the energy lower bounds. The algorithms are especially attractive in situations where vehicle demands and arrival rates are such that the energy costs permit frequent ON/OFF cycling.</p>
URI: http://hdl.handle.net/11375/13444
Identifier: opendissertations/8264
9341
4613000
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
1.07 MBAdobe PDFView/Open
Show full 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