ОПЫТ МОДЕЛИРОВАНИЯ ГЕООРИЕНТИРОВАННОГО АЛГОРИТМА МАРШРУТИЗАЦИИ ДЛЯ ПОИСКА КОНТЕНТА В AD HOC СЕТЯХ
The article presents the results of the study of routing algorithms in ad hoc networks. Considered the scope of ad hoс networks. The problems that arise when trying to move to decentralized networks are shown. Briefly presented the existing types of content search routing algorithms. Considered the conditions necessary for their application. One of the existing algorithms is analyzed in detail using the model execution example. The presented algorithm is focused on the geographical position of the node in space. A brief description of the algorithm in pseudocode is also given. The written application allows the user to study the work of the decentralized network with the specified parameters. User can explore the network by getting an interactive display of the connections between the bonds and the paths of the constructed routes. Simulated in high-level Java programming language using Anylogic.