检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京邮电大学通信与信息工程学院,江苏南京210003
出 处:《计算机技术与发展》2016年第2期185-188,194,共5页Computer Technology and Development
基 金:国家科技重大专项(2010zx03003-003)
摘 要:文中主要研究会话间网络编码技术的无线网络能耗最小化。生存期有限的无线网络能耗受限于该网络中节点可达的生存期。将到达相同信宿的多播流组成一个虚拟多播流,在同一个虚拟多播流内的数据流间进行网络编码。用公式表明能量最小化问题,并将其转化为一个线性规划问题。通过拉格朗日对偶将原优化问题转化为对偶问题,该对偶问题可分解为两个子问题:节点生存周期受限时的能耗最小化问题及流守恒和速率受限时的路由调度问题。可利用次梯度算法获得对偶问题的最优解。仿真结果表明,理论分析与实际计算非常吻合,基于会话间网络编码技术的无线网络能耗小于基于会话内网络编码技术的系统能耗,而基于会话内网络编码技术的系统能耗小于基于传统路由转发技术的系统能耗。The energy minimization for wireless networks with inter- session network coding was researched in this paper. The ener consumption of a lifetime constrained network is often limited by the available lifetime of network nodes. Multicast flow s with the sam destination nodes constitute a commodity and network coding can be employed among different flow s in the same commodity. The pro lem of energy minimization is first formulated,and then transformed into a linear programming problem. In light of Lagrangian dual,t primary optimization problem can be converted into a dual problem,which can be solved by utilizing sub- gradient method. The du problem is decomposed into two sub- problems. One is energy minimization with lifetime constrained at each node,and the other is ro ting and scheduling under the flow conservation and physical rates constraints. Simulation results illustrate that the energy consumption wireless networks with inter- session network coding is lower than that of intra- session network coding,and the energy consumption wireless networks with intra- session is no more than that of traditional routing.
关 键 词:会话内网络编码 会话间网络编码 无线网络 次梯度
分 类 号:TP31[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3