Data exchange protocol in self-organizing computing environments

The paper describes the development of a data exchange protocol for self-organizing computing environments with minimal delay. This protocol is designed for networks of mobile devices based on the neighborhoods method. The protocol is implemented using two broadcast requests. One of these requests is issued by the node at the beginning of the route; the second is from the other endpoint. The neighborhoods method allows the selection of the data types and sizes of the header fields of communication packets. This paper contains a justification for the metrics function used for route selection, and an estimation of the computational complexity of the algorithm based on the neighborhoods method is carried out.