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

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

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

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

基于Jelger算法的多因素网关选择算法

针对移动自组织网络（mobile Ad hoc network,MANET）与Internet互联时的网关选择问题,提出一种基于Jelger算法的多因素网关选择算法来进行网关选择和切换。该算法综合考虑跳数、网关效益、通信成本等约束对网关选择的影响,在此基础上构建目标函数,引入网关选择度量——网关可用度（GUD）来完成网关的选择和切换。仿真结果表明,该算法能够有效改善Jelger算法引起的网关频繁切换问题和负载不均衡问题,减少网关切换次数,降低了传输时延和网络负载,提高了网络性能。     

有导向变异算子的无线Mesh网负载均衡算法研究*

为了提高无线Mesh网络(WMN)的传输性能,提出基于有导向变异算子的进化算法GM-EA(guidedmutation EA)来优化WMN网关负载均衡问题。在已有的WMN负载均衡算法基础上,GM-EA算法通过结合粒子群优化的方法,更好地利用种群中的全局信息,在较少迭代次数下可以达到网关数量和负载均衡两方面的优化。仿真实验表明,GM-EA算法以增加执行时间为代价下得到的网关数量与比其他算法得到的结果更优;在网关负载均衡方面,该算法也取得较好的结果。     

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

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

基于负载均衡的移动自组网接入技术研究

在移动自组网（MANET）与Internet互联的网络结构中,针对传统单网关接入的不足,提出一种基于多网关负载均衡的非对称接入技术。该技术由网关发现、网关注册和数据传输三个步骤实现。进行了NS2软件仿真实验,结果表明,该接入算法在网络重负荷的情况下能有效地均衡网络中MANET节点与网关节点的负载,有效延长网络寿命。     

MANET接入Internet模型的设计与仿真实现

在MANET接入Internet网络中,静态网关提供接入的范围有限,动态网关提供接入的性能不稳定,因此提出动态网关和静态网关协作的MANET接入Internet模型.在此基础上,设计了一种基于该模型的负载均衡路由算法.仿真结果表明,该模型可以提供比较稳定的MANET接入Internet性能,负载均衡算法能够有效提高分组投递率,降低平均传输延迟,减少路由开销以及改善MANET接入Internet网络的整体性能.     

Wireless HART负载均衡方法研究

无线HART网络是同类无线网络中网络稳定性和健壮性最好的网络之一,负载均衡的网络可以有效的提高传感器网络的生存周期,本文针对Wireless HART的mesh网络结构提出一种以节点负载为中心的负载均衡因子,并在此基础上提出一种通过在无线网络拓扑图中构造负载均衡树的方法来改进网络负载均衡的算法。最后通过实验仿真比较发现新算法是一种更有效的均衡策略。     

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

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

基于负载均衡的WSN非均匀分簇算法

针对分簇的无线传感器网络(WSN)中负载不均衡问题,提出一种实现节点负载均衡的WSN非均匀分簇算法。引入非均匀簇机制计算出最优的网络分簇数量,通过调整节点的簇首归属来控制网络的分簇的大小,形成合理的网络拓扑结构。仿真实验结果证明,该算法能有效均衡网络的节点负载,降低节点能耗,延长网络的生存时间。     

Fuzzy Fruit Fly Optimized Node Quality-Based Clustering Algorithm for Network Load Balancing

Recently, the fundamental problem with Hybrid Mobile Ad-hoc Networks (H-MANETs) is to find a suitable and secure way of balancing the load through Internet gateways. Moreover, the selection of the gateway and overload of the network results in packet loss and Delay (DL). For optimal performance, it is important to load balance between different gateways. As a result, a stable load balancing procedure is implemented, which selects gateways based on Fuzzy Logic (FL) and increases the efficiency of the network. In this case, since gateways are selected based on the number of nodes, the Energy Consumption (EC) was high. This paper presents a novel Node Quality-based Clustering Algorithm (NQCA) based on Fuzzy-Genetic for Cluster Head and Gateway Selection (FGCHGS). This algorithm combines NQCA with the Improved Weighted Clustering Algorithm (IWCA). The NQCA algorithm divides the network into clusters based upon node priority, transmission range, and neighbour fidelity. In addition, the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC, packet loss rate (PLR), etc.     

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...     

A MANET accessing Internet routing algorithm based on dynamic gateway adaptive selection

Based on the study on communication situation of mobile ad hoc network (MANET) accessing Internet and taking the gateway important function of accessing network into account, a MANET accessing Internet routing algorithm based on dynamic gateway adaptive selection (MRBDAS) is presented. It considers candidate gateways’ connecting degree, load degree, residual energy, and movement rate synthetically and uses the idea of group decision-making method for reference. The algorithm employs the methods of multipaths and query localization technique based on old path information to maintain routing adaptively. Compared with the existing accessing routing algorithm based on dynamic gateway, the algorithm demonstrates in its simulations that by bringing dynamic gateways colony function, the MRBDAS can improve network throughput, reduce average transmission delay of data packets and routing overhead, and prolong accessing network life. The validity of MRBDAS has been proven.     

一种基于负载平衡树的多网关节点数据汇集路由算法

以均衡耗能为目标,考虑健壮性、可转发性和抗干扰性等因素,提出一种基于负载平衡树的多网关节点数据汇集路由算法(TBLB 算法).在多网关前提下,TBLB 算法结合节点能量和节点度形成以网关节点为根节点的负载平衡树,通过负载平衡树协调节点间的负载均衡,有效地降低节点的能量消耗.此外,节点根据路径性能评价因子W 进行路径选择和网关切换,进一步降低网络节点的通信开销,改善了网关节点的瓶颈问题.模拟实验结果表明,TBLB 算法能够有效均衡网络负载,对网络的能量消耗和网关节点接收到的数据包都有所改善.     

无线Mesh网络中基于最小权有限支配集的网关部署算法研究

无线Mesh网络中网关是网络性能的瓶颈,网关部署至关重要。本文对无线Mesh网络中网关QoS性能进行分析,提出基于最小权有限支配集,以部署费用为贪心策略的贪婪算法(Greedy_LDSC),该算法用贪心法提高了网关的性价比。同时,提出了基于最小权有限支配集改进的贪婪算法(Greedy_LDSI),以降低网关的部署费用。仿真实验表明,从网关性价比方面来看,Greedy_LDSC算法的网关性价比之和比基于最小权有限支配集的网关部署算法(GREEDY_LDS)要高;从网关部署费用方面来看,Greedy_LDSI算法的网关部署费用比GREEDY_LDS算法会低。     

A MANET accessing Internet routing algorithm based on dynamic gateway adaptive selection

Based on the study on communication situation of mobile ad hoc network (MANET) accessing Internet and taking the gateway important function of accessing network into account, a MANET accessing Internet routing algorithm based on dynamic gateway adaptive selection (MRBDAS) is presented. It considers candidate gateways’ connecting degree, load degree, residual energy, and movement rate synthetically and uses the idea of group decision-making method for reference. The algorithm employs the methods of multipaths and query localization technique based on old path information to maintain routing adaptively. Compared with the existing accessing routing algorithm based on dynamic gateway, the algorithm demonstrates in its simulations that by bringing dynamic gateways colony function, the MRBDAS can improve network throughput, reduce average transmission delay of data packets and routing overhead, and prolong accessing network life. The validity of MRBDAS has been proven.     

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.