A cost-sensitive method for wireless sensor network min beacon node set construction.

Sensor placement problems need to take into account its performance, coverage, cost and other factors as well as practical applications. The location of the beacon nodes is important for reducing localization errors and avoid excessive deployment costs. In this paper, we present a framework named a cost sensitive minimum beacon set method based on constructing a quad tree-based model to place beacon nodes that is trade-off between high localization accuracy and node density. Specifically, we construct an alternative set using the indexing strategy to avoid the amount of computation becoming larger as the set becomes larger and then the set of beacon nodes is constructed by pruning. The set satisfies at least N unknown nodes can communicate with the beacon node set to determine their own location while at the same time satisfying the minimum number of nodes in the beacon node. Experimental results show that the algorithm can effectively solve the problem, and can provide the localization function as well as achieve the online inquiry very well. [ABSTRACT FROM AUTHOR]