Algebraic spatial correlations in lattice gas automata violating detailed balance

In this paper we discuss the existence of generic long-range correlations in spatially homogeneous and stable equilibrium states of closed lattice gas automata whose stochastic collision rules violate the symmetry conditions of detailed balance and in addition satisfy local conservation laws. Such correlations occur even though the collision rules are strictly local and invariant under all symmetries of the lattice. First a phenomenological (Langevin equation) approach is discussed. Next we present a theoretical analysis on the basis of an approximate microscopic (ring kinetic) theory. This theory is used to calculate the amplitude ofr ^– tails in the spatial correlations, and the result is compared with computer simulations.     

高铁场景下联合天线与IOS单元选择的分布式IOS-SM传输方案

针对高铁场景下封闭车厢带来的高信号穿透损耗导致传输速率下降问题,提出一种分布式智能全表面（intelligent omni-surface,IOS）辅助空间调制（spatial modulation,SM）的传输方案。首先,采用SM技术保证索引信息部分不受穿透损耗的影响;然后,为了减小远距离IOS车窗的高路径损耗和功率损耗,根据最大化接收信噪比原则对分布式IOS遍历选择,激活最佳IOS车窗传输SM调制信息。最后,为了减小缺失直视路径增益对系统容量性能的影响,基于功率损耗模型,采用天线移除原则和排序选择方式,对接收天线和IOS单元进行动态选择激活。仿真结果表明,相比于传统中继转发和可重构智能超表面-空间调制（reconfigurable intelligence surface-SM,RIS-SM）方案,所提方案更适合高铁通信场景。并且在功率损耗模型下,联合天线与IOS单元选择的分布式IOS-SM方案仍能够保证系统高性能传输。     

车联网中基于Q学习的地理位置路由协议

由于道路拓扑结构的限制以及车辆节点的快速变化,车联网路由协议正面临着很多挑战,例如道路的低连通性、较大的延时以及高开销等。为解决此类问题,提出了一种基于Q学习的地理位置路由协议。该协议将地理区域划分成大小一致的正方形,称为网格。在给定目的地的情况下,根据历史交通流信息计算出车辆从当前网格向不同方向的邻居网格移动的Q值,每辆车存储Q值表,通过查询Q值表选择最优下一跳网格。在选定的下一跳网格中,选择距离目的地最近的车辆,当最优下一跳网格中没有邻居车辆时,选择次优下一跳网格中的车辆。仿真结果表明,与其他基于地理位置的路由协议相比,所提协议能够提高分组投递率,降低传输延时并减少通信跳数。     

太赫兹网络中基于优先级调度的低开销双信道MAC协议

针对现有太赫兹通信网络双信道MAC协议存在控制开销冗余和在竞争信道时缺少优先级调度策略等问题,提出了一种太赫兹网络中基于优先级调度的低开销双信道MAC协议（Low Overhead Dual-channel MAC Protocol Based on Priority Scheduling,LO-PSMAC）,包含通信距离预判、优先级调度策略的CSMA/CA和精简THz频段MAC帧三种机制,可有效提升信道利用率和整体网络吞吐量,同时减小控制开销和降低数据平均时延。仿真结果表明,所提协议与现有太赫兹双信道MAC协议相比,MAC层吞吐量和信道利用率分别提升了7.14%和14.75%,数据平均时延降低了14.21%。     

智能反射面辅助广义空间调制性能分析

将智能反射面（Intelligent Reflecting Surface,IRS）技术引入索引调制（Index Modulation,IM）技术领域,可在保留各自优势的同时提高系统可靠性并实现高频谱效率。但现有方案在每时隙内仅激活一根天线,使得天线的利用率降低,且单天线激活时若想要进一步提高系统传输速率只能成倍增大发射天线数或提高调制阶数,从而影响系统性能。针对这一问题,提出了IRS辅助广义空间调制（Generalized Spatial Modulation,GSM）相关技术的方案,在发射端激活多根天线,使得在单位时间内相同天线数时每时隙传输的比特数增加。计算了该方案理论误码率上界,通过仿真验证了理论推导的正确性。     

一种高资源效率的Fast-RCSC极化码译码器

针对现有极化码软输出译码器存在的高资源消耗与低资源效率,设计了一种快速低复杂度软取消(Fast Reduced Complexity Soft-Cancelation,Fast-RCSC)译码算法及其译码器硬件架构。Fast-RCSC算法对内部特殊结点进行完整计算,在减少译码周期的同时仍有较好译码性能。基于不同特殊结点公式之间存在相似性,进而通过对引入的特殊结点模块进行计算结果复用以及计算模块分时复用,减少特殊结点模块资源消耗。通过共用存储单元以及对不足存储单元数据宽度的数据进行合并,降低存储资源消耗。在华润上华(Central Semiconductor Manufacturing Corporation,CSMC)180nm工艺下综合结果表明,设计的译码器在码长为1024的情况下,面积为2.92mm²,资源效率为245.2Mbps/mm²,相比现有软输出译码器有不同程度的提升。     

一种快速低开销的移动节点分布式寻路RPL路由协议

针对低功耗有损网络(Low Power and Lossy Network, LLN)中移动节点作为中继节点时,存在无线链路易断开、数据传输成功率较低和控制开销较高的问题,提出了一种快速低开销的移动节点分布式寻路RPL路由协议(Mobile Node Distributed Pathfinding RPL Routing Protocol, MNA-RPL)。首先,提出一种邻居表自适应更新机制,依据邻居表快速切换父节点;其次,提出一种父子节点双断开机制,能够有效减少数据包丢失;最后,提出一种基于速度动态管理的Trickle计时器,根据自身速度动态调整DIO广播周期。理论分析和仿真结果表明,与主流路由协议相比,该协议在数据传输和控制开销等方面的性能均有一定的提升。     

A fixed clustering protocol based on random relay strategy for EHWSN

In Energy Harvesting Wireless Sensor Networks (EHWSN), the communication protocol will directly affect the final performance of the network, so it is necessary to study the communication protocol based on EHWSN. In this paper, for the low-cost fixed clustering problem, a fixed clustering protocol RRCEH is based on random relaying. Our proposed RRCEH abandons the inefficient inter-cluster communication method of the traditional fixed clustering protocol. To coordinate the data upload of the cluster head, RRCEH allocates different random relay vectors to each ring area of the network, and combines all the random relay vectors into a random relay matrix of RRCEH. In each communication round, the cluster head node randomly selects its relay target node to send data according to the probability distribution in the random relay vector in the area. For two different cluster head configuration scenarios, by optimizing the random relay matrix, RRCEH can effectively reduce the network's configuration requirements for cluster head energy harvesting capability, thus reducing the deployment cost of EHWSN.     

Improved aquila optimization-based parameter evaluation framework and meta-heuristic algorithm in radio-over-fiber SpatialMux multi-input multi-output long-term evolution system

In heterogeneous access network, Multiple-Input Multiple-Output (MIMO) radio-over-fiber (RoF) system is an efficient approach for multiple signal transmission with low cost and complexity. The performance of RoF fronthaul system in MIMO system will be varied with different nonlinear effects. By adjusting various transmission parameters, such as the input signal power or the laser bias current, the nonlinear impacts produced by the RoF system can be reduced. In this paper, a novel algorithm Improved Aquila Optimization (IAO) is proposed to optimize transmission circumstances of MIMO RoF system. It determines the appropriate bias current for both lasers and Radio Frequency (RF) signal power in a short period. The input signals are wavelength multiplexed with Intensity Modulation and Direct Detection (IM/DD) applied. The carrier as well as transmission frequency is governed by the MIMO-Long-Term Evolution (LTE) standard. The proposed system is implemented in MATLAB, and the performance is evaluated. The experimental results show that fast convergence and trade-off between noise and nonlinearity are obtained with varying bandwidth. In the experimental scenario, the maximum Error Vector Magnitude (EVM) of 1.88, 3.14, and signal-to-noise ratio (SNR) of 3.204, and 2.698 was attained for both quadrature phase shift keying (QPSK) and quadrature amplitude modulation (QAM) modulation. [Correction added on 24 April 2023, after first online publication: the SNR values were corrected in the preceding sentence.] For 100 iterations, the processing time was reduced to 0.137 s. When compared with the conventional state-of-the-art approaches, the accuracy and computational complexity of the proposed approach are improved.     

IP address allocation protocols in vehicular ad hoc networks

In vehicular ad hoc networks (VANETs), communication takes place between vehicles to vehicles, the vehicles to the road side units, and vice-versa. The basic purpose of these communications is to share and exchange tremendous amount of data and information. For efficient information sharing, a systematic and structured connection establishment algorithm is needed. In VANETs, each connected node of the network need to be assigned a unique address. Hence, an algorithm is needed for the proper assignment of unique address to all nodes in the network. This paper explains different types of IP address protocols in VANETs. We have also explained advantage and disadvantage of existing IP address allocation protocols in VANETs.