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

发布时间：2018-11-25 21:37

【摘要】：近期协作路由协议的研究受到广泛关注。然而,现多数协作路由协议是以减少能量消耗为目的,它们并没有考虑在协作路由中的数据包碰撞概率最小化问题。为此,针对无线传感网WSNs(Wireless Sensor Networks)的协作路由,提出基于最小化碰撞概率的功率分配CMPA(Collision Minimization-based Power Allocation)算法。首先,推导了碰撞概率数学模型,并形成了混合整数非线性规划问题。然后,为了降低复杂度,将功率分配和路由选择进行独立处理,同时利用分支界定空间缩小BBSR(Branch-and-Bound Space Reduced)算法求解。仿真结果表明,提出的CMPA算法能够有效地降低碰撞概率和总的传输功率。与OKCR算法相比,CMPA算法的碰撞概率下降了近82%,总的传输功率下降了0.1 d B。
[Abstract]:Recently, the research of cooperative routing protocols has been paid more and more attention. However, most cooperative routing protocols are aimed at reducing energy consumption, and they do not consider the minimization of packet collision probability in cooperative routing. Therefore, a power allocation CMPA (Collision Minimization-based Power Allocation) algorithm based on minimizing collision probability is proposed for cooperative routing of WSNs (Wireless Sensor Networks) in wireless sensor networks. First, the mathematical model of collision probability is derived, and the mixed integer nonlinear programming problem is formed. Then, in order to reduce the complexity, the power allocation and route selection are processed independently, and the BBSR (Branch-and-Bound Space Reduced) algorithm) is reduced by using the branch definition space. Simulation results show that the proposed CMPA algorithm can effectively reduce the collision probability and total transmission power. Compared with the OKCR algorithm, the collision probability of the CMPA algorithm is reduced by nearly 82 and the total transmission power is reduced by 0.1 dB.
【作者单位】：阿坝师范学院网络管理中心;阿坝师范学院图书馆;
【基金】：国家863计划项目(2013AA040302) 四川省教育厅重点项目(15ZA0338)
【分类号】：TN929.5;TP212.9

【相似文献】