检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘伟[1] 刘军[1] LIU Wei;LIU Jun(National Key Laboratory of Science and Technology on Communications, University of Science and Technology of China, Chengdu 611731, China)
机构地区:[1]电子科技大学通信抗干扰技术国家重点实验室,四川成都611731
出 处:《通信学报》2017年第7期70-77,共8页Journal on Communications
基 金:国家自然科学基金资助项目(No.61271168)~~
摘 要:针对时延敏感传感器网络中时延需求和功率受限情况,联合优化传感器间资源分配与功率控制,将动态资源管理问题建模为一个随机优化问题。基于李雅普诺夫优化理论,将较难处理的随机优化问题转变为确定性的混合整数规划问题。在分析问题具体结构基础上,将混合整数规划问题等价地转换为单变量优化问题,进一步提出基于传感器间协作的分布式求解方法,该方法能够实现全局最优解。最后提出动态资源管理算法求解原随机优化问题。通过仿真验证了所提算法的性能,并揭示时延与功率消耗间的折中关系。The delay-aware dynamic resource management problem was investigated in sensor network,with a focus on resource allocation among the sensors and power control along the time.By taking account of average delay requirements and power constraints,the considered problem was formulated into a stochastic optimization problem.Inspired by Lyapunov optimization theory,the intractable stochastic optimization problem was transformed into a tractable deterministic optimization problem,which was a mixed-integer resource management problem.By exploiting the specific problem structure,the mixed-integer resource management problem was equivalently transformed into a single variable problem,and the cooperative distributed method was present to effectively solve it with guaranteed global optimality.Finally,a dynamic resource management algorithm was proposed to solve the original stochastic optimization problem.Simulation results show the performance of the proposed dynamic algorithm and reveal that there exists a fundamental tradeoff between delay requirements and power consumption.
关 键 词:时延敏感 传感器网络 动态资源管理 随机优化问题
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70