无线自组网中基于离散粒子群优化的睡眠调度感知最小功率广播.pdf

第34 卷第6 期 通 信 学 报 Vol.34 No. 6 2013 年6 月 Journal on Communications June 2013 doi:10.3969/j.issn.1000-436x.2013.06.003 无线自组网中基于离散粒子群优化的睡眠调度感知最小功率广播 1,2 1,2 朱晓建 ，沈军 (1. 东南大学 计算机科学与工程学院，江苏 南京 211189 ；2. 东南大学 计算机网络和信息集成教育部重点实验室，江苏 南京 211189) 摘 要：针对当网络使用睡眠调度并且节点的传输功率连续可调节时的最小功率广播调度问题，首先给出了一种 计算节点内部最优发送调度的递归方法，然后提出了一种构造最小功率广播调度的离散粒子群算法。该算法搜索 最优广播树结构，并融合基于最小广播功率增量的贪心算法和基于启发式调整广播树结构的局部优化算法以提高 收敛速度和求解质量。模拟实验结果表明所提算法能够有效地减少广播功率。 关键词：无线自组网；睡眠调度；最小功率；广播调度；离散粒子群优化 中图分类号：TP393 文献标识码：A 文章编号：1000-436X(2013)06-0016-13 Sleep scheduling-aware minimum power broadcast in wireless ad hoc networks based on discrete particle swarm optimization ZHU Xiao-jian 1,2, SHEN Jun1,2 (1. School of Computer Science and Engineering, Southeast University, Nanjing 211189, China; 2. Key Laboratory of Computer Network and Information Integration of Ministry of Education, Southeast University, Nanjing 211189, China) 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