Wireless sensor network minimum beacon set selection algorithm based on tree model

Wireless sensor networks (WSNs) are highly attractive both in academia and in practice as a wholly new platform for information transmission. Localization technology is a key technology of WSNs. The structure of the beacon node set is very important to the positioning of the nodes. A method for constructing a minimum beacon set is proposed in this thesis based on the tree model, in which unimportant nodes are identified as early as possible and then pruned. Thus, we avoid unnecessary calculations when establishing the minimum beacon set. This method can provide a reliable guarantee for the unknown node localization. According to our experiment, this algorithm is rapid and stable.