Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4113
Title: Energy-and-delay-aware scheduling and load balancing in vehicular fog networks
Authors: Sethi, V.
Pal, S.
Vyas, A.
Naik, K.
Jain, S.
Keywords: Vehicle-to-roadside communication (V2R)
Relay vehicle selection
Second-price auction game
Load re-balancing
Ant colony optimization
Issue Date: 26-Oct-2022
Abstract: Roadside units (RSUs) play an important role in the request fulfillment of vehicles. In rural areas, RSUs are powered by renewable energy sources like solar energy. Hence, the request fulfillment of vehicles must be done in such a way that the energy consumption across RSUs is minimized. The requests are categorized into traditional application (low computation) requests and smart application (high computation) requests. To avoid excessive computation at RSUs, low computation requests are scheduled across RSUs while high computation requests are scheduled across fog servers for processing. In this paper, we propose an online energy-efficient Inter-RSU Scheduling Algorithm (ee-IRSA) and a distributed Ant Colony Optimization-based Load balancing technique (d-ACOL) for optimizing the request fulfillment of traditional and smart application requests, respectively. ee-IRSA ensures minimum and uniform energy consumption across RSUs while d-ACOL ensures minimum queue waiting time of requests across fog servers. In addition, a second-price auction game-based relay vehicle selection technique is proposed which further minimizes the energy consumption of RSUs. Simulation results show that ee-IRSA with relay vehicle selection reduces the energy consumption by 33%, and d-ACOL reduces the queue waiting time by an average of 48% as compared to other load balancing techniques.
URI: http://localhost:8080/xmlui/handle/123456789/4113
Appears in Collections:Year-2022

Files in This Item:
File Description SizeFormat 
Full Text.pdf1.43 MBAdobe PDFView/Open    Request a copy


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