Distributed Destination Search Routing for 5G and beyond Networks

Area of Science:

• Computer Science
• Telecommunications Engineering
• Network Routing

Background:

• Fifth-generation (5G) and beyond networks support distributed applications like the Internet of Things (IoT), connected robotics, and massive Machine Type Communication (mMTC).
• Decentralized network architectures necessitate efficient methods for devices to discover destinations and establish routes without central management.
• Existing routing protocols face challenges in optimizing energy consumption and latency in dynamic, distributed environments.

Purpose of the Study:

• To propose a novel destination search and routing method for distributed 5G and beyond networks.
• To enhance the efficiency of route discovery in decentralized network environments.
• To reduce energy consumption and time delay associated with routing in next-generation networks.

Main Methods:

• A source-initiated, expanding disk-like pattern search strategy is employed for destination discovery.
• Multiple search attempts are made, progressively increasing the search area to improve discovery probability.
• Three routing variants are proposed, tailored for high, medium, and low-density network scenarios.

Main Results:

• The proposed method demonstrates improved performance compared to existing techniques.
• Significant reductions in time latency for routing were observed.
• Reduced energy consumption was achieved through efficient route discovery.

Conclusions:

• The developed destination search and routing method is effective for distributed 5G and beyond networks.
• The approach offers a viable solution for optimizing performance in terms of latency and energy efficiency.
• The method's adaptability to various network densities makes it suitable for diverse future network applications.