Abstract
SummaryIn recent years, many realistic wireless ad hoc networks (WANETs) have taken on three‐dimensional characteristics due to the implementation of various structures such as viaducts, tunnels, and overpasses. An increasing amount of work has also been devoted to studying the challenges posed by 3D vanet scenarios. And research on routing methods for 3D vanet scenarios is a hot topic. However, the three‐dimensional scene routing decision schemes have some problems, such as low data transmission efficiency, high energy consumption, and low end‐to‐end delays. Therefore, an energy efficiency optimization routing decision system is proposed based on the establishment of a three‐dimensional Voronoi polygon topology model. First, we define a node state‐related attribute parameter that determines whether the source node and the forward node are linked. The data forwarding node is determined by comparing attribute differences. Then, a power control mechanism based on received signal strength is proposed to solve the energy consumption, which includes deterministic and random parts. Finally, the specific state of the network node is monitored by comparing the attribute decision matrix to ensure basic maintenance of network operation and improve network transmission reliability. The simulation results show that the proposed scheme not only ensures the communication performance index in WANETs but also improves the reliability of the network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Concurrency and Computation: Practice and Experience
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.