Analyzed the classic algorithms for the shortest spanning tree, given their comparative characteristics. Is considered the types of element distribution wireless sensor network. Is proposed the variants of modifying the algorithm for finding the shortest spanning tree based on the account of the particular structure of the network, which can improve the efficiency of the algorithm of routing in wireless sensor networks.
algorithm, shortest spanning tree, wireless sensor network
“Modifikatsiia algoritma postroeniia kratchaishego ostovnogo dereva dlia besprovodnoi sensornoi seti”,
Information Processing Systems,