【摘要】 针对当网络使用睡眠调度并且节点的传输功率连续可调节时的最小功率广播调度问题,首先给出了一种计算节点内部最优发送调度的递归方法,然后提出了一种构造最小功率广播调度的离散粒子群算法。该算法搜索最优广播树结构,并融合基于最小广播功率增量的贪心算法和基于启发式调整广播树结构的局部优化算法以提高收敛速度和求解质量。模拟实验结果表明所提算法能够有效地减少广播功率。更多还原

【Abstract】 For the minimum power broadcast scheduling problem where network uses sleep scheduling and each node’s transmission power is continuously adjustable,a recursive approach to compute the optimal transmission scheduling of a node was firstly presented,and then a discrete particle swarm optimization algorithm to construct the minimum power broadcast scheduling was proposed.This algorithm searches for the optimal broadcast arborescence,and utilizes the greedy algorithm based on the minimization of the broadcast’s power increment and the local optimization algorithm based on the heuristic adjustment of the broadcast arborescence to improve the convergence speed and the result quality.The simulation results show that the proposed algorithm is able to effectively reduce the broadcast power.更多还原