 |
In this section, we will provide a detailed solution to the formulated problem. Since it is an NP-hard problem, it is impossible to find the optimal solution within a given finite time or steps. Hence, we propose a density-based heuristic algorithm to solve this problem herein. Our method contains 3 phases and is elaborated as follows.
1. Calculate the density of each road lamp. We first assume that an RSU is placed on it and find those nearby lamps located within its radio coverage range. Then, calculate the corresponding density for all lamps and obtain the density list.
2. Sort the density list in descending order. Take out the 1st lamp in sĄŻ, and find those lamps located within its range. This lamp is designated to place an RSU. Then, delete the 1st lamp together with the corresponding elements in sĄŻ. Afterwards, delete the RSU .
3. Repeat step (2) until it satisfies the iteration termination conditions.
|
IEEE/ICACT20230191 Slide.09
[Big Slide]