叠加调制下资源分配的自适应算法

为了对抗无线通信网络中无线信道多径衰落的影响,提高系统的性能,采用了叠加调制方式的协同分集技术,并根据信道的时变特性,提出了功率/带宽的联合优化的自适应算法.分析了叠加调制(superposition modulation)协同方式的实现方法,将该协同方式与传统协同通信方式行了比较.推导出了叠加调制方式下的信道容量,以最大化信道容量为目标计算出节点发送信号的功率以及带宽.仿真结果表明,对叠加调制的协同方式下的资源分配的自适应算法可以有效地提高系统容量.     

基于无线Mesh技术的宽带无线接入网络

无线Mesh网络（WMN,Wireless Mesh Network）是一种新型的宽带无线网络,是大容量、高速率的分布式网络,支持宽带高速多媒体业务服务。随着网络多媒体、视频会议等对实时性要求较高业务的普及,人们对接入网络的带宽以及实时性要求日渐提高。文章就无线Mesh网络技术进行讨论．简述无线Mesh网络的基本特点,网络构成,特点及优势,重点分析了基于无线Mesh技术的宽带无线接入网络在现实生活中的典型应用。     

无线自组织网络中基于QoS保障准则的可用带宽估计

对无线自组织网络中可用带宽估计问题进行了研究,提出了在估计过程中必须将全局服务质量（QoS）保障作为可用带宽的估计准则。建立了无线自组织网络中非饱和条件下异构的分析模型,该模型能将业务流的QoS度量映射为网络参数,在此基础上设计了能提供QoS保障的可用带宽估计算法。本文所提出的估计算法将包括时延、丢包率与吞吐量在内的QoS需求不被破坏作为可用带宽估计的约束条件,克服了现有的工作将无约束的最大可达吞吐量作为可用带宽因而导致业务的QoS可能受到影响这一缺陷,从而使得估计结果更加合理与准确。仿真实验证明了分析模型与可用带宽估计算法的准确性。      

基于无线Mesh网络的视频传感器节点研究与设计

视频信息传输对救灾、应急通信和特殊区域监控有着重要意义,网络的适应性和带宽问题是限制视频监控系统发展的重要因素.无线Mesh网络具有带宽高、易组网等优点,能够提供实时的视频传输服务.首先完成对基于Mesh网络的视频监控系统整体架构设计,通过实验仿真的方法对比几种常用的Mesh网络路由协议性能,根据仿真结果和应用需求,选择AODV作为路由协议方案.然后在DM365硬件平台和嵌入式Linux操作系统平台之上完成视频传感器节点设计.最后对无线Mesh网络多跳带宽性能进行测试,测试结果表明系统可以满足应用需求.     

移动自组织网络可用带宽估计方法研究进展

首先分析了有线网络和无线网络带宽估计机制的区别,然后,在此基础卜给出了MANET可用带宽定义,并且从原理上分析了数据帧碰撞概率、回退时间以及信道空闲比例等对MANET中的可用带宽造成影响的因素,同时对各种参数的测量以及估计方法进行了详细介绍,最后展望了带宽估计的应用前景和研究趋势.     

无线Mesh网络的新型建模方法研究

对无线Mesh网络准确建模是开展Mesh网络各项研究的基础,基于传统802.11协议模型来分析Mesh网络性能会导致较大的偏差。提出了一种适用于无线Mesh网络的新型模型用以计算网络饱和状态下性能参数的理论值,如丢包率、节点发送概率等,性能分析和仿真结果表明,该方法更能精确地评估无线Mesh网性能。同时在此基础上给出了路由判据ETX理论值的计算方法,该方法可用来预测ETX值而无需实测,从而有效的减少了测量误差和带宽消耗。     

无线Mesh网络网关负载均衡研究综述

无线Mesh网络是无线局域网和移动自组织网络相结合的产物,作为一种能够提供高带宽网络接入服务的全新架构的网络,无线Mesh网络目前越来越多的得到人们的重视。本文对近年来Mesh网络网关节点负载均衡的研究方向进行了归纳总结,并提出了自己的设想和方向。     

一种基于跨层的无线Mesh网络路由协议

无线Mesh网络的很多技术特点和优势来自于Mesh多跳路由.因此,路由协议的研究与设计是无线Mesh网络技术的一个重要课题.由于无线Mesh网络有自身负载均衡、路由容错与网络容量等要求,因此运用跨层设计,采用更好的路由参数,使用多径路由等方法已经成为无线Mesh网络路由协议设计的重要思路.根据无线Mesh的网络特点,按照其路由协议的设计要求,分析了路由协议DSR在Mesh网络中的不足,引入跨层设计的方法,提出了采用路由质量路径帧投递率(PFDR)为路由准则,并具有负载平衡、拥塞避免的路由协议CMRP.分析和仿真结果表明,CMRP在保持Mesh网络自身优点的同时,比起DSR在网络性能上有了较大的提升,在吞吐率方面有了很大的提高,相应的时延、抖动参数均有了大幅的下降,更加适用于无线Mesh网络.     

无线Mesh网络网关负载均衡研究综述

无线Mesh网络是无线局域网和移动自组织网络相结合的产物，作为一种能够提供高带宽网络接入服务的全新架构的网络，无线Mesh网络目前越来越多的得到人们的重视。本文对近年来Mesh网络网关节点负载均衡的研究方向进行了归纳总结，并提出了自己的设想和方向。     

无线Mesh网络中基于链路负载估算的拥塞控制策略

针对无线Mesh网络的网络特性,提出了一种基于链路负载估算的拥塞控制策略LLECC。LLECC算法计算有效链路带宽和链路负载估算确定RED算法中的调整因子,通过调整因子调整RED算法中的参数从而实现动态的对无线网络拥塞控制。详细讨论了LLECC算法的实现过程和相关参数的计算方法,通过仿真分析验证了该算法对无线Mesh网络性能的提高。     

EPTR: expected path throughput based routing protocol for wireless mesh network

For effective routing in wireless mesh networks, we proposed a routing metric, expected path throughput (EPT), and a routing protocol, expected path throughput routing protocol (EPTR), to maximize the network throughput. The routing metric EPT is based on the estimated available bandwidth of the routing path, considering the link quality, the inter- and intra-flow interference and the path length. To calculate the EPT of a routing path, we first calculate the expected bandwidth of the link and the clique, and then consider the decay caused by the path length. Based on EPT, a distributed routing protocol EPTR is proposed, aiming to balance the network load and maximize the network throughput. Extensive simulations are conducted to evaluate the performance of the proposed solution. The results show that the proposed EPTR can effectively balance the network load, achieve high network throughput, and out-perform the existing routing protocols with the routing metrics previously proposed for wireless mesh networks.     

Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions

Next-generation wireless mobile communications will be driven by converged networks that integrate disparate technologies and services. The wireless mesh network is envisaged to be one of the key components in the converged networks of the future, providing flexible high- bandwidth wireless backhaul over large geographical areas. While single radio mesh nodes operating on a single channel suffer from capacity constraints, equipping mesh routers with multiple radios using multiple nonoverlap- ping channels can significantly alleviate the capacity problem and increase the aggregate bandwidth available to the network. However, the assignment of channels to the radio interfaces poses significant challenges. The goal of channel assignment algorithms in multiradio mesh networks is to minimize interference while improving the aggregate network capacity and maintaining the connectivity of the network. In this article we examine the unique constraints of channel assignment in wireless mesh networks and identify the key factors governing assignment schemes, with particular reference to interference, traffic patterns, and multipath connectivity. After presenting a taxonomy of existing channel assignment algorithms for WMNs, we describe a new channel assignment scheme called MesTiC, which incorporates the mesh traffic pattern together with connectivity issues in order to minimize interference in multi- radio mesh networks.     

Unified routing protocol based on passive bandwidth measurement in heterogeneous WMNs

The past few years have witnessed a surge of wireless mesh networks (WMNs)‐based applications and heterogeneous WMNs are taking advantage of multiple radio interfaces to improve network performance. Although many routing protocols have been proposed for heterogeneous WMNs, most of them mainly relied on hierarchical or cluster techniques, which result in high routing overhead and performance degradation due to low utilization of wireless links. This is because only gateway nodes are aware of all the network resources. In contrast, a unified routing protocol (e.g., optimal link state routing (OLSR)), which treats the nodes and links equally, can avoid the performance bottleneck incurred by gateway nodes. However, OLSR has to pay the price for unification, that is, OLSR introduces a great amount of routing overhead for broadcasting routing message on every interface. In this paper, we propose unified routing protocol (URP), which is based on passive bandwidth measurement for heterogeneous WMNs. Firstly, we use the available bandwidth as a metric of the unification and propose a low‐cost passive available bandwidth estimation method to calculate expected transmission time that can capture the dynamics of wireless link more accurately. Secondly, based on the estimated available bandwidth, we propose a multipoint relays selection algorithm to achieve higher transmission ability and to help accelerate the routing message diffusion. Finally, instead of broadcasting routing message on all channels, nodes running URP transmit routing message on a set of selected high bandwidth channels. Results from extensive simulations show that URP helps improve the network throughput and to reduce the routing overhead compared with OLSR and hierarchical routing. Copyright © 2016 John Wiley & Sons, Ltd.     

Call admission control for wireless mesh network based on power interference modeling using directional antenna

Interference is a fundamental issue in wireless mesh networks (WMNs) and it seriously affects the network performance. In this paper we characterize the power interference in IEEE 802.11 CSMA/CA based wireless mesh networks using directional antennas. A model based centralized call admission control (CAC) scheme is proposed which uses physical collision constraints, and transmitter-side, receiver-side and when-idle protocol collision prevention constraints. The CAC assists to manage requests from users depending on the available bandwidth in the network: when a new virtual link establishment request from a user is accepted into the network, resources such as interface, bandwidth, transmission power and channel are allocated in the participating nodes and released once the session is completed. The proposed CAC is also able to contain the interference in the WMN by managing the transmission power of nodes.     

On Efficient Traffic Distribution for Disaster Area Communication Using Wireless Mesh Networks

In recent time, a great deal of research effort has been directed toward promptly facilitating post-disaster communication by using wireless mesh networks (WMNs). WMN technology has been considered to be effectively exploited for this purpose as it provides multi-hop communication through an access network comprising wireless mesh routers, which are connected to the Internet through gateways (GWs). One of the critical challenges in using WMNs for establishing disaster-recovery networks is the issue of distributing traffic among the users in a balanced manner in order to avoid congestion at the GWs. To overcome this issue, we envision a disaster zone WMN comprising a network management center. First, we thoroughly investigate the problem of traffic load balancing amongst the GWs in our considered disaster zone WMN. Then, we develop traffic load distribution techniques from two perspectives. Our proposal from the first perspective hinges upon a balanced distribution of the bandwidth to be allocated per user. On the other hand, our second perspective considers the dynamic (i.e., varying) bandwidth demands from the disaster zone users that requires a more practical and refined distribution of the available bandwidth by following an intelligent forecasting method. The effectiveness of our proposals is evaluated through computer-based simulations.     

一种多射频、多信道无线mesh网络的信道分配算法

宽带无线接入网得到广泛应用,廉价的数据回程带宽是决定宽带无线接入网成功应用的重要因素。丈中设计了一种使用多射频、多信道、方向性天线的新型无线mesh数据回程网,提出了一种基于连接图的等价变换来实现该无线mesh网络信道分配算法。仿真结果表明,文中提出的信道分配算法有效地减少链路间干扰,提高了网络性能。     

Estimating the channel capacity of multi-hop IEEE 802.11 wireless networks

In IEEE 802.11 wireless networks, the residual capacity of the wireless links should be accurately estimated to realize advanced network services such as flow admission control or load balancing. In this paper, we propose an algorithm that estimates the packet delivery failure probability by collecting transmission statistics from nearby nodes, and by using a basic collision detection mechanism. This probability is then used in an analytical model to calculate the maximum allowable traffic needed to reach the saturation condition. We show by simulations that estimation error is within 0.5–5.0%, which is significantly lower than the best performance of prior estimation methods. We also demonstrate that the flow admission control is successfully achieved in a realistic wireless network scenario by the help of accurate link residual bandwidth estimation, where the unsatisfied traffic demand remain bounded at a negligibly low level. A routing algorithm that finds max–min residual bandwidth path between source and destination nodes is also implemented, and simulation results show that the network throughput achieved by this algorithm significantly exceeds that of other popular mesh routing protocols. Finally, we provide test results from the real implementation of our algorithm on 802.11 wireless equipment, which are consistent with the simulations.     

Cross-Layer Fair Bandwidth Sharing for Multi-Channel Wireless Mesh Networks

In a wireless mesh network (WMN) with a number of stationary wireless routers, the aggregate capacity can be increased when each router is equipped with multiple network interface cards (NICs) and each NIC is assigned to a distinct orthogonal frequency channel. In this paper, given the logical topology of the network, we mathematically formulate a crosslayer fair bandwidth sharing problem as a non-linear mixedinteger network utility maximization problem. An optimal joint design, based on exact binary linearization techniques, is proposed which leads to a global maximum. A near-optimal joint design, based on approximate dual decomposition techniques, is also proposed which is practical for deployment. Performance is assessed through several numerical examples in terms of network utility, aggregate network throughput, and fairness index. Results show that our proposed designs can lead to multi-channelWMNs which are more efficient and fair compared to their singlechannel counterparts. The performance gain on both efficiency and fairness increase as the number of available NICs per router or the number of available frequency channels increases.     

FEBA: A Bandwidth Allocation Algorithm for Service Differentiation in IEEE 802.16 Mesh Networks

In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e., the higher the number of hops, the lower becomes the throughput. In this paper, a fair end-to-end bandwidth allocation (FEBA) algorithm is introduced to solve this problem. FEBA is implemented at the medium access control (MAC) layer of single-radio, multiple channels IEEE 802.16 mesh nodes, operated in a distributed coordinated scheduling mode. FEBA negotiates bandwidth among neighbors to assign a fair share proportional to a specified weight to each end-to-end traffic flow. This way traffic flows are served in a differentiated manner, with higher priority traffic flows being allocated more bandwidth on the average than the lower priority traffic flows. In fact, a node requests/grants bandwidth from/to its neighbors in a round-robin fashion where the amount of service depends on both the load on its different links and the priority of currently active traffic flows. If multiple channels are available, they are all shared evenly in order to increase the network capacity due to frequency reuse. The performance of FEBA is evaluated by extensive simulations. It is shown that wireless resources are shared fairly among best-effort traffic flows, while multimedia streams are provided with a differentiated service that enables quality of service.     

Understanding interference and carrier sensing in wireless mesh networks [Accepted from Open Call]

Wireless mesh networks aim to provide high-speed Internet service without costly network infrastructure deployment and maintenance. The main obstacle in achieving high-capacity wireless mesh networks is interference between the mesh links. In this article, we analyze the carrier sensing and interference relations between two wireless links and measure the impact of these relations on link capacity on an indoor 802.11a mesh network testbed. We show that asymmetric carrier sensing and/or interference relations commonly exist in wireless mesh networks, and we study their impact on the link capacity and fair-channel access. In addition, we investigate the effect of traffic rate on link capacity in the presence of interference.