| Summary: | In recent years, wireless sensor networks have been widely used in data acquisition, surveillance, event monitoring, and so forth. Topology control is an important issue in designing sensor networks. Considering the uncertainty of distance between nodes, a distributed topology control algorithm named as LRMST, which is based on the local minimum spanning tree (LMST) algorithm, is proposed by applying the 0-1 robust discrete optimization theory. Firstly, when only the cost coefficients are subject to uncertainty, it is proved that the robust counterpart of the 0-1 discrete optimization problem on n variables can be solved by solving at most n + 1 - Γ deterministic problems, where Γ denotes the number of cost coefficients which change in an uncertainty set. Then we present a robust model for the MST problem under distance uncertainty. According to the proved conclusion, an algorithm is proposed to obtain the robust solution of uncertain MST problem by solving only one deterministic MST problem, after which LRMST algorithm is designed when the distance between nodes is affected by uncertainty. Simulation results show that LRMST algorithm tends to select some edges whose estimated distance is slightly longer and obtains the robustness when the distance is uncertain at the expense of less optimal value compared with LMST algorithm.
|
|---|
