无线Mesh网中QoS流量均衡策略研究

由于现有的无线Mesh网路由研究多寻求当前时刻的最优路径,缺少流量均衡机制,影响了网络资源的使用效益。针对这一问题,提出基于QoS的流量均衡策略。通过研究蚁群算法,重新定义启发信息和信息素更新规则,将节点和链路负载加入到路径选择的权衡因素中;同时,考虑到Mesh节点到骨干网的通信,提出针对网关节点的流量均衡机制。改进算法以业务QoS要求作为约束条件,使路径规划倾向于负载度低的链路和节点,为后续业务的路由选择提供良好的网络环境。实验结果表明,随着数据量的增多,该算法始终可以保证业务QoS,实现了严格的QoS约束,并且能有效提高链路利用率,在路由质量方面优于中心节点法和改进信息素法。     

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

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

一种基于P2P技术的无线mesh网路由协议

无线Mesh网是一种新型的无线组网形式,网络中包含两类节点:组成无线mesh网骨干的mesh路由器和通过mesh路由器接入网络的mesh客户端.由于mesh路由器和mesh客户端在功能和性能上存在较大差异,使无线mesh网成为一种复杂的异构网络,现有的无线路由协议不能在这一网络结构上直接适用.针对无线mesh网的结构特点提出了一种大型无线mesh网络下的路由协议,采用基于P2P的分层结构实现网络节点信息的自动注册、快速查询和路由转发,同时网络具有较好的负载均衡和抗毁性能.仿真结果表明,与传统的分层路由协议相比,该方案可以得到更优的移动路由.     

无线Mesh网络中基于奖励机制的均衡传输方案

针对无线Mesh网络存在自私节点而造成的双向流量的均衡问题,提出了一种基于奖励机制的均衡传输方案。首先,推导出了每个传输访问点(TAP)的双向目标吞吐量。然后,提出一种奖励机制,通过信用币和代币支付策略来鼓励闲置TAP转发数据,同时使网关尽可能均衡地向TAP传输下行数据。在一个具有3个TAP的无线Mesh网络上仿真结果表明,该方法能够在存在自私节点情况下确保双向流量的均衡。     

无线Mesh网络路由器的体系结构研究

多网卡多信道技术是当前无线Mesh网络中的研究热点。利用多网卡多信道的技术可以大大提高网络的整体性能,但采用多网卡多信道技术的无线Mesh网络存在容易受到来自网络内部的自身干扰等问题。文章设计了一种无线Mesh网络的路由器体系结构,解决了两个关键领域的问题:第一,给出了能够使用一般硬件实现分离无线路由器(Separated Wireless Router,简称SWR)的架构;第二,设计了一个集中式的信道分配算法,这个算法考虑了信道分配和路由的相互影响,从而能使网络达到最大吞吐量。     

无线Mesh网络模型研究与仿真

研究网络通信能耗优化问题,由于网络流量大,节点能量不均衡.为了能够有效地降低能量消耗,提出了一种混合智能算法的无线Mesh网络模型.模型首先给出了通信流自相似的基本概念和相应的数学模型;其次结合蚁群算法可以获得最短路径的优点以及遗传算法可以使簇内节点能量均衡的优点进行无线Mesh网络的性能优化仿真,并且给出了算法流程;最后对无线Mesh网络模型的通信流特性进行了仿真分析.仿真结果表明,利用混合智能算法能够更好地描网络通信流特性,有效的降低网络的能量消耗,延长网络的寿命.     

基于忙音多址的多信道无线Mesh网的MAC协议

无线Mesh网(WMN)是一种新犁宽带无线接入技术,选择适当的MAC子层规范,根据网络业务特征有效地配置信道资源,可以提高Mesh网的无线资源使用效率以及系统传输性能.而现有的无线Mesh网络基本上是采用单信道MAC协议,不能满足日益俱增的用户需求,限制了整个网络的数据传输速率与网络容量.文中基于忙音多址访问的设计思想,结合无线Mesh网络的特点,提出了一种无线Mesh网MAC协议MCBTMA(Multi-Channel Busy Tone Multiple Access).MCBTMA通过构建多个忙信号控制信道和多个数据信道,在MAC层进行多信道调度,使无线Mesh网络在吞吐量和时延方面性能有显著提高.     

基于Grover搜索算法的整数分解

非结构化搜索是计算机科学中最基本的问题之一,而Grover量子搜索算法就是针对非结构化搜索问题设计的。Grover量子搜索算法可用于解决图着色、最短路径排序等问题,也可以有效破译密码系统。文中提出基于Grover搜索算法并结合经典预处理实现整数分解。首先基于IBMQ云平台对不同量子比特的Grover算法量子电路进行了仿真,以及模拟使用Grover算法求解N的素因子P和Q;然后将化简后的方程转化为布尔逻辑关系,以此来构建Grover算法中的Oracle;最后通过改变迭代次数来改变搜索到解的概率。仿真结果验证了使用Grover算法求解素因子P和Q的可行性。文中实现了在搜索空间为16且一次G迭代条件下以近78%的成功概率搜索到目标项。文中还比较了Grover算法与Shor算法在求解一些数字时所耗费的量子比特数和时间渐近复杂度的差异。通过Grover量子搜索算法分解整数的实验拓展了该算法的应用领域,Grover算法的加速效果在大型搜索问题中尤为明显。     

基于CPK的分布式Mesh网络认证

通过对现有的无线网络安全认证机制的研究,以及这些机制在无线Mesh网络适应性方面的分析,针对Mesh网络分布式特点以及无线Mesh路由器无线连接能力有限的特殊性,提出了一种基于CPK算法的分布式Mesh网络认证解决方案,实现了分布式Mesh网络认证。     

Mesh网络中实用有效的多信道分配方法

多信道多接口可以明显提高Mesh网络的吞吐量,然而已有的多信道分配算法和协议基本上都没有考虑无线信道的隔离度,这样便造成了路径间干扰。提出了一种基于信道隔离度的启发式多信道分配算法（CSCA）,有效地减少了路径间干扰。所构建的森林拓扑一方面方便了信道分配,另一方面也改善了流量均衡。模拟实验结果表明,CSCA算法有效地降低了Mesh网络中的干扰,提高了网络吞吐量。     

A hierarchical architecture for detecting selfish behaviour in community wireless mesh networks

Wireless mesh networks (WMNs) consist of dedicated nodes called mesh routers which relay the traffic generated by mesh clients over multi-hop paths. In a community WMN, all mesh routers may not be managed by an Internet Service Provider (ISP). Limited capacity of wireless channels and lack of a single trusted authority in such networks can motivate mesh routers to behave selfishly by dropping relay traffic in order to provide a higher throughput to their own users. Existing solutions for stimulating cooperation in multi-hop networks use promiscuous monitoring or exchange probe packets to detect selfish nodes and apply virtual currency mechanism to compensate the cooperating nodes. These schemes fail to operate well when applied to WMNs which have a multi-radio environment with a relatively static topology. In this paper we, propose architecture for a community WMN which can detect selfish behaviour in the network and enforce cooperation among mesh routers. The architecture adopts a decentralized detection scheme by dividing the mesh routers into manageable clusters. Monitoring agents hosted on managed mesh routers monitor the behaviour of mesh routers in their cluster by collecting periodic reports and sending them to the sink agents hosted at the mesh gateways. To make the detection more accurate we consider the quality of wireless links. We present experimental results that evaluate the performance of our scheme.     

Design and implementation of MobiSEC: A complete security architecture for wireless mesh networks

Wireless mesh networks (WMNs) have emerged recently as a technology for next-generation wireless networking. They consist of mesh routers and clients, where mesh routers are almost static and form the backbone of WMNs. WMNs provide network access for both mesh and conventional clients.In this paper we propose MobiSEC, a complete security architecture that provides both access control for mesh users and routers as well as a key distribution scheme that supports layer-2 encryption to ensure security and data confidentiality of all communications that occur in the WMN.MobiSEC extends the IEEE 802.11i standard exploiting the routing capabilities of mesh routers; after connecting to the access network as generic wireless clients, new mesh routers authenticate to a central server and obtain a temporary key that is used both to prove their credentials to neighbor nodes and to encrypt all the traffic transmitted on the wireless backbone links.A key feature in the design of MobiSEC is its independence from the underlying wireless technology used by network nodes to form the backbone. Furthermore, MobiSEC allows seamless mobility of both mesh clients and routers.MobiSEC has been implemented and integrated in MobiMESH, a WMN implementation that provides a complete framework for testing and analyzing the behavior of a mesh network in real-life environments. Moreover, extensive simulations have been performed in large-scale network scenarios using Network Simulator.Numerical results show that our proposed architecture considerably increases the WMN security, with a negligible impact on the network performance, thus representing an effective solution for wireless mesh networking.     

Genetic algorithm-based optimisation of load-balanced routing for AMI with wireless mesh networks

The advanced metering infrastructure (AMI) in a smart grid contains hardware, software, and other electronic components connected through a communication infrastructure. AMI transfers meter-reading data between a group of smart meters and a utility centre. Herein, a wireless mesh network (WMN) with a random mesh topology is used to deploy the AMI communication network. In a WMN, paths are identified using a hybrid wireless mesh routing protocol (HWMP) with a load balancing feature called load aware-HWMP (LA-HWMP). These paths reduce the demand on links with a minimal air time metric; however, the delay in the data transmission of certain smart meters is high, given the large number of retransmissions caused by packet drop. To avert this problem and enhance the end-to-end delay, a genetic algorithm is applied on the LA-HWMP to obtain the optimal path. The optimisation process will result in the selection of paths with minimal delay. The genetic algorithm is developed with a rank-based selection, a two-point crossover, and a random reset mutation with a repair function to eliminate duplicate entries. The proposed method is compared with the HWMP, the LA-HWMP, and a state-of-the-art method that uses a combination of the ant colony algorithm and simulated annealing (ACA-SA) for AMI networks of different sizes. The obtained results show that the path identified by the proposed method yields a shorter delay and higher throughput than paths identified using the other methods.     

WMN中的干扰避免部分重叠信道分配算法

针对无线mesh网络(wireless mesh networks,WMN)中存在的信道干扰问题,提出一种基于部分重叠信道(partially overlapping channels,POC)的负载平衡且干扰避免的信道分配算法。通过基于Huffman树的通信接口分配方法连接邻居节点的接口;根据网络干扰情况,对链路进行迭代信道分配,使用静态链路调度保证网络连接;利用启发式算法优先为重要程度较高的链路分配无干扰时隙,对链路调度进行优化。仿真结果表明,在具有混合流量的WMN中,所提算法可以显著提升网络吞吐量,降低网络干扰与平均丢包率,改善网络性能。     

Load-balanced mesh router migration for wireless mesh networks

Load-balancing among domains in a wireless mesh network (WMN) is normally achieved by changing the Internet attachment of mesh routers (MRs) that carry the traffic from mobile stations (MSs). The greediness of load-balancing algorithms may force MRs to frequently change their Internet attachments, and thus degrade network performance due to inter-domain mobility of the associated MSs. In this paper, we discuss the negative impact on the performance of MSs’ mobility, due to inter-domain reassignment of MR. A MR migration scheme is proposed to achieve a tradeoff between load-balancing and inter-domain reassignment of MR. The proposed load-balancing scheme for WMNs includes: an initialization procedure to divide a WMN into domains, and a load adjustment procedure to rebalance the traffic load among the neighboring domains when required. We also provide a framework for handling inter-domain mobility in support of multi-hop communication using the Multi-hop cellular IP. Our simulation results show that the proposed protocol effectively controls MR’s change in connectivity as well as MS’s mobility.     

On-demand channel reservation scheme for common traffic in wireless mesh networks

Wireless mesh networks (WMNs) have recently gained momentum as a new broadband internet access technology to provide internet traffic. These networks have unique characteristics that make them different from ad hoc networks. These differences are as follows. First, WMNs are composed of static mesh routers that are equipped with multiple radio interfaces and turn each interface into a non-overlapping channel. These additional interfaces can create multiple concurrent links between adjacent nodes. Second, most of the traffic in WMNs is directed towards the gateway. Third, both local traffic and internet traffic are relayed by the mesh router to indeed destination. The Multi-Radio Ad hoc On-Demand Distance Vector (AODV-MR) developed to support multi-radio and does not take into account above-mentioned WMNs characteristics. In this paper, we propose an on-demand channel reservation scheme to reserve some of mesh router radio interfaces to support the gateway traffic while the remaining interfaces can be used to support the local traffic. Our scheme establishes high throughput paths for the traffic destined at the gateway, reduces the intra-flow and inter-flow interferences as well as to support full duplex node transmission.The scheme allows the gateway to assign a list of channels for each received gateway routing discovery message. Simulation results show that our proposed scheme significantly improves the performance of multi-radio multi-channel wireless mesh networks.     

骨干无线网状网的排队延迟性能研究

对一种基于网状分布的骨干无线网状网的延迟性能进行研究.提出了一种基于均衡负载的最短路径路由协议.在此协议基础上,研究了无线网状网数据包的排队延迟,推导出无线网状网排队延迟与网络的规模、网关和网状路由器的服务能力、数据包到达率的相互关系.此外,还分析排队延迟和网络容量的相互制约关系,并给出了在延迟限制条件下的网络容量.     

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.     

Joint scheduling and routing algorithm with load balancing in wireless mesh network

Wireless mesh network (WMN) is a promising solution for last mile broadband internet access. Mesh nodes or mesh routers are connected via wireless links to form a multi-hop backbone infrastructure and improving throughput is the primary goal. While previous works mainly focused on either link level protocol design or complex mathematical model, in this paper, we investigate the performance gains from jointly optimizing scheduling and routing in a multi-radio, multi-channel and multi-hop wireless mesh network. Then, two optimization objectives are addressed by considering wireless media contention and spatial multiplexing. The first objective is to maximize throughput by exploiting spatial reuse while the second one is to ensure fairness among different links. We design a cross-layer algorithm by considering both MAC layer and network layer. Simulation results show that our joint optimization algorithm can significantly increase throughput as well as fairness.