检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杜维[1] 罗海燕[1] 张朝阳[1] 赵志峰[1]
机构地区:[1]浙江大学信息与通信工程研究所,浙江杭州310027
出 处:《浙江大学学报(工学版)》2009年第4期615-620,共6页Journal of Zhejiang University:Engineering Science
基 金:国家自然科学基金资助项目(60572115);国家"863"高技术研究发展计划资助项目(2007AA01Z257);浙江省自然科学基金资助项目(Z104252)
摘 要:研究了多信道多接口无线二维随机Mesh网络容量的联合优化问题.在用户流量比例公平的条件下,分析了路由、动态信道分配和调度算法的约束模型,把网络容量的联合优化建模为线性规划(LP)问题.基于该模型提出了容量的上、下界低复杂度计算方法,仿真计算了25个结点的二维随机网络在不同信道数、接口数和网关数约束下容量的上下界,所得下界至少为上界的85%.同时根据容量计算的结果分析了网络容量随上述诸因素变化的规律,表明一个接口可以有效利用多个信道,网关带来的容量边际效应越来越小.The joint optimization problem of maximizing throughput of multi-interface multi-channel random mesh network was addressed. The problem was formulated into a linear programming (LP) problem by analyzing the constraint models of routing, channel assignment and scheduling on the premise of proportional fairness. Low complexity algorithms were further proposed to derive lower and upper capacity bounds. Simulation results show that the lower/upper bound ratios were all above 85% under different number of available channels, interfaces and gateways in a 25-node random network. Then capacity laws with respect to all the factors were further studied. One interface can utilize several channels and edge effect on capacity grows less as gateway number grows.
分 类 号:TN915.6[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171