Abstract
Lower energy consumption and higher data rate have been becoming the key factors of modern wireless mobile communication for the improvement of user experiences. At present, the commercialization of 5G communications is gradually promoting the development of Internet of things (IoT) techniques. Due to the limited coverage capability of direct wireless communications, the indirect device-to-device (D2D) communications using information relay, in addition to the single 5G base station deployment, have been introduced. Along with the increase of information nodes, the relay devices have to undertake the nonnegligible extra data traffic. In order to adjust and optimize the information routing in D2D services, we present an algorithmic investigation referring to the ant colony optimization (ACO) algorithm and the artificial immune algorithm (AIA). By analyzing the characteristics of these algorithms, we propose a combined algorithm that enables the improved the iterative convergence speed and the calculation robustness of routing path determination. Meanwhile, the D2D optimization pursuing energy saving is numerically demonstrated to be improved than the original algorithms. Based on the simulation results under a typical architecture of 5G cellular network including various information nodes (devices), we show that the algorithmic optimization of D2D routing is potentially valid for the realization of primitive wireless IoT networks.
Highlights
Since the late eighties of the last century, the Internet has been fast developing along with the progress of personal computers
The information feedback in artificial immune algorithm (AIA) programming is usually inefficient, which may lead to severely redundant iterations, the global optimizing advantage complementary to that of ant colony optimization (ACO) algorithms may potentially open up a novel feasible algorithm appropriate to the iterative calculations for the wireless D2D routing paths [23]
According to the numerical simulation results, we showed that the newly designed algorithm significantly improves the D2D routing solutions, and the energy-saving performance may potentially enable the primitive wireless Internet of things (IoT) for sensor network applications
Summary
Since the late eighties of the last century, the Internet has been fast developing along with the progress of personal computers. The information feedback in AIA programming is usually inefficient, which may lead to severely redundant iterations, the global optimizing advantage complementary to that of ACO algorithms may potentially open up a novel feasible algorithm appropriate to the iterative calculations for the wireless D2D routing paths [23]. Following these ideas, we proposed and a new algorithm, which combines the ACO and AIA principles, and quantitatively discussed the iterative calculation performances via numerical simulations. According to the numerical simulation results, we showed that the newly designed algorithm significantly improves the D2D routing solutions, and the energy-saving performance may potentially enable the primitive wireless IoTs for sensor network applications
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.
