5G非正交多址技术关键问题研究

非正交多址接入(NOMA)技术是5G通信的关键技术之一。该技术采用功率域复用的方式增加用户接入数,具有较高的频谱效率和可靠性,应用前景广泛。因此,研究5G非正交多址接入技术具有相当重要的意义。尤其是对其关键问题,如用户间的资源分配和多址干扰的消除等方面的问题,更值得深入研究。分别对这两个关键问题,就国内外目前的研究进展进行了详尽的分析和探讨。从实际多用户小区的资源分配、单一的串行干扰消除技术出发,总结了目前研究中所存在的问题,并提出相关解决方案,为更好地发挥NOMA技术的性能优势、抑制多用户共享资源带来的多址干扰问题提供参考。随着研究的深入,资源分配和干扰消除两大关键问题必将得到完善的解决,非正交多址技术也会在5G通信领域中得到广泛的应用。     

空间信息网络多址接入技术研究进展

空间信息网络具有高动态拓扑,大时空尺度、多样化业务和星上资源受限等特点。随着星间组网技术的日益成熟和航天活动的不断增加,航天器用户的动态多址接入问题已经成为影响网络性能的关键因素,得到了国内外研究机构的广泛关注。首先分析了典型多址接入技术的主要特点;然后在空间信息网络场景中,对基于竞争的分布式接入控制、基于无冲突的集中式接入控制以及多协议混合接入控制等三种多址接入技术进行了性能分析,对比剖析了三种多址接入方法的优势与不足。最后,分别提出了典型多址接入技术在未来空间信息网络中的典型应用场景和适应性改造方法。     

用于总线通信网的同步计数顺序争用多址接入技术

介绍一种新型的用于总线型通信网络的多址接入技术的工作原理，即同步计数顺序争用多址接入技术，该技术不需要检测冲突，具有性能稳定，容易实现等优点。     

多用户场景下SWIPT-NOMA网络中的保密能量效率优化

在采用非正交多址接入技术的无线携能通信网络中,窃听者的存在和不同用户配对方式将影响网络的保密能量效率.为寻求保密能量效率最大化支配下的网络资源配置方案,提出了一种改进的群智能搜索算法用于解决此非凸优化问题.改进的群智能搜索算法采用共生生物搜索技术,增强了对可行域的局部搜索能力.仿真结果表明,不同的用户配对方式在单时隙或多时隙场景下具有相异特征,改进后的群智能搜索算法比其他基线算法具有更佳的网络性能,为多输入多输出非正交多址接入无线携能通信网络中通信安全及能量效率的研究提供了依据.     

基于FD-NOMA的无人机通信系统容量分析

为了提高无人机与地面用户的通信质量，提出了一种基于全双工和非正交多址接入技术的无人机通信系统模型，并分析了城市和郊区两种场景下该系统模型的遍历容量。首先，推导出两种场景下该系统模型的精确容量表达式；然后，通过引入Q函数和利用截断方法解决了式中指数积分函数的计算问题，得到了容量的近似闭式表达式，并在城市场景下，采用取系数因子的方法得到了更精确的容量近似闭式表达式；最后，仿真和数值结果表明，莱斯因子对系统容量存在一定影响，增加无人机数量或非正交多址接入功率向量都可以获得更好的容量性能。     

多媒体信源时隙式随机多址系统研究

本文对多媒体信源时隙式随机多址系统进行研究,提出一种新的接入机制,得出系统吞吐量的解析表达式,在此基础上研究有关系统性能,并给出计算机仿真实验结果。     

MIMO系统中基于非正交多址接入的功率分配算法研究

随着移动通信技术的发展,通信服务已变成人类日常生活中不可或缺的部分.尤其是近年来各类智能终端的大众化,使得接入无线通信的用户数和人们对通信服务的需求均呈爆炸式的增长.但现如今可用的频谱资源是有限的,且传统的正交多址接入系统的用户接入数受限,很难满足用户日益增长的需求.非正交多址接入允许在同一时频资源上复用多个用户,极大程度地提高了系统的用户接入数和频谱效率.将非正交多址接入技术运用于多输入多输出系统中,更进一步地提升系统各方面的性能.针对在MIMO-NOMA系统中现有的研究存在的复杂度较高的问题,提出一种基于串行干扰消除残留的功率分配算法.首先,建立斯坦克尔伯格博弈模型,将基站设置为卖方,小区内各用户设置为买方.其次,使用拉格朗日函数求出在约束条件下用户购买的最优功率,此功率为关于单位价格的函数.最后,求解出基站为各用户设置的最优单位功率价格.在基站和用户双方博弈的过程中,基站动态地调整功率价格,尽量最大化自身收益.仿真结果表明,所提算法与分数阶功率分配算法相比,吞吐量在系统总功率为24 dBm且串行干扰消除因子为0.001时有15.65%的提升,并且在吞吐量性能与文献[10]相近的基础上,降低了运算复杂度,减小了基站的功率消耗.     

Ad-Hoc网络多址接入协议的研究与实现

在介绍了Ad-Hoc网络的概念及特点的基础上,系统地论述了Ad-Hoc网络的多址接入技术,总结了适用于现代通信系统的MAC协议所应具备的性能,并对开发Ad-Hoc网络这样一项复工程的方法做了详细的论述。     

非正交多址接入系统中关于迫零波束的用户配对

为了满足人们对移动通信越来越多的要求,第五代通信系统(5G)的研究日益受到人们的重视。为了增加系统的容量,非正交多址接入(NOMA)技术作为一种新的多址接入技术很有可能运用到5G中。由于接收端运用串行干扰消除技术,可以将多个信号结合在一起传送。因此将NOMA与多输入多输出技术结合在一起,采用迫零算法设计波束。每个波束可以有多个用户,主要讨论用户的配对选择问题。为了提高系统的效果,利用迫零算法波束的特点,提出了用户的配对选择算法。仿真结果证明,该算法有很好的效果。     

网络突发数据传输技术研究

对网络上行信道的特性及数据传输技术进行了研究。在基于CATV接入的网络的多用户接入信道上,需要采用突发模式传送技术来支持随机多址接入。文章首先分析了现有网络数据传输技术研究的现状及存在的问题,为合理选择网络模型、标准以及设计网络提供了理论和技术保证,从网络的MAC协议出发,分析了网络目前相关标准的冲突解决算法,找出了影响网络系统性能的主要因素,提出了改进网络性能的新算法和技术。     

On time-triggered and event-based control of integrator systems over a shared communication system

When analyzing networked control systems, where the control loop is closed over a communication system, it is crucial to take the communication system into account. Hence, time-triggered and event-based control of an integrator system with noise over a shared communication system is analyzed. Thereby, analytical models of different communication systems are used and the analysis is focused on the effect of the communication system on the performance, as well as the interaction between control and communication. For time-triggered control, where the event times are known in advance, a deterministic communication protocol can be used. Hence, time-triggered control with the two most well-known deterministic communication protocols, time division multiple access (TDMA) and frequency division multiple access (FDMA), is analyzed. For event-based control, where the events appear at random times, a contention-based communication protocol should be used. Hence, event-based control is analyzed with different contention-based communication protocols: pure ALOHA, slotted ALOHA, a queueing system, and Erlang’s loss model. It turns out that time-triggered control with either TDMA or FDMA outperforms event-based control with pure or slotted ALOHA. However, event-based control with a properly designed queueing system gives an even better performance. Thus, we conclude that it is crucial to take the details of the communication system into account.     

Try-once-discard scheduling for stochastic networked control systems

In practical networked control systems (NCS), such as smart grids, cooperative robotics, and sensor networks, often multiple control applications share a communication infrastructure, requiring a smart and efficient scheduling mechanism to coordinate the access to the capacity-limited communication medium. In this article we consider the problem of event-based scheduling design for NCSs consisting of multiple control loops over a shared communication medium. We extend the notion of Try-Once-Discard (TOD), which is one of the basic deterministic event-based scheduling protocols for resource constrained NCSs, to the case of multiple stochastic control systems coupled via a shared communication medium subject to capacity limitation and stochastic packet delivery failure. Showing that the overall network-induced error is a homogeneous Markov chain in our stochastic set-up, we first study stability properties of such networked systems under the TOD scheduling scheme employing the concepts of stochastic stability. Then, we derive sufficient stability conditions under the TOD rule assuming that the communication channel is not ideal, i.e. a scheduled data packet for transmission might be lost in the communication channel with a non-zero probability. Furthermore, we derive analytic performance bounds by finding uniform upper-bounds for an average quadratic cost function. The numerical simulations are performed for variety of system parameters and NCS set-ups to strengthen our stability claim as well as illustrating performance bounds. Additionally, we show that the TOD scheduling rule outperforms the conventional time-triggered, and uniform and non-uniform random channel access arbitration mechanisms, in terms of efficient coordination of channel access in stochastic NCSs.     

Towards geometrically robust data-hiding with structured codebooks

In this paper we analyze performance of practical robust data-hiding in channels with geometrical transformations. By applying information-theoretic argument we show that performance of a system designed based on both random coding and random binning principles is bounded by the same maximal achievable rate for the cases when communication channel includes geometrical transformations or not. Targeting to provide theoretic performance limits of practical robust data-hiding we model it using a multiple access channel (MAC) with side information (SI) available at one of encoders and present the bounds on achievable rates of reliable communications to such a protocol. Finally, considering template-based and redundant-based design of geometrically robust data-hiding systems, we perform security analysis of their performance and present results in terms of number of trial efforts the attacker needs to completely remove hidden information.     

一种高性能多媒体对象存储系统的研究

通过对多媒体应用中多用户并发访问的特点和性能进行分析,提出一种高性能多媒体对象存储系统MOSS(Multime-dia Object Storage System)的对象数据组织结构.MOSS结构采用两层结构,下层采用RAID5的方式组织数据,这样可以利用RAID5磁盘利用率高的优势.上层放常用的热点数据,通过将不同对象存放在不同磁盘,从而将不同用户的请求尽量分散到不同的磁盘上,可以提高多用户的并发访问性能.通过仿真测试,在4用户情况下,MOSS的性能平均比RAID高90%,随着用户数的增加,传统RAID方式的性能下降明显,而MOSS的性能下降很少,在16用户情况下,MOSS的性能平均比RAID高550%.     

多通道约束下的网络控制系统的最优跟踪性能

本文针对双通道约束下的线性时不变网络控制系统的随机信号跟踪性能极限问题进行了研究.网络通信包含通信噪声和通信带宽两种信道因素.被控系统考虑是非最小相位和不稳定系统,并且系统包含多个不同的非最小相位零点和多个不同的不稳定极点.对上行通道和下行通道都存在通信带宽约束及高斯白噪声影响的情形,从频域角度,通过采用双自由度控制器和尤拉参数化方法,获得了此类网络控制系统的最优可达的跟踪性能.研究结果表明网络控制系统的跟踪性能极限完全由被控对象的结构特征(非最小相位零点、不稳定极点以及被控对象的系统增益),参考输入信号和网络特性(高斯白噪声的统计特征、通信信道带宽)所决定.最后,仿真结果检证了所得结果的正确性.     

Networked H∞ filtering for linear discrete-time systems

This paper studies the problem of networked H_∞ filtering for linear discrete-time systems. A new model is proposed as the filtering error system to simultaneously capture the communication constraint, random packet dropout and quantization effects in the networked systems. A sufficient condition is presented for the filtering error system to be mean square exponentially stable with a prescribed H_∞ performance by employing the multiple Lyapunov function method. The obtained condition depends on some parameters of the networked systems, such as the access sequence of nodes, packet dropout rate and quantization density. With these parameters fixed, a design procedure for the desired H_∞ filter is also presented based on the derived condition. Finally, an illustrative example is utilized to show the effectiveness of the proposed method.     

Network access protocol for hard real-time communication systems

Distributed hard real-time systems are characterized by communication messages associated with timing constraints, typically in the form of deadlines. A message should be received at the destination before its deadline expires. Carrier sense multiple access with collision detection (CSMA/CD) appears to be one of the most common communication network access schemes that can be used in distributed hard real-time systems. In this paper, we propose a new real-time network access protocol which is based on the CSMA/CD scheme. The protocol classifies the messages into two classes as ‘critical’ and ‘noncritical’ messages. The messages close to their deadlines are considered to be critical. A critical message is given the right to access the network by preempting a noncritical message in transmission. Extensive simulation experiments have been conducted to evaluate the performance of the protocol. It is shown that the protocol can provide considerable improvement over the virtual time CSMA/CD protocol proposed for hard real-time communication by Zhao et al.¹.     

基于多次重构映射的相干混沌数字通信系统*

利用相空间多次重构的混沌映射,为相干方式的混沌数字通信问题,提供一种解决方案。新映射产生的混沌码序列性能更加优异,自相关性明显改善,最大Lyapunov指数由0.697增加到5.545,复杂度也明显提高,仿真证实,利用新的混沌映射,系统抗多址性能提高;基于新映射混沌码良好的相关性能和抗多址性能,设计了一种滑膜相关峰检测同步法,完成离散混沌系统同步,实现相干方式混沌数字通信。     

RAID小数据随机访问性能分析与优化

RAID采用条纹结构,使多块磁盘可并行访问,提高了带宽,适合于大块数据顺序访问,而对小块数据随机访问影响不大。针对Stripe条纹大小对RAID的读写性能进行分析,探讨多用户小数据访问模式下的IOPS(IOs per second)问题,提出粗粒度条纹布局模型。仿真实验表明：该模型的性能优于现有布局方式,显著提高小块数据随机访问性能。