一维随机粗糙表面散射特征的数值分析

本文在Ｋｉｒｃｈｈｏｆｆ近似基础上，利用数值积分方法分析了一维随机粗糙表面的散射特征。结果显示随着粗糙度的增大，单次散射峰值由连续地向后向移动，其强度不断降低。峰值宽度增加。在一个较窄的粗糙度范围内，散射场对称于表面法线呈近似余弦分布而接近于理想朗伯体。当粗糙度超过这一范围时，散射峰值将由线向后向移动，并在粗糙度很大时稳定在后向附近。     

关于离散随机变量熵的一个上界

本文分析了离散随机变量熵与方差及有关微分熵的某种关系，给出了离散随机变量熵的一个上界，改进了Ｔ．Ｍ．Ｃｏｖｅｒ与Ｊ．Ａ．Ｔｈｏｍａｓ关于离散熵的上界的已有结果［１］，并以图和表的方式举出一些实例加以比较。     

同位协同随机建模在储层预测中的应用

采用同位协同随机建模技术,以反映储层含油性的电阻率测井参数为主变量,以地震波阻抗为协变量,对储集层的合油砂岩厚度进行了预测。根据大庆葡南油田葡333区块有效储层下限的解释标准,对电阻率随机模拟得到的多个实现进行解释,得到各实现的含油砂岩厚度,并以10m含油砂岩厚度为风险门槛值分析了该区钻井风险性。新、老钻井的钻遇情况分析表明,应用序贯高斯同位协同地震属性数据的模拟方法进行储层预测的精度较高,利用多个随机模拟实现的差异性进行预测结果的风险性评价可以有效地降低钻井风险。     

Modeling and performance analysis of VI‐CRA: A congestion control algorithm for vehicular networks

This study proposes a Vehicle ID‐based CAM Rate Adaptation (VI‐CRA) algorithm for beacon messages in the vehicular network. Foremost, an improved vehicle ID–based analytical model is proposed at the MAC layer of vehicular network. The model weighs the random back‐off number chosen by vehicles participating in the back‐off process, with the vehicle ID incorporated in their respective CAMs. This eventually leads to the selection of a vehicle ID–based random back‐off number, minimizing the probability of collision due to same back‐off number selection. It is worth noting that the improved analytical model outperforms the existing works in terms of average packet delay since only one fourth of the contention window size is used throughout the simulation. To enhance the performance of the analytical model, the paper incorporates a congestion control algorithm, by adapting the rate of CAM broadcast over the control channel. The algorithm is designed considering a wide range of scenarios, ranging from nonsaturated to extremely saturated network (in terms of collision probability) and sparsely distributed to teemed network (in terms of vehicular density). For better analyses of simulation results, the algorithm is applied over different vehicle ID–based back‐off numbers. Simulation results for all the back‐off numbers show that vehicle ID–based CAM rate adaptation algorithm performs better than the traditional fixed CAM rate IEEE 802.11p, even at high vehicular density.     

Reliable M2M/IoT data delivery from FANETs via satellite

The use of unmanned aerial vehicles (UAVs) is rising in several application fields. This work deals with the communication challenges in UAV swarms, or flying ad hoc network (FANET), when taking into account non–line‐of‐sight scenarios. The use of satellites is a necessity in such operating conditions; thus, this work provides architectural considerations and performance assessments when several (FANETs) share an uplink random access satellite channel, fed with M2M/IoT traffic generated from on‐board sensors, to be reliably delivered to a remote ground destination.     

Design and Analysis of an Efficient Communication Strategy for Hierarchical and Highly Changing Ad-hoc Mobile Networks

In this work we introduce two practical and interesting models of ad-hoc mobile networks: (a) hierarchical ad-hoc networks, comprised of dense subnetworks of mobile users interconnected by a very fast yet limited backbone infrastructure, (b) highly changing ad-hoc networks, where the deployment area changes in a highly dynamic way and is unknown to the protocol. In such networks, we study the problem of basic communication, i.e., sending messages from a sender node to a receiver node. For highly changing networks, we investigate an efficient communication protocol exploiting the coordinated motion of a small part of an ad-hoc mobile network (the runners support) to achieve fast communication. This protocol instead of using a fixed sized support for the whole duration of the protocol, employs a support of some initial (small) size which adapts (given some time which can be made fast enough) to the actual levels of traffic and the (unknown and possibly rapidly changing) network area, by changing its size in order to converge to an optimal size, thus satisfying certain Quality of Service criteria. Using random walks theory, we show that such an adaptive approach is, for this class of ad-hoc mobile networks, significantly more efficient than a simple non-adaptive implementation of the basic runners support idea, introduced in [9,10]. For hierarchical ad-hoc networks, we establish communication by using a runners support in each lower level of the hierarchy (i.e., in each dense subnetwork), while the fast backbone provides interconnections at the upper level (i.e., between the various subnetworks). We analyze the time efficiency of this hierarchical approach. This analysis indicates that the hierarchical implementation of the support approach significantly outperforms a simple implementation of it in hierarchical ad-hoc networks. Finally, we discuss a possible combination of the two approaches above (the hierarchical and the adaptive ones) that can be useful in ad-hoc networks that are both hierarchical and highly changing. Indeed, in such cases the hierarchical nature of these networks further supports the possibility of adaptation.     

一种基于混沌的真随机源电路

提出了一种基于混沌的随机源电路,通过利用电容上电荷的再分配,实现了一个离散混沌系统.该电路在0 .8μm CMOS工艺下流片成功,核心面积小于4 2 0 0 μm2 ,功耗小于1m W,优于目前已有的几种实现方法.     

MIMO信道中衰落信号的空域相关性评估

将MIMO(多输入多输出)信道建立为Nakagami衰落信道,进一步推导单元天线接收多径衰落信号的空域相关系数的通用解析式,并在均匀分布、余弦分布、高斯分布和拉式分布的来波功率角谱下分别进一步评估接收信号的空域相关性,分析各参数对相关系数的影响,比较各种来波功率角谱下相关性的数值结果,这些对于准确分析MIMO系统性能与设计MIMO多天线系统是十分必要的.     

一种具有不可预测性的随机延时引信延迟时间的总体分布

构造了一种变组合分布作为随机延时引信延迟时间的总体分布 ,并利用 BP网络对其与其它总体分布产生的随机延迟时间序列进行预测性分析比较 ,证明按该法产生的随机时间序列具有不可预测性     

Spreading Codes Generator for Wireless CDMA Networks

The prime characteristic of spread spectrum modulated signals is that their bandwidth is greater than the information rate. In this way a redundancy is introduced that allows the severe levels of inteference inherent in the transmission of digital information over radio and satellite links to be overcome. Current spread spectrum applications are primarily in military communications; nevertheless, there is growing interest in this technique for third generation mobile radio networks (UMTS, FPLTS, etc.) with open discussion regarding the practicality of using a multiple access system based on spread spectrum techniques (CDMA). However, in order to support as many users in the same bandwidth as other multiple access techniques such as TDMA or FDMA, it is important how to generate large families of sequences that present low cross-correlation. The aim of this paper is to describe a spreading codes generator that can produce a large number of PN sequences with good properties of auto- and cross-correlation. Moreover, the codes generated shows high unpredictability and good statistical behaviour. This also allows the implementation of some features that are common on military networks such as message privacy (increasingly important in commercial networks) without additional cost. The structure presented shows itself to be advantageous for high speed generation of codes at a low cost, low power consumption (allowing longer life for batteries), small size and simplicity of implementation, essential ingredients for commercial equipment. Another attractive feature is its structural parallelism, useful in VLSI implementations. All of these features render it potentially suitable for the implementation of channel bandwidth sharing systems in future wireless personal communications networks.