Please use this identifier to cite or link to this item:
http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/1783
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Maruf, M. A. | - |
dc.contributor.author | Singh, A. | - |
dc.contributor.author | Azim, A. | - |
dc.contributor.author | Auluck, N. | - |
dc.date.accessioned | 2021-06-09T19:30:31Z | - |
dc.date.available | 2021-06-09T19:30:31Z | - |
dc.date.issued | 2021-06-10 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1783 | - |
dc.description.abstract | Despite reduced network latency and resilience, fog computing has not been leveraged for vehicular Over-theAir (OTA) updates. Due to vehicle mobility and traffic, the resource utilization of fog nodes is almost non-deterministic, which increases the delay in communication and handover. In this paper, we propose an approach for distributing fog nodes by analyzing the vehicular traffic pattern in a region. The proposed method: (a) finds the optimal number of fog nodes for a specific time interval based on the traffic pattern of a region and (b) maximizes the net reserve resources enabling specific fog nodes. To do so, we use the k-means algorithm to identify traffic load and distribute the fog nodes using our proposed algorithm to maximize fog resource utilization. We present a case study of OTA updates that considers vehicle mobility, data transmission rate, propagation delay and handover delay to predict the required update time. The experimental results demonstrate that the proposed method of fog node allocation extends the net reserve resources by 30.92% on an average, and reduces the OTA update time. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Resource efficient allocation of fog nodes for faster vehicular OTA updates | en_US |
dc.type | Article | en_US |
Appears in Collections: | Year-2020 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 736.63 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.