科研之友
微信
新浪微博
Facebook
分享链接
摘要
In the wireless sensor networks, deploying a small amount of heterogeneous nodes which directly communicate with the Sink node, can form shortcuts. The shortcuts can make the network to have small-world properties, which can save energy and improve network performance. In the large-scale networks, the optimal deployment of heterogeneous nodes is a NP-hard problem. Considering the total energy consumption of the network and the uniformity of each node energy consumption, this paper presents a clustering heterogeneous network routing algorithm which based on mixed integer programming (CHNMIP). Firstly, the algorithm supposes that the heterogeneous nodes can only be placed in the position of the common nodes and converts the optimal deployment of heterogeneous nodes into a mixed integer programming problem, and finds out the approximate optimal solution using Lagrangian relaxation and Benders decomposition algorithm. Then, it dynamically divides common nodes into clusters, and sets the appropriate transmission. Finally, it theoretically analyzes the performance of CHNMIP routing algorithm, and the simulation results also show that CHNMIP routing algorithm can better improve the network performance in different simulation environment.
