协作通信中的中继技术研究

随着无线信道环境的复杂多样,本文引入了协作通信,并探讨了协作通信中的中继节点选择和功率分配两个重要的技术,最后提出了基于中继节点选择和功率分配的联合优化算法。     

一种最小误码率约束的动态地理协作路由算法

为了提高无线多跳通信的可靠性,提出一种联合物理层和网络层设计的动态地理协作路由(DGCR)算法,推导计算了单个协作单元协作中继节点的选择区域,在该区域内选择的协作中继节点可以满足误码率要求.最佳中继节点的位置会根据实际协作中继节点的位置和目的节点的位置动态选取.仿真计算表明,该算法相比非协作路由算法和传统地理协作路由算法具有更好的误码率性能,更适用于多径条件下的应用.     

无线传感器网络中的分布式协作路由和功率分配算法研究

在协作传输最优功率分配的基础上,提出了两种分布式协作路由和功率分配算法,分布式分离路由和功率分配算法与分布式联合路由和功率分配算法.这两种算法集合了物理层和媒质接入层协议,能够取得近似集中式算法的性能.仿真结果表明相对于联合协作路由和功率分配算法,分离协作路由和功率分配算法能够更加有效地节省总的发送功率.     

无线网状网射频链路的信道分配算法

研究了无线网状网络节点的接口异构对网络容量的影响.提出了一种新颖的以射频链路为信道分配对象的接口和信道联合分配的分布式贪婪最大算法.该算法以队列长度为权的射频链路吞吐量之和最大为目标,寻找自适应于网络拓扑和流量变化的分布式接口与信道联合分配方案.算法分析指出本算法与非接口异构的Dist. Greedy算法的时间复杂度相当,NS2仿真结果表明网络容量有明显提升.     

认知无线网络中基于主用户行为的联合路由和信道分配算法

针对认知无线网络中主用户行为将导致频谱瞬时变化而影响路由稳定性的问题,提出了一种基于主用户行为的路由和信道联合分配算法。该算法通过采用呼叫模型对主用户行为建模,并根据动态源路由协议的路由寻找机制,在目的节点等待多个路由请求分组后选择受主用户行为影响最小的路由,然后沿着所选定路径的反方向传送路由回复分组并完成信道分配。理论分析证明了算法中的链路平均持续时间期望与主用户活动概率成反比且具有与网络节点数成正比的计算复杂度。仿真结果表明,该算法具有比Gymkhana路由方案更高的分组投递率和更低的平均分组时延。     

基于ML的多径信道下直扩信号PN码和信道的联合盲估计

针对非协作通信下多径信道直接序列扩频信号伪随机(PN,Pseudorandom)码的估计难题,本文在分析信号二阶统计特性的基础上,提出了一种基于最大似然(ML,Maximum Likelihood)的PN码和多径信道联合盲估计的方法.该方法首先建立PN码和信道序列的最大似然数学模型,然后通过交替转换数学模型和使用迭代最小二乘投影(ILSP,Iterative Least Square Projection)算法实现PN码和多径信道的联合估计.为了进一步降低算法复杂度和避免矩阵求逆,本文给出了算法的自适应求解方式.此外,针对低信噪比下信道估计误差引起PN码的估计精度下降的问题,本文提出了一种基于迭代总体最小二乘投影的改进算法.所提算法不受PN码码型限制,并通过仿真实验验证了算法的有效性.     

短波通信接入网广域协作资源分配算法

针对短波点对点通信可靠性不高、难以满足实际需求的问题，提出了一种基于短波通信接入网的广域协作资源分配算法。通过调用多个站台，分别从不同的信道对用户进行协同保障以提高短波通信的可靠性。所提算法将资源分配问题分解为信道与站台的匹配和站台分配2个子问题，首先建立最大期望成功率匹配模型，将信道与站台进行匹配，并将分配到信道的站台组合为不同保障方案；然后分别采用模糊层次分析法和熵权法获取方案的主客观评分，并通过证据推理进行融合选出最优方案。结果表明，所提算法能有效提高短波通信的成功率，具有良好的适应性。     

改进蛙跳算法的多中继协作系统最优功率分配

协作通信与直接通信相比能够显著地提高系统性能,功率分配是协作通信中的一个关键问题。为了获得合理的协作中继通信系统功率分配方案,提出一种基于改进蛙跳算法的多中继节点功率分配方法。首先对功率分配问题进行分析,将其转换为一个非线性优化问题,然后将青蛙表示为源节点,中继节点的功率,以平均信噪比作为青蛙的食物,并通过青蛙的信息交流和协作找到最优的功率分配方案,最后采用仿真对比实验对本文算法性能进行测试。仿真结果表明,相对于其它功率分配方法,改进蛙跳算法有效地提高了系统的信道容量,降低了中断概率,以较低的复杂度提高了系统的性能。     

多天线OFDM系统中的自适应子信道分配和天线选择

针对多用户MIMO-OFDM系统,提出自适应子信道分配算法.首先将相邻的子载波分块成若干子信道,在分配子信道的时候优先考虑平均信道容量小的用户,并且将相对利用度大的子信道分配给该用户,从而在频谱利用率和公平性上具有较好的性能.为了降低发送端的硬件复杂度以及非线性因素的影响,将自适应信道分配和发送天线选择相结合,提出联合自适应子信道分配和天线选择算法.仿真结果表明,本文提出的联合算法具有较高的频谱效率和较低的中断概率.     

多并发流无线网状网中的机会路由算法

现有机会路由选择未考虑数据流的分布,可能使候选节点空闲或过载,导致网络吞吐量提升有限.本文将多并发流的机会路由描述成一个凸优化问题,基于对偶和子梯度方法,提出分布式联合候选节点选择和速率分配的多流机会路由算法(Opportunistic Routing for Multi-Flow,ORMF).该算法迭代进行流速率分配,并在速率分配过程中完成候选节点选择.实验结果表明,与基于期望传输次数和期望任意传输次数指标的机会路由相比,ORMF平均可提高33.4%和27.9%的汇聚吞吐量.     

On the Relationship Between Transmission Rate and Network Capacity in Multi-Radio Multi-Channel Wireless Mesh Networks

This paper quantitatively investigates the relationship between physical transmission rate and network capacity in multi-radio multi-channel wireless mesh networks by using mixed-integer linear programming to formulate the joint channel assignment and routing problem. The numerical results show that the rate lower than the highest available one can improve the network capacity due to increased connectivity. It is also shown that the lower transmission rate is able to utilize abundant channels more effectively due to the higher degree of freedom in channel assignment. Finally, it is shown that joint rate, channel assignment and routing improves the network capacity further.     

A Multi-Objective Optimization Approach for Joint Channel Assignment and Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

Multicast routing is an effective mechanism for delivering data to a group of receivers. Due to intrinsic property of air medium in wireless mesh networks (WMN), interference is an important issue in determining the data rate for multicast services. Interference reduction is handled by assigning multiple orthogonal channels to multiple radios in multi-radio multi-channel WMNs. Channel assignment is known to be a NP-complete problem. Most prior methods have solved multicast routing and channel assignment problems sequentially and have not considered the interplay between these two problems. Focusing on this issue, we address joint channel assignment and routing problem for multicast applications. In this paper, a novel technique based on a multi-objective genetic algorithm is proposed to build a delay constrained minimum cost multicast tree with minimum interference. We have examined the proposed algorithm on different network configurations. Experimental results demonstrate that our method finds better trees in terms of cost, delay, and interference compared to prior methods.     

Fairness-oriented routing algorithm joint with power control and channel assignment for multi-radio multi-channel wireless mesh networks

The multi-radio multi-channel wireless mesh network （MRMC-WMN） draws general attention because of its excellent throughput performance, robustness and relative low cost. The closed interactions among power control （PC）, channel assignment （CA） and routing is contributed to the performance of multi-radio multi-channel wireless mesh networks （MRMC-WMNs）. However, the joint PC, CA and routing （JPCR） design, desired to achieve a global optimization, was poor addressed. The authors present a routing algorithm joint with PC and CA （JPCRA） to seek the routing, power and channel scheme for each flow, which can improve the fairness performance. Firstly, considering available channels and power levels, the routing metric, called minimum flow rate, is designed based on the physical interference and Shannon channel models. The JPCRA is presented based on the genetic algorithm （GA） with simulated annealing to maximize the minimum flow rate, an non-deterministic polynomial-time hard （NP-Hard） problem. Simulations show the JPCRA obtains better fairness among different flows and higher network throughput.     

A Multi-radio 802.11 Mesh Network Architecture

The focus of this paper is to offer a practical multi-radio mesh network architecture that can realize the benefits of multiple radios. Our architecture provides solutions to challenges in three key areas. The first is the construction of a split wireless router that enables modular wireless mesh routers to be constructed from commodity hardware. The second is the design of a centralized channel assignment algorithm that considers the inter-dependence between channel assignment and routing in order to create high-throughput channel-diversified routes. Third is the design and implementation of several communication protocols that are necessary to make our architecture operational. Our system is comprehensively evaluated on a 20-node multi-radio wireless testbed. Results demonstrate that our architecture makes feasible the deployment of large-scale high-capacity multi-radio mesh networks built entirely with commodity hardware. Our implementation is available to the community for research and development purposes.     

Power-Efficient Spatial Reusable Channel Assignment Scheme in WLAN Mesh Networks

Interference has strong effect on the available bandwidth of wireless local area network (WLAN) based mesh networks. The channel assignment problem for multi-radio multi-channel multihop WLAN mesh networks is complex NP-hard, and channel assignment, routing and power control are tightly coupled. To mitigate the co-channel interference and improve capacity in multi-channel and multi-interface WLAN mesh networks, a power-efficient spatial reusable channel assignment scheme is proposed, which considers both channel diversity and spatial reusability to reduce co-channel interference by joint adjusting channel, transmission power and routing. In order to assign channel appropriately, an efficient power control scheme and a simple heuristic algorithm is introduced to achieve this objective, which adjust the channel and power level of each radio according to the current channel conditions so as to increase the opportunity of channel spatial reusability. The proposed channel assignment scheme also takes load, capacity and interference of links into consideration. Simulation results show the effectiveness of our approach and demonstrate that the proposed scheme can get better performance than other approaches in terms of throughput, blocking ratio, energy consumption and end-to-end delay.     

Distributed channel assignment combined with routing over multi-radio multi-channel wireless mesh networks

In order to realize the reduction of equipment cost and the demand of higher capacity,wireless mesh network(WMN) router devices usually have several interfaces and work on multi-channels.Jointing channel allocation,interface assignment and routing can efficiently improve the network capacity.This paper presents an efficient channel assignment scheme combined with the multi-radio link quality source routing(MR-LQSR) protocol,which is called channel assignment with MR-LQSR(CA-LQSR).In this scheme,a physical interference model is established:calculated transmission time(CTT) is proposed as the metric of channel assignment,which can reflect the real network environment and channel interference best,and enhanced weighted cumulative expected transmission time(EWCETT) is proposed as the routing metric,which preserves load balancing and bandwidth of links.Meantime,the expression of EWCETT contains the value of CTT,thus the total cost time of channel assignment and routing can be reduced.Simulation results show that our method has advantage of higher throughput,lower end-to-end time delay,and less network cost over some other existing methods.     

Modeling throughput gain of network coding in multi-channel multi-radio wireless ad hoc networks

In this paper, we model the network throughput gains of two types of wireless network coding (NC) schemes, including the conventional NC and the analog NC schemes, over the traditional non-NC transmission scheduling schemes in multihop, multi-channel, and multi-radio wireless ad hoc networks. In particular, we first show that the network throughput gains of the conventional NC and analog NC are (2n)/(2n-1) and n/(n-1), respectively, for the n-way relay networks where n ges 2. Second, we propose an analytical framework for deriving the network throughput gain of the wireless NC schemes over general wireless network topologies. By solving the problem of maximizing the network throughput subject to the fairness requirements under our proposed framework, we quantitatively analyze the network throughput gains of these two types of wireless NC schemes for a variety of wireless ad hoc network topologies with different routing strategies. Finally, we develop a heuristic joint link scheduling, channel assignment, and routing algorithm that aims at approaching the optimal solution to the optimization problem under our proposed framework.     

无线mesh网络中的信道分配问题研究

在多接口无线mesh网络中使用多信道可以减少碰撞和干扰,提高系统吞吐量。因此,合理的信道分配是无线mesh网络中多信道技术的关键。用图论理论建立信道分配数学模型以及用图着色理论研究信道分配问题是无线网络中解决信道分配问题的有效方法。因此针对无线mesh网络中多接口多信道(multi-radio and multi-channel)的特点,重点介绍了无线mesh网络中信道分配的基本理论、主要约束和图论模型等,最后提出应用图着色理论解决信道分配问题的一般途径。     

Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks

In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communication. We address the problem of assigning channels to communication links in the network with the objective of minimizing overall network interference. Since the number of radios on any node can be less than the number of available channels, the channel assignment must obey the constraint that the number of different channels assigned to the links incident on any node is atmost the number of radio interfaces on that node. The above optimization problem is known to be NP-hard. We design centralized and distributed algorithms for the above channel assignment problem. To evaluate the quality of the solutions obtained by our algorithms, we develop a semidefinite program and a linear program formulation of our optimization problem to obtain lower bounds on overall network interference. Empirical evaluations on randomly generated network graphs show that our algorithms perform close to the above established lower bounds, with the difference diminishing rapidly with increase in number of radios. Also, ns-2 simulations as well as experimental studies on testbed demonstrate the performance potential of our channel assignment algorithms in 802.11-based multi-radio mesh networks.     

Network coding for multiple unicast sessions in multi-channel/interface wireless networks

Throughput limitation of wireless networks imposes many practical problems as a result of wireless media broadcast nature. The solutions of the problem are mainly categorized in two groups; the use of multiple orthogonal channels and network coding (NC). The networks with multiple orthogonal channels and possibly multiple interfaces can mitigate co-channel interference among nodes. However, efficient assignment of channels to the available network interfaces is a major problem for network designers. Existing heuristic and theoretical work unanimously focused on joint design of channel assignment with the conventional transport/IP/MAC architecture. Furthermore, NC has been a prominent approach to improve the throughput of unicast traffic in wireless multi-hop networks through opportunistic NC. In this paper we seek a collaboration scheme for NC in multi-channel/interface wireless networks, i.e., the integration of NC, routing and channel assignment problem. First, we extend the NC for multiple unicast sessions to involve both COPE-type and a new proposed scheme named as Star-NC. Then, we propose an analytical framework that jointly optimizes the problem of routing, channel assignment and NC. Our theoretical formulation via a linear programming provides a method for finding source–destination routes and utilizing the best choices of different NC schemes to maximize the aggregate throughput. Through this LP, we propose a novel channel assignment algorithm that is aware of both coding opportunities and co-channel interference. Finally, we evaluate our model for various networks, traffic models, routing and coding strategies over coding-oblivious routing.