Abstract

Sixth-generation networks and vehicular Ad hoc networks advancement brought us to the cusp of a new era. Autonomous Vehicles with a plethora of advanced applications require a substantially enhanced vehicle-to-everything communication network. The infrastructure should efficiently support hyper-fast, ultra-reliable, and low-latency massive data exchange. Roadside units were initially exploited as a promising communication solution to overcome this challenge. However, the challenging integration with the infrastructure led to the investigation of additional solutions. Unmanned aerial vehicles are one of the most dominant assistive solutions due to their inherent advantage of mobility. Moreover, air-to-air and ground-to-air networks are more efficient than ground-to-ground. Nevertheless, it is a prerequisite to leverage the potential of unmanned aerial vehicles to attain nationwide Vehicle-to-Everything connectivity. Therefore, we focused our research orientation on developing a strategy to optimize the network’s coverage within the intelligent transportation systems framework. In particular, we have deployed an innovative algorithmic technique that constructs Voronoi diagrams using circles. Besides, we applied the poison point process to determine the optimum locations of the transceivers’ establishment. Simulation results illustrate full network coverage for the tested area after the required iterations. Also, time complexity evaluation proved the simplicity of the proposed algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.