WMN中基于传输成功率的网关部署算法

提出无线Mesh网络中基于传输成功率的网关部署算法——GA_TSR。在保证端到端成功率的基础上,利用贪婪策略部署网关,将网络分成互不相交的簇,每个簇满足一定的QoS保证。调整簇的边缘节点,优化网络传输的平均成功率。仿真实验表明,采用GA_TSR算法得到的网关数目与其他算法相比区别不大,但可提高10%~56%的网络传输平均成功率。     

干扰约束和负载均衡的无线Mesh网络网关部署策略

网关部署是无线Mesh网络规划面临的重要挑战之一.在Mesh路由器(MR)已完成部署的前提下,如何计算同时满足网络性能要求和用户流量需求的最小网关(GW)集合,已经被证明是一个NP-hard问题.文中提出了一种满足干扰约束和支持负载均衡的网关部署策略ICLB-GPS,在部署网关时消减链路干扰并实现网关负载均衡.ICLB-GPS策略综合网关选择、转发树构建和转发树间的节点迁移来完成负载均衡的网关部署,主要包含覆盖重叠和干扰消减的网关选择、基于树间节点迁移的网关负载均衡两个算法.仿真实验将ICLB-GPS算法与其它算法在网关数量、MR-GW路径长度、链路干扰程度及负载均衡指数方面进行比较,其结果表明该算法在不增加部署成本,不提高MR-GW路径长度的情况下,消减了链路干扰,实现了网关负载均衡.     

基于PSO的无线Mesh网关优化部署算法

无线Mesh网关的优化部署目标是对一给定的无线Mesh网络,合理地确定网关部署的方案,在满足用户通信时延、通信带宽以及网关相关属性约束(如网关的度,簇度数)的前提下,使得网关数量最少、网关间负载均衡以及总体通信代价最小。利用粒子群算法在多目标寻优方面的优势,提出了基于粒子群的无线Mesh网关优化部署算法。对粒子的速度、速度的相关运算规则和粒子的运动方程进行了重新定义与设计,然后提出了基于网关启发式初步部署与优化的二阶段粒子群优化算法。理论分析与仿真实验表明,基于PSO的优化算法得到的网关数量不劣于其它算法得到的结果,而且在其它性能指标方面:通信代价、网关节点数量、负载均衡方面优势明显,与Recursive_DS算法的相比分别提高了38.15%,7.85%和7.3%。     

无线网状网中面向负载均衡的网关部署算法

综合考虑网关数量和网关负载均衡两方面因素,提出一种基于力的贪婪启发式分簇算法,在此基础上对杂交粒子群优化进行改进,给出一种适用于无线网状网的网关部署算法。仿真实验结果表明,该算法能以较少的网关数量实现网络负载均衡,从而提高吞吐量,改善网络性能。     

基于多网关的无线Mesh网络负载均衡调度算法

网关节点的效率决定了无线Mesh网络(WMN)的传输性能,如何有效地解决WMN网关负载均衡问题是非常重要的.在已有的WMN负载均衡算法基础上,提出一种新的基于多网关协作机制的WMN负载均衡调度算法.该算法以源节点到网关节点的跳数信息和网络负载信息相结合作为网关的选择和切换标准,通过多个网关的协作机制,结合高效的网关选取和调度算法实时地对网关业务进行分流;通过一种快速平滑的网关切换方式对其进行调度,从而有效地缓解拥塞网关节点的负载压力,提高WMN的Internet接入性能.性能分析结果表明:该算法可在多个网关间直接实现负载均衡,减少了网络拥塞,提高了网络性能.     

基于流量模式和网络拓扑的网关部署算法

多并发流所引起的网络负载不均衡是无线网状网(wireless Mesh network,WMN)面临的一个挑战,部署网关是一种能缓解竞争节点负载的可行方案.针对这一问题,提出基于流量模式和网络拓扑的启发式网关部署算法.该算法利用节点在多种流量模式下所承载流量的平均值来估算节点的网络负载,并基于节点的网络负载和位置来选择网关,再根据特定的计算,分配节点给已知网关所管理的簇.实验结果表明,在不同流量模式和网络资源配置下,该算法均能有效地提高网络吞吐量、降低端到端延迟、减少路径长度.     

传感器网络中高效的最小连通支配集求解算法

在无线传感器网络中,连通支配集被广泛应用于构建虚拟主干。由于求解最小连通支配集是一个NP难问题,许多近似算法被提出用于构建可用的最小连通支配集。针对当前近似算法存在的不足,我们提出了一个新的分布式近似构造算法—CDS-HG,该算法用层次图对无线传感器网络进行建模,算法用基于竞争的贪心策略从每一层选出最少的节点去支配下一层的所有节点。理论分析和模拟结果表明,CDS-HG算法产生的连通支配集是目前最小,并且其消息复杂度也是目前最低的。     

无线Mesh网络中满足带宽需求的路由器部署方法

无线Mesh网络是移动互联网的一种重要接入方式,如何合理、高效地部署Mesh路由器(Mesh Router,MR),从而以较低的部署成本获得较好的网络性能,是当前的研究热点.文中首先给出一种分层的部署场景模型及相关假设,并在此基础上利用混合整数线性规划方法对MR部署问题进行形式化描述;然后提出一种基于网络流的MR部署贪心算法NF Greedy,该算法以迭代的方式从MR候选位置集中选择权重最大的节点进行相应的节点部署,其中节点权重定义为当前网络可满足的最大用户带宽需求的平均增量,可利用网络流方法进行求解;最后通过一系列仿真实验将NF Greedy算法与现有算法进行对比,实验结果表明该算法与基于MILP的算法相比,虽然所部署的MR数量略多,但是能适用于较大规模的WMN;而与启发式的ILSearch算法相比,则大大减少了所部署MR的数量.     

智慧城市中无线网络节点部署优化方案研究

智慧城市无线网络基础设施中,网络节点部署直接影响到网络服务质量.该问题可归结为在给定的几何平面上部署合适的普通AP节点作为无线终端的访问节点,部署特殊节点作为网关以汇聚普通节点的流量到有线网络中.以无线Mesh网络为例,提出根据区域人流量的统计来确定AP节点的部署位置和数量,将网关节点部署问题抽象为几何K-中心问题.以节点和网关之间路径长度最小为优化目标,提出自适应的粒子群算法来求解网关节点部署位置.在自适应粒子群算法中引入随机调整惯性权重、自适应改变学习因子和邻域搜索等改进策略,并设计一种新的适值函数计算方法,使得算法更容易获得最优解.仿真结果表明,相对于GA算法和K-means算法,改进粒子群算法求解效果稳定,鲁棒性强,可获得更小的覆盖半径,从而提高网络的服务质量.     

一种适用于单向ad-hoc网络的连通支配集算法

在ad-hoc网络中,基于最小连通支配集(minimum connected dominating set-MCDS)的路由方法是一种有效的分层路由方法,它将路由搜索主要集中在连通支配集内.但目前提出的支配集算法大都是基于双向链路的,在网络中出现单向链路时无法正常工作.对此,本文重新定义了支配集概念,提出了一种适用于单向ad-hoc网络的最小连通支配集近似算法(UL-WMCDS),并给出了它的正确性.仿真表明,随着节点数目的增加和传输半径的增大,连通支配集所占的比例都逐渐减小.     

Cost-Sensitive and Load-Balancing Gateway Placement in Wireless Mesh Networks with QoS Constraints

In wireless mesh networks(WMNs),gateway placement is the key to network performance,QoS and construction cost.This paper focuses on the optimization of the cost and load balance in the gateway placement strategy,ensuring the QoS requirements.Firstly,we define a metric for load balance on the gateways,and address the minimum cost and load balancing gateway placement problem.Secondly,we propose two algorithms for gateway placement.One is a heuristic algorithm,which is sensitive to the cost,selects the gate...     

Survivable and delay-guaranteed backbone wireless mesh network design

Backbone wireless mesh networks (BWMNs) consisting of wireless mesh routers are emerging alternatives to implementations of metropolitan area networks (MANs). In a BWMN, gateways connect to the Internet via wireline links and provide Internet access services for users. Due to the limited wireless channel bit rate, multiple gateways are usually required in a BWMN, which costs budget and takes time to set up. In this paper, we study the network topology design and the gateway arrangement so that the construction cost of a BWMN is minimal. Two algorithms, namely, the Predefined Gateway Set Algorithm (PGSA) and the Self-Constituted Gateway Algorithm (SCGA), are proposed for the BWMN design. A genetic algorithm and a proposed enhanced Djikstra's algorithm are employed to search for the low-cost network configuration with constraints such as survivability, link capacity, degree limitation and maximum tolerable delay. Computational results show that the PGSA can give an acceptable network configuration rapidly. In case the gateway cost is high, using the SCGA can lower the network construction cost at the expense of more computational time.     

CSCW的可扩展自组网通信环境的研究

简要分析了CSCW和自组网的关系，讨论了使用成簇方法的自组网体系结构，提出了现有成簇方法的缺点．因为现有的成簇方法未考虑网关选举问题．造成了两个簇首之间的多个冗余网关的存在．该设计提出并．实现了一个分布的网关选举策略，每两个相邻簇对之间仅仅需要一个网关．为了保持网关节点的稳定性，使网关节点保持更长的生存时间，网关选举采用节点最大权原则．仿真结果表明，该方法可以有效的减少包转发数量．有助于减少维持拓扑信息的复杂度．通过限制重播节点为簇首和网关的机制，取得了比洪泛更好的可扩展性．     

A Duty Cycle-Based Gateway Selection Algorithm for LoRaWAN Downlink Communication

Long Range Wide Area Network (LoRaWAN) has been developed to meet the requirements for the enormous device-to-device communication of Internet of Things (IoT) networks, which consist of a large number of participating devices spread over large coverage areas with low data rates and low power consumption. It supports communications in both directions, uplink, and downlink directions. However, the downlink communication in the current LoRaWAN raises the bottleneck issue at gateways due to the used gateway selection algorithm. This paper proposes a novel gateway selection algorithm based on the duty cycle time-off values for the existing gateways, Duty Cycle Gateway Selection (DCGS), to direct acknowledgment packets as downlink traffic towards the most suitable gateway. Thus, the proposed system avoids subsequent retransmission of previously sent traffic that leads to excessive traffic overloading the network. The proposed system avoids exhausting a gateway duty cycle with downlink traffic by distributing the downlink traffic among available gateways based on the duty cycle time off. DCGS is evaluated using FloRa and INET frameworks in the well-known network simulator OMNeT++. The result shows the superior performance of the proposed approach over the existing Signal-to-Noise ratio (SNR) based selection mechanism. It clearly indicates that the DCGS maintains a better confirmed packet delivery rate while reducing number of retransmissions, collisions, and power consumption.     

基于Modbus协议的无线传感器网络网关设计

针对异构网络通信协议的融合问题,设计了一种无线传感器网络网关.网关通过Wi-Fi接入公共网络,采用ZigBee、蓝牙、Wi-Fi三种无线通信技术组建感知网络,以实现用户远程访问和控制传感器网络节点的功能.提出以Modbus协议规范作为不同类型网络间应用层协议转换的统一标准,屏蔽了异构网络通信协议数据格式的差异,改善了网关的可扩展性.在以ARM处理器为核心的硬件平台上,运用嵌入式编程实现网关功能.经测试,无线传感器网络网关运行稳定高效,满足多数应用场合的实时性要求.     

利用多路无线传输的并行网关系统

随着移动设备的快速发展,工业应用对无线网络的速度与质量要求越来越高.然而目前无线网络的发展速度缓慢,远远没有满足实际需求.因此针对无线网络传输速度与质量的瓶颈问题,本文提出一种利用多路无线传输的并行网关系统.该系统利用一对并行网关建立多路无线连接,实现以太网帧数据的并行传输,以此提高无线网络的传输速度.并且并行网关之间使用UDT传输协议进行数据传输,以此提高数据的传输质量.     

Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms

In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gateways or intermediate mesh routers may rapidly get overloaded, and the network resources can be unevenly utilized. To address this problem, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations, as well as average end-to-end delay, in heterogeneous WMNs. Guided by our analysis, we design a Capacity-Aware Route Selection algorithm (CARS), which allocates network paths to downstream and upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ fixed connections. Through simulations in a number of different network scenarios we show that the CARS scheme significantly outperforms conventional shortest path routing, as well as an alternative routing method that distributes the traffic load on the gateway nodes to minimize its variance.