相继干扰消除的无线自组网基于SINR模型的调度

干扰是限制现代无线网络性能的关键因素。相继干扰消除(SIC)是一种简单而强大的多包接收技术,它可在物理层有效地处理干扰。本文研究了支持SIC的Ad Hoc网络中基于累积干扰模型的链路调度。干扰的累积效应与SIC的顺序解码特性相互作用,给干扰刻画与链路调度带来了重要的技术挑战。为刻画多条链路的干扰的累积,对任意链路,定义冲突集以表示一组能干扰它的解码。然后提出冲突集图(CSG)以刻画网络的干扰并定义干扰度以衡量链路的干扰。由于基于CSG的调度为NP-hard问题,设计了基于独立集的贪婪算法以有效地构造近似最优的可行调度。仿真实验表明,与简单的贪婪算法相比[1],本算法吞吐量平均提高30%且最高达60%。     

相继干扰抵消的无线网络基于遗传算法的容量估计

相继干扰抵消(SIC)是一种有效对抗干扰的多包接收技术.在支持SIC的无线网络中,研究了最大容量即最大化并发传输数目的问题.给出了刻画SIC顺序检测特性的干扰模型,并据此提出判断链路集是否可并发的有效算法.由于最大容量问题为NP-hard的,而寻找最大并发链路集是全局优化的问题.研究了基于遗传算法的近似机制.详细讨论了遗传算法的设计并探讨了关键参数的设置,算法性能通过大量仿真实验得到了验证.     

相继干扰消除的无线网络中的调度性能分析

研究了支持相继干扰消除(successive interference cancellation,简称SIC)的无线网络中链路调度算法的设计与分析,首先,为刻画SIC的顺序检测特性,提出M-level非累积干扰模型与有序累积干扰模型.然后,由于两种模型下的调度均为NP-hard问题,研究了近似调度的性能:(1)给出了一种工作于有序累积干扰模型的调度机制,其近似比为O(g),其中,g为网络的链路多样性指数;(2)给出了一种工作于M-level非累积干扰模型的调度机制,其近似比为常数.最后,通过仿真实验考察了SIC对调度性能的影响.     

相继干扰消除的无线网络中的调度性能分析?

研究了支持相继干扰消除(successive interference cancellation,简称SIC)的无线网络中链路调度算法的设计与分析。首先,为刻画SIC的顺序检测特性,提出M-level非累积干扰模型与有序累积干扰模型。然后,由于两种模型下的调度均为 NP-hard 问题,研究了近似调度的性能：(1)给出了一种工作于有序累积干扰模型的调度机制,其近似比为O(g),其中,g为网络的链路多样性指数;(2)给出了一种工作于M-level非累积干扰模型的调度机制,其近似比为常数。最后,通过仿真实验考察了SIC对调度性能的影响。     

无线Ad hoc网络中分布式极大吞吐率调度算法研究*

针对无线Ad hoc网络广播链路的特点,在更一般的链路干扰约束模型下,设计了一种分布式、贪婪的极大吞吐率调度算法。通过运用Laypunov定理,证明了该调度算法的稳定区域是网络最大稳定区域的γ倍（0<γ<1）。通过仿真验证了该算法性能接近集中式的GMM（贪婪极大匹配）调度算法。     

基于任务调度的无线网贪婪信道分配算法

针对无线网络链路干扰问题,综合借鉴多处理器任务调度算法提出了一种贪婪信道分配算法,为所访问的无线网链路甄选出干扰最小的信道,并且证明了本算法的近似比率为2-1/k,其中为k为可用的正交信道数,算法复杂度为O（|E|2）。为了验证本文算法的可行性和有效性,将本文所提出的贪婪算法与随机信道分配算法和按序信道分配算法进行了实验对比。仿真结果表明：本文所提出的贪婪算法的整体性能优于其他两种算法,并且贪婪算法得到的最大干扰和平均干扰归一化值随着可用正交信道数的变化趋势较其他两种算法稳定。从而验证了本文算法能有效的降低链路干扰,一定程度上可以提升网络吞吐量。     

Dk-hop: 一个有向k跳无线干扰模型

无线链路调度算法的性能直接受无线干扰模型准确性的影响. 尽管由于其简单性而被广泛采用, k跳干扰模型并不能准确建模真实的无线干扰特性, 从而导致链路调度算法的理论性能与实际性能之间存在很大差异. 本文考虑无线传输方向性因素对干扰的影响, 提出了Dk-hop无线干扰模型. 该模型有效排除了k跳隐藏链路, 从而更准确地对无线干扰进行了建模.理论分析表明, 当k值不超过IR+1时(IR为载波感知距离和传输距离之比), Dk-hop比k跳干扰模型更为准确, 且仍然保持了k跳干扰模型的简单性. 为与真实的无线干扰保持接近, k的合理取值范围应为[IR-2, IR+1].     

基于混合干扰模型的多信道Mesh网络调度算法

研究了多信道无线Mesh网络中的调度及信道分配问题,设计了一种综合协议干扰模型与物理干扰模型的混合干扰模型,并在此干扰模型下提出了一种集中式调度算法。该算法在目前普遍使用的协议干扰模型的基础上,考虑了无线链路的物理传输特性：即使存在一定的干扰,也可以成功接收发射端发送的数据。模拟实验表明该算法可以提高Mesh网络中链路的并行性,有效减少总传输时间。     

干扰约束下的认知无线电传输链路自适应算法

针对干扰约束下的认知无线电传输链路自适应算法开展研究,基于OFDM的认知用户与主用户共存,认知用户在保证对主用户干扰容限的前提下执行子载波与功率分配,以树形分支贪婪算法为基础,引入功率余量因子和干扰余量因子并通过比较余量因子相对大小来选择子载波,通过减小分支数以降低算法复杂度.仿真结果表明,改进的树形分支贪婪算法获得的...     

可变频宽无线网络中信道频谱分配与链路调度

考虑信道频宽对链路传输距离和链路间干扰的影响,对可变频宽无线网络现有的累积干扰模型进行了改进,并基于改进的干扰模型对可变频宽无线网络的信道频谱分配和链路调度问题进行了建模分析。设计了一种两层优化算法对信道频谱分配和链路调度问题进行解耦,提出了一种考虑链路负载需求满足程度的链路优先级指标,启发式地构建并发传输信道分配矩阵的方法。仿真结果表明,两层优化算法能够在合理时间内收敛,启发式方法能够高效地构建并发传输信道分配矩阵。     

An effective scheduling scheme for multi-hop multicast in wireless mesh networks

With the utilization of concurrent transmission strategy, a throughput-enhanced scheduling scheme is devised for multicast service in wireless multi-hop mesh networks. Since the performance of a multicast mechanism is constrained in a wireless setting due to the interference among local wireless transmissions, the interference relationships are first characterized by introducing a graph transformation method. Based on the graph transformation, the multicast scheduling problem is converted to the graph coloring problem, and then a capacity greedy algorithm is designed to provide concurrent transmission scheduling so that the demanded multicast transmission rate can be achieved. Moreover, the necessary and sufficient conditions of multicast schedulable feasibility are derived. Through corresponding simulations, it is shown that the proposed strategy can enhance the throughput of wireless multi-hop multicast systems significantly.     

Efficient link scheduling with joint power control and successive interference cancellation in wireless networks无线网络中联合功率控制和串行干扰消除的高效链路调度算法

Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation (SIC). In this paper, we integrate the above approaches to further improve the spectral efficiency of the wireless networks and consider the max-min fairness to guarantee the transmission demand of the worst-case link. We formulate the link scheduling with joint power control and SIC (PCSIC) problem as a mixed-integer non-linear programming (MINLP), which has been proven to be NP-complete. Consequently, we propose an iterative algorithm to tackle the problem by decomposing it into a series of linear subproblems, and then the analysis shows that the algorithm has high complexity in the worst case. In order to reduce the computational complexity, we have further devised a two-stage algorithm with polynomial-time complexity. Numerical results show the performance improvements of our proposed algorithms in terms of the network throughput and power consumption compared with the link scheduling scheme only with SIC.     

基于分层聚类和干扰对齐的MIMO链路调度算法

为了降低干扰对齐所需的处理开销,将链路划分为多个簇分别进行处理成为可行的办法之一。针对现有簇划分算 法中运算复杂度较高的问题,本文提出了一种基于最小信干比的簇划分算法。在此基础上,针对所有簇同时通信造成部分簇内链路接收端信干噪比（Signal to interference plus noise ratio,SINR）较低的问题,本文将以链路为单位的调度问题等效为以簇为单位的调度问题,提出了一种基于层次聚类的簇调度算法。理论与仿真实验结果表明,本文所提出的簇划分算法的运算复杂度明显低于现有算法,且相同条件下的系统平均吞吐量更高。同时,本文提出的基于簇层次聚类的调度算法不同程度地提升了各簇内链路接收端的SINR,系统可根据不同的性能需求进行调度策略选择。     

An effective scheduling scheme for multi-hop multicast in wireless mesh networks

With the utilization of concurrent transmission strategy, a throughput-enhanced scheduling scheme is devised for multicast service in wireless multi-hop mesh networks. Since the performance of a multicast mechanism is constrained in a wireless setting due to the interference among local wireless transmissions, the interference relationships are first characterized by introducing a graph transformation method. Based on the graph transformation, the multicast scheduling problem is converted to the graph coloring problem, and then a capacity greedy algorithm is designed to provide concurrent transmission scheduling so that the demanded multicast transmission rate can be achieved. Moreover, the necessary and sufficient conditions of multicast schedulable feasibility are derived. Through corresponding simulations, it is shown that the proposed strategy can enhance the throughput of wireless multi-hop multicast systems significantly.     

Successive interference V-BLAST systems with transmission mode cancellation （SIC）in asynchronous

The V-BLAST system with asynchronous transmission mode first proposed by Shao can achieve full diversity only by using a simple linear detection scheme under zero forcing (ZF) criterion; therefore it gives a reasonable tradeoff between complexity and performance. In this paper, we propose two types of successive interference cancellation (SIC) detection schemes for the asynchronous V-BLAST system, one is characterized by applying M _r successive interference cancellators before a maximal ratio combiner (where M _t is the number of receive antennas), and the other has a maximal ratio combiner before a successive interference cancellator. Since Type I consumes more energy of the previously detected signals to recover a signal, Type II can offer a better performance and simulations demonstrate its validity.     

多中继协作无线网络中基于随机线性网络编码的调度方案

为进一步提升多中继协作无线网络传输效率,本文提出一种基于随机线性网络编码的动态规划方案,以最小化重传次数为目标,综合考虑各中继节点的有效信息与链路传输可靠性,实现多中继协同转发,以提升传输有效性。在各转发链路相互独立的情况下,针对整个传输过程,自适应地选取状态转移路径,确定最优转发节点。仿真结果表明,本方案相比随机调度机制能显著提升平均吞吐量,减少重传次数。在降低对反馈信息依赖和减少反馈开销的同时,其性能皆逼近完全反馈下基于贪心算法的调度机制。