Определение оптимальных характеристик алгоритма конкурентного доступа к среде для минимизации времени передачи данных в децентрализованных беспроводных сетях
Provides an overview of the principles of organization of communication in decentralized wireless networks is reviewed. The scheme of the decentralized network and the timing diagram of data transfer between nodes are shown. Investigated the problem of ensuring the effectiveness of collaboration with a number of nodes in low-power networks and consider the possibility of using for this purpose a probabilistic network Protocol data-link layer. The analysis of the algorithm access to the environment in a decentralized network, presents its block diagram. Detail displayed blocks of the algorithm that determine when data transmission from the network node. Through computational experiments on a model of a decentralized network investigated of the dependence of the efficiency of the work of the algorithm access to the airwaves from such temporal characteristics as the delay before sending data and waiting period before attempting to send them. The most loaded time point identified in the network exchange. It is shown that the developed computer program allow to calculate the probable collisions in the air. Suggested hardware implementation of the algorithm based on microcontroller STM32F030F4P6 of ST Microelectronics and transceiver CC1101 of Texas Instruments.