Practical cross‐layer routing and channel assignment in cognitive radio ad hoc networks

In the heterogeneous and unreliable channel environment of cognitive radio ad hoc networks (CRAHNs), a multipath route with channel assigned is preferable in both throughput and reliability. The cross‐layer multipath routing and channel assignment in CRAHNs is becoming a challenging issue. In this paper, this problem is characterized, formulated, and shown to be in the form of mixed integer programming. For this Non‐deterministic Polynomial‐time (NP)‐hard problem, the deficiency of the widely used linearization and sequential fixing algorithm is first analyzed. The main contribution of this paper is the development of a new backtracking algorithm with feasibility checking to search optimal solutions and a heuristic algorithm with high feasible solution‐obtained probability (HHFOP) for distributed application in CRAHNs. Through feasibility checking and solution bounds validating, backtracking algorithm with feasibility checking cuts off unnecessary searching space in early stage without loss of optimal solutions, making it much more efficient than brute searching. For practical application in CRAHNs with polynomial complexity, HHFOP first computes the maximal‐supported throughput through link‐channel assignment and link‐capacity coordination for each candidate path. Then the paths are combined, and the route throughput is optimized. Extensive simulation results demonstrate that HHFOP can achieve a high feasible solution‐obtained probability with little throughput degradation compared with linearization and sequential fixing algorithm, indicating its practicability for distributed applications in CRAHNs. Copyright © 2013 John Wiley & Sons, Ltd.     

部分信道状态信息下多天线系统的最优发送

在实际的单用户多天线平坦衰落通信系统中,接收端往往具有理想的信道状态信息,而发送端只有来自接收端的部分信道状态信息反馈,因此在发送端信道模型假设为复高斯随机矩阵.在发射端具有信道协反差反馈或者均值反馈的情形下,对达到最大的信道容量即信息论角度的最优化问题进行了理论分析,研究了系统的最优发送方案.对目前的关于单方向发射的最优条件进行扩展,进一步推导了沿任意多个方向发送达到信道容量的条件.数值结果验证了分析结论.     

COMPUTER SIMULATION TECHNIQUES FOR A MOBILE SATELLITE COMMUNICATION CHANNEL

This paper gives a brief and systematic presentation of the computer simulation techniques of satellite communications, especially for a mobile satellite channel, based on a summarization of the author's exploration and experience in this area. It includes the equivalent complex baseband notation (ECBN) method, a very convenient mathematical form for software simulation; development of a multi-functional and expandable channel simulation system on a computer from L-band to Ka-band; channel impulse or frequency response estimation in real time by the technique burst-mode link analyser with least-squares algorithm (BMLA/LS), modelling and simulation of the channel fast fading due to multipath and shadowing; acquisition of the equivalent normalized binary signal-to-noise ratio (E_b/N₀) data at the channel input; and bit-error rate (BER) evaluation by the directly error-counting approach and the computational approach at the channel output in simulation.     

城市交通信息系统的设计

高新技术的智能交通系统（Intelligent Transport System,ITS）是改善世界性交通难题的希望所在。文中针对智能交通系统中的关键性问题的交通信息系统提出了构思,并深入研究了信息发布子系统,对无线数据传输提出了经济实用的方案,并予以实现。该文对提高我国城市交通系统的智能化水平具有参考意义。     

超声波燃气表矩形流道的雷诺修正系数仿真研究

在超声波流量计测量技术中, 雷诺修正系数相关的研究对于提高计量精度有重要作用. 为研究矩形流道的雷诺修正系数与雷诺数的关系, 对矩形流道在常温常压流量较小情况下进行仿真, 结果发现: 矩形流道层流状态下的雷诺修正系数与雷诺数呈线性相关. 保持压强、体积流量不变, 在不同温度下进行仿真及拟合, 结果表明: 在不同温度下雷诺修正系数与雷诺数的线性关系依然满足. 在上述实验基础上, 对矩形流道湍流状态下的雷诺修正系数与雷诺数关系进行研究, 通过改变温度、压强和体积流量进行仿真及拟合发现, 矩形流道湍流状态下雷诺修正系数与雷诺数呈非线性相关.     

An Efficient SCF-PEKS Without Random Oracle Under Simple Assumption

The Public key encryption scheme with keyword search (PEKS), firstly put forward by Boneh et al., can achieve the keyword searching without revealing any information of the initial data. However, the original PEKS scheme was required to construct a secure channel, which was usually expensive. Aimed at resolving this problem, Baek et al. put forward an improved scheme, which tried to construct a Secure channel free PEKS (SCF-PEKS). Subsequently, several SCF-PEKS schemes were proposed, however most of them turned out only secure in the random oracle model, which possibly lead to the construction of insecure schemes. Therefore, Fang et al. put forward an enhanced SCF-PEKS construction, which was provably secure in the standard model, however this construction needed a strong and complicated assumption. Then Yang et al. put forward an SCF-PEKS construction under simple assumption, but their construction had a big reduction in efficiency. In this article, we propose an SCF-PEKS construction, which is provably secure under the same assumption as that of Yang et al.'s scheme, however, with better performance. Then we give its full security proof, along with the performance analysis. Finally, we improve the SCF-PEKS construction to resist Keyword guessing attack (KGA) and give its security demonstration.     

Channel-Supermodular Entropies: Order Theory and an Application to Query Anonymization

This work introduces channel-supermodular entropies, a subset of quasi-concave entropies. Channel-supermodularity is a property shared by some of the most commonly used entropies in the literature, including Arimoto–Rényi conditional entropies (which include Shannon and min-entropy as special cases), k-tries entropies, and guessing entropy. Based on channel-supermodularity, new preorders for channels that strictly include degradedness and inclusion (or Shannon ordering) are defined, and these preorders are shown to provide a sufficient condition for the more-capable and capacity ordering, not only for Shannon entropy but also regarding analogous concepts for other entropy measures. The theory developed is then applied in the context of query anonymization. We introduce a greedy algorithm based on channel-supermodularity for query anonymization and prove its optimality, in terms of information leakage, for all symmetric channel-supermodular entropies.     

HMD-Net: A Vehicle Hazmat Marker Detection Benchmark

Vehicles carrying hazardous material (hazmat) are severe threats to the safety of highway transportation, and a model that can automatically recognize hazmat markers installed or attached on vehicles is essential for intelligent management systems. However, there is still no public dataset for benchmarking the task of hazmat marker detection. To this end, this paper releases a large-scale vehicle hazmat marker dataset named VisInt-VHM, which includes 10,000 images with a total of 20,023 hazmat markers captured under different environmental conditions from a real-world highway. Meanwhile, we provide an compact hazmat marker detection network named HMD-Net, which utilizes a revised lightweight backbone and is further compressed by channel pruning. As a consequence, the trained-model can be efficiently deployed on a resource-restricted edge device. Experimental results demonstrate that compared with some established methods such as YOLOv3, YOLOv4, their lightweight versions and popular lightweight models, HMD-Net can achieve a better trade-off between the detection accuracy and the inference speed.     

5G NR FDD与WCDMA系统共存研究

为推动5G在中频段的重耕,研究了中频段NR FDD系统与WCDMA系统在相同地理区域邻频共存时的系统间干扰造成的性能损失,分析了在不同功率参数、不同拓扑结构、AAS/NON-AAS 2种天线模型下,4个干扰场景的仿真结果.最后给出NR FDD系统与WCDMA系统共存建议以及共存措施.     

机器学习在信道建模中的应用综述

信道建模是设计无线通信系统的基础,传统的信道建模方法无法自动学习特定类型信道的规律,特别是在针对特殊应用场景,如物联网、毫米波通信、车联网等,存在一定的局限性.此外,机器学习具有有效处理大数据、创建模型的能力,基于此,探讨了机器学习如何与信道建模进行有机融合,分别从信道多径分簇、参数估计、模型的构造及信道的场景识别展开...