WSN中基于混合整数非线性规划的功率分配算法  

Mixed Integer Non-Linear Programming Problem-Based Power Allocation Algorithm in WSNs

作　　者：李睿 赵保华 

机构地区：[1]阿坝师范学院网络管理中心,四川汶川623002 [2]阿坝师范学院图书馆,四川汶川623002

出　　处：《传感技术学报》2017年第7期1119-1124,共6页Chinese Journal of Sensors and Actuators

基　　金：国家863计划项目(2013AA040302);四川省教育厅重点项目(15ZA0338)

摘　　要：近期协作路由协议的研究受到广泛关注。然而,现多数协作路由协议是以减少能量消耗为目的,它们并没有考虑在协作路由中的数据包碰撞概率最小化问题。为此,针对无线传感网WSNs(Wireless Sensor Networks)的协作路由,提出基于最小化碰撞概率的功率分配CMPA(Collision Minimization-based Power Allocation)算法。首先,推导了碰撞概率数学模型,并形成了混合整数非线性规划问题。然后,为了降低复杂度,将功率分配和路由选择进行独立处理,同时利用分支界定空间缩小BBSR(Branch-and-Bound Space Reduced)算法求解。仿真结果表明,提出的CMPA算法能够有效地降低碰撞概率和总的传输功率。与OKCR算法相比,CMPA算法的碰撞概率下降了近82%,总的传输功率下降了0.1 d B。Recently, cooperative routing has received widespread attention. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption;however, packet collision minimization using cooperative routing has not yet been addressed. Collision Minimization-based power allocation （CMPA）algorithm for cooperative routing in wireless sensor networks（WSNs） is proposed in this paper. In CMPA algorithm, we introduce a mathematical mode,and firstly formulate the problem as a large-scale mixed integer non-linear programming problem. Then the branch-and-bound space reduced method（BBSR）is used to solve the problem.The simulation results reveal that the presented algorithms can significantly reduce the collision probability and total transmission power compared with the existing schemes. Compared with OKCR algorithm, Collision transmission power is reduced by 0.1 dB. probability of CMPA algorithm is reduced by 82%, total

关 键 词：无线传感网 协作路由 碰撞概率 功率分配 分支界定法 

分 类 号：TP393.092[自动化与计算机技术—计算机应用技术]