期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2021
卷号：99
期号：22
语种：English
出版社：Journal of Theoretical and Applied
摘要：With the appearance of new technologies: ICT, IoT, 5G, the spread of wireless internet, increasingly growing services and the current explosion of information systems on Ad Hoc networks, it is therefore necessary to have a new efficient routing strategy especially for large Ad Hoc networks, which takes into consideration the quality of service to increase the lifetime of the network by reducing energy loss while being responsive to changes in the environment. Thus, new emerging methods to save time during the journey of the message from the source node to the destination. In this context, this article focuses on developing a hybrid model between three approaches: the best known K-mean algorithm for clustering and the most popular Ant Colony Algorithm (ACO) and using the newest parallel optimization approach today. We will first take a quick look at the solutions existing for the programming of parallel machines; it introduces a new method of calculation by the processor. However, parallelism makes it possible to create a new model capable of finding the shortest path in terms of cost and time. So, our motivation is to find the shortest path from the source node to the destination with a rapid speed of heuristics and parallelism. Details of our new approach, methods and analyzes are clearly described, well presented and relevant to the objectives of the project. To assess our model, we compared it with another recent article. The results show that our new approach can be beneficial in solving routing problems in AD Hoc networks that are large (until 1000 sensors) and which meet the user need of modern life.
关键词：Artificial Intelligence;NP-Complete;Parallel Computer;Ant Colony Optimization;And Ad Hoc Network
