检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学信息与通信工程研究所,浙江杭州310027
出 处:《浙江大学学报(工学版)》2009年第8期1406-1411,1472,共7页Journal of Zhejiang University:Engineering Science
基 金:国家自然科学基金资助项目(60572115);国家"863"高技术研究发展计划资助项目(2007AA01Z257);浙江省自然科学基金重点资助项目(Z104252)
摘 要:研究规则的多接口多信道无线Mesh网络吞吐量最优化问题,目的是在给定网络拓扑结构和流量需求的情况下,联合考虑功率控制、信道分配和调度,求出公平性约束下的最大吞吐量.采用图论的方法,目标优化问题可以被分解为有限个子问题,而每个子问题可以表示成一个线性规划问题,分别求解这些子问题从而得到目标问题的解,并从理论上证明了该解的全局最优性.该算法需要遍历所有可行的场景,具有O(2n)的计算复杂度.同时提出了一种次优算法,以很小的性能下降为代价获得了O(n)的计算复杂度.仿真实验结果显示,在9个节点的网络中,次优算法得到的网络吞吐量与最优算法相比下降不超过8%,而计算速度有显著提高.The optimization problem of maximizing the throughput of a regular multi-radio, multi-channel wireless mesh network was addressed. Given certain network topology and traffic demands, by jointly considering the power control, channel assignment and scheduling, this work studied how to maximize the network throughput under fairness constraint. Based on graph theory, the problem was divided into several sub-problems, which could be formulated as linear programming. It was proved that the solutions of these sub-problems will lead to the global optimal solution. However, the computational complexity of the above algorithm was O(2^n) as it needed to traverse all possible scenarios. A suboptimal algorithm was proposed to achieve a complexity of O(n) at the cost of moderate performance degradation. Simulation showed that the suboptimal algorithm solved the problem much faster, while the performance degradation was less than 8%, in comparison with the optimal one.
关 键 词:无线MESH网络 功率控制 信道分配 调度 联合优化
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15