检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学信息科学与工程学院,长沙410075
出 处:《计算机工程与应用》2010年第16期94-98,共5页Computer Engineering and Applications
摘 要:无线mesh网中的流量经路由器聚集后主要是通过少量网关至因特网的,容易在网关处形成导致网络性能的瓶颈。针对此问题,首先对网关和路由器作等效节点化处理,利用无线通信阴影效应的对数-正态分布模型,设计加权目标函数保证节点的连通性和覆盖率,得到候选网关节点的位置部署;在此基础上根据网关部署的约束条件和网络生成连通图,设计启发性基于度/权值的树集分割(TSP)算法,选择出满足吞吐需求、有较好连通性的候选节点担任网关设置。NS2仿真结果验证了该设计方法对改善网关节点的吞吐容量和信号覆盖连通率的有效性。In a wireless mesh network,the traffic is aggregated at mesh router and forwarded towards the Internet through IGW(Internet gateway),thus easily leads to a bottleneck for network performance at IGW.Aiming at this problem,this paper firstly treats the IGW and mesh router as the alike node equivalently,then uses the logarithm-normal distribution model of shadow affect in wireless communication to design a weighted objective function for guaranteeing node's connectivity and coverage,attains the deployment location of the candidate IGW;Based on the generated connectivity graph of the network and the constraints of the gateway deployment,this paper considers a heuristic TSP(Tree-Set Partition) algorithm based on degree/weight to get a good choice of nodes with high throughput and better connectivity act as IGW configuration.In conclusion,the paper validates the ideas and achieves a certain optimization effect under NS2 simulation.
关 键 词:无线MESH网 网关部署 目标函数 树集分割(TSP)算法
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117