Abstract
Fifth-generation and beyond networks target multiple distributed network application such as Internet of Things (IoT), connected robotics, and massive Machine Type Communication (mMTC). In the absence of a central management unit, the device need to search and establish a route towards the destination before initializing data transmission. In this paper, we proposes a destination search and routing method for distributed 5G and beyond networks. In the proposed method, the source node makes multiple attempts to search for a route towards the destination by expanding disk-like patterns originating from the source node. The source node increases the search area in each attempt, accommodating more nodes in the search process. As a result, the probability of finding the destination increases, which reduces energy consumption and time delay of routing. We propose three variants of routing for high, medium, and low-density network scenarios and analyze their performance for various network configurations. The results demonstrate that the performance of the proposed solution is better than previously proposed techniques in terms of time latency and reduced energy consumption, making it applicable for 5G and beyond networks.
Highlights
Fifth-generation (5G) and beyond networks aim to provide users with high data rates, full network coverage, high connectivity, and improved security
We consider a wireless network setup with devices uniformly distributed in the square region
The random waypoint mobility model implementation on each node incorporates the effect of topological changes on the performance of the proposed scheme introduced due to link breaks, active route time outs, and route errors, which makes the experimental scenario more practical to test the performance of the proposed algorithm
Summary
Fifth-generation (5G) and beyond networks aim to provide users with high data rates, full network coverage, high connectivity, and improved security. The modified version uses ant colony optimization technique for beamforming and reduces routing overhead, improves throughput, and reduces time latency to meet existing 5G requirements. We propose Expanding Disk Search (EDS) algorithm for destination search in 5G and beyond networks. The process reduces the number of attempts required by the source node to search the destination; as a result, it improves energy consumption and reduces time latency of the route. EDS is more feasible to apply in 5G and beyond networks where minimum time latency and reduced energy consumption are required. The analysis shows that the proposed technique is suitable for diverse network applications that require less energy consumption and time to discover the route.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
