Comprehensive Capacity Ensured Distributed Binary Power Allocation in Dense Cognitive Networks

Considering the capacity gain of the secondary system and the capacity loss of the primary system caused by the newly accessing user, a distributed binary power allocation (admittance criterion) is proposed in dense cognitive networks including plentiful secondary nodes. The case that the secondary nodes can detect both transmitter and receiver of the primary system is analyzed first; considering that it is hard for the secondary system to detect the primary receiver without assuming the cooperation with primary system, the case that the secondary nodes only have the information about the primary transmitter is analyzed thereafter. In particular, we propose a simple estimation strategy to transform the problem of detecting primary receiver to the problem of detecting primary transmitter for the latter case. And a general power allocation scheme which is suitable for both of two cases is proposed afterward. By simulations, the restriction on the distance between secondary transmitter and primary receiver, and the restriction on the distance between secondary and primary transmitters are respectively achieved for the two cases. These two restrictions reflect that the capacities of both primary system and secondary system can be ensured to the predefined extents if these two restrictions on the distances are respectively satisfied in two cases.     

一种基于Web的可靠网络隐蔽时间信道的研究

针对隐蔽时间信道在广域网上无法稳定工作的问题,提出了一种可靠隐蔽时间信道的模型.这种信道利用HTTP协议的网络包的时间间隔作为载体传输隐蔽信息.通过抗干扰处理、接收方确认等方法,设计了可靠的通信协议.采用队列理论对这种可靠隐蔽时间信道进行建模,并推导出了该信道的容量.为了获取该信道的性能指标,在Internet网络中实现了这种可靠隐蔽时间信道,进行了隐蔽信息的数据传输实验.实验结果表明,这种可靠隐蔽时间信道的传输率约为传统隐蔽时间信道的传输率的11倍,在相同的干扰下,可靠隐蔽时间信道的稳定性远好于传统的隐蔽时间信道.     

基于信道估计的物理层安全多天线选择功率分配方案

针对多天线选择方案提高物理层安全的研究中信道已知条件的设定过于理想这一问题,提出利用导频信号估计主信道并进行多天线选择的方案。首先,接收端发送导频信号供发射端进行主信道估计;然后发射端利用估计的信道状态信息选出多根天线并进行功率分配;最后推导所提方案的保密容量并设计仿真实例。结果表明,所提方案在估计误差条件下达成了低信噪比时的非零保密容量,且接收方误码率随信噪比增大急剧减小至10-4,而窃听方的误码率保持较高,验证了所提方案的有效性和可行性。     

多天线Rayleigh衰落相关信道的平均信道容量

研究了空间衰落相关的Rayleigh信道的平均信道容量,其发射端和接收端均采用多天线系统.在实际情况中,接收端有理想的信道状态信息,而发射端没有任何信道信息,因此在各发射天线上采用等功率分配进行发射.本文推导了具有2根发射天线和多根接收天线（TIMO）衰落相关信道的平均信道容量,将其和Monte-Carlo仿真结果比较,并进一步研究空间相关性对信道容量的影响.数值结果表明：信道的空间相关性降低了平均信道容量,而且不同于多入单出（MISO）信道,当信噪比一直增大,由相关性带来的容量损失也增大且不收敛.     

Joint cooperative beamforming and artificial noise design for secure AF relay networks with energy-harvesting eavesdroppers

In this paper, we investigate physical layer security for simultaneous wireless information and power transfer in amplify-and-forward relay networks. We propose a joint robust cooperative beamforming and artificial noise scheme for secure communication and efficient wireless energy transfer. Specifically, by treating the energy receiver as a potential eavesdropper and assuming that only imperfect channel state information can be obtained, we formulate an optimization problem to maximize the worst-case secrecy rate between the source and the legitimate information receiver under both the power constraint at the relays and the wireless power harvest constraint at the energy receiver. Since such a problem is non-convex and hard to tackle, we propose a two-level optimization approach which involves a one-dimensional search and semidefinite relaxation. Simulation results show that the proposed robust scheme achieves better worst-case secrecy rate performance than other schemes.     

A directional MAC protocol with long-range communication ability in ad hoc networks

To address the problem that long-range communication capability in ad hoc networks using directional antenna is not generally utilized,a directional media access control (DMAC) protocol with long-range communication (LRC) capability in ad hoc networks is proposed.In the LRC-DMAC,the intermediate node uses a long-range orientation (LRO) algorithm to help the transmitter obtain the directional information of the receiver which is two hops away.Consequently,the long-range link between such two hops nodes can be set up.According to whether the received power information is available or not,we propose two types of LRO algorithm:without the received power information,a basic LRO obtains the approximate directional informa-tion of the long-range receiver by a geometric relationship;however,the LRO-PI can calculate the accurate directional information of the long-range receiver using the received power.Performance analysis indicates that the LRO algorithm achieves high accuracy when the relevant parameters are properly chosen.Simulation results show that the establishment of long-range links can effectively improve the network throughput and reduce the end-to-end delay.     

MIMO-OFDM系统中基于压缩感知的信道参数反馈方法

为了解决MIMO-OFDM系统中基于完全信道状态信息预编码所面临的反馈链路开销大的问题,提出将压缩感知技术应用于这种预编码的信道状态信息的反馈阶段。在接收端通过压缩感知技术对由信道估计得出的信道状态信息进行观测,将少量的观测值反馈到发送端,在发送端通过正交匹配追踪算法重构出完全信道状态信息。仿真结果表明,信道状态信息在KLT域的压缩感知性能明显优于DCT域的压缩感知性能,可以由反馈到发送端的少量采样值精确地重构出信道状态信息,降低了反馈链路的开销。     

Verification of a multidestination selective repeat procedure

A multidestination protocol is a data transfer procedure from one transmitter to many rceivers. We specify and verify such a protocol, the Selective Repeat procedure. The communication medium assumed is a satellite broadcast channel shared by using a time division multiplexed technique.The Selective Repeat procedure is modeled as a parallel program in a Pascal-like language. Then, we show the correctness of the parallel program model using temporal logic. The correctness requires that the program model have two system properties: the safety and liveness properties. The safety property ensures that each receiver delivers the packets to the user in the same sequence as originally delivered to the transmitter. The liveness property ensures that each receiver delivers an infinite number of packets to the user if an infinite number of packets are waiting to be transmitted at the transmitter.     

On distributed dynamic channel allocation in mobile cellularnetworks

Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem. We establish the exact relationship between the two problems. Specifically, we introduce the problem of relaxed mutual exclusion to model one important aspect of the DDCA problem. We develop a general algorithm that guarantees relaxed mutual exclusion for a single resource and prove necessary and sufficient conditions for the information structure. Considering distributed dynamic channel allocation as a special case of relaxed mutual exclusion, we apply and extend the algorithm to further address the issues that arise in distributed channel allocation such as deadlock resolution, dealing with multiple channels, design of efficient information structures, and channel selection strategies. Based on these results, we propose an example distributed channel allocation scheme using one of the information structures proposed. Analysis and simulation results are provided and show that the results of this research can be used to design more efficient distributed channel allocation algorithms     

OFDM系统中突发模式下的同步及信道估计技术

分析了突发模式的通信体制特点,对采用OFDM技术的高速数据传输系统进行了设计,建立了系统基带发射模型和基带接收模型,重点研究了其中的两项关键技术:同步和信道估计,提出了能够满足突发系统要求的实现算法,并分别通过仿真验证了可行性;最后,在AWGN信道和衰落信道条件下,对运行上述算法的系统进行了综合仿真,给出了系统的误码率性能。     

Optimal channel switching in multiuser systems under average capacity constraints

In this paper, the optimal channel switching problem is studied for average capacity maximization in the presence of multiple receivers in the communication system. First, the optimal channel switching problem is proposed for average capacity maximization of the communication between the transmitter and the secondary receiver while fulfilling the minimum average capacity requirement of the primary receiver and considering the average and peak power constraints. Then, an alternative equivalent optimization problem is provided and it is shown that the solution of this optimization problem satisfies the constraints with equality. Based on the alternative optimization problem, it is obtained that the optimal channel switching strategy employs at most three communication links in the presence of multiple available channels in the system. In addition, the optimal strategies are specified in terms of the number of channels employed by the transmitter to communicate with the primary and secondary receivers. Finally, numerical examples are provided in order to verify the theoretical investigations.     

基于联合收发权值优化的认知雷达MIMO-STAP

研究了认知雷达中多收多发空时自适应处理(MIMO-STAP)联合收发权值优化问题。提出了一种在收发两端联合空时自适应处理(JSTAP)的方法,该方法通过对收发权值联合寻优以获得最优的信干噪比。分析了受发射权值影响的杂波协方差矩阵结构,并基于此建立了MIMO-STAP的权值迭代更新结构。其权值迭代更新步骤为:固定发射权值,求解优化模型得到接收权值;然后固定接收权值,根据杂波协方差矩阵与发射权值的关系,得到发射权值;返回接收权值优化步骤,循环迭代以获得最优收发权值。仿真实验结果表明在慢速目标环境中,联合空时处理与常规空时处理相比,有效提高了接收端的信干噪比。     

空时分组编码在多入多出系统中的容量分析

研究瑞利衰落信道下正交空时分组编码的信道容量,针对收端已知信道状态信息(CSI)以及收发两端均知CSI的2种情况,给出相应的容量分析及计算公式的推导。在收端已知CSI情况下,采用泰勒级数展开方法,给出一种信道容量的近似表达式,该式可有效简化原有精确公式的计算,获得与真实值非常相似的结果。在收发两端均知CSI情况下,提出一种基于最陡下降算法的简单计算方法,用于求解最优中断门限值,该方法可避免原有求解方法的大量搜索和计算。仿真结果表明,所给出的信道容量精确表达式以及近似表达式均与相应的计算机仿真结果一致,从而验证了所推公式的有效性。     

Distributed power adjustment based on control theory for cognitive radio networks

In this paper, we propose two power adjustment methods for cognitive radio networks. In the first algorithm, the transmitter derives the transmission power with PID control in order to satisfy the QoS constraints in secondary networks. The derived transmission power is compared with a constraint condition in order to avoid the interference with primary networks, and then the actual transmission power is decided. Because the constraint condition affects the performance of our proposed method significantly, we propose an effective update algorithm. On the other hand, the second algorithm is based on model predictive control (MPC). In this method, the decision of transmission power is formulated as quadratic programming (QP) problem and the transmission power is derived directly with the constraint condition. We evaluate the performances of our proposed methods with simulation and compare the proposed methods with the distributed power control (DPC) method. In numerical examples, we show that our proposed methods are more effective than the existing method in some situations. We also prove analytically that the interference with primary networks can be avoided with probability one by using our proposed method if each transmitter has the information about every channel gain.     

信道反馈延迟的V-BLAST系统功率分配算法

针对信道反馈的延迟问题,以降低误比特率(BER)为优化目标,提出一种适用于垂直分层空时编码系统的自适应发送功率分配算法。假设接收端可以得到完全的信道状态信息,并通过反馈链路将信道信息反馈至发送端。在接收端采用迫零检测算法,给出系统瞬时信噪比(SNR)与估计SNR的表达式推导过程,根据系统瞬时SNR的条件概率密度函数求出系统总BER的表达式;发送端在总功率约束条件下,采用拉格朗日极值法计算出自适应功率分配矩阵的闭式解。仿真结果表明,当归一化反馈迟延因子等于0.000 1、误比特率为10~(-3)时,该算法的系统性能比等功率分配算法提高约5 dB。     

On the end-to-end flow allocation and channel assignment in multi-channel multi-radio wireless mesh networks with partially overlapped channels

The performance of wireless mesh networks (WMNs) can be improved significantly with the increase in number of channels and radios. Despite the availability of multiple channels in several of the current wireless standards, only a small fraction of them are non-overlapping and many channels are partially overlapped. In this paper, we formulate the joint channel assignment and flow allocation problem for multi-channel multi-radio WMNs as a Mixed Integer Linear Program (MILP). Unlike most of the previous studies, we consider the case when both non-overlapped and partially overlapped channels are being used. We consider an objective of maximizing aggregate end-to-end throughput and minimizing queueing delay in the network, instead of the sum of link capacities, since the traffic characteristics of a multi-hop WMN are quite different from a single hop wireless network. Our static channel assignment algorithm incorporates network traffic information, i.e., it is load aware. Our formulation takes into consideration several important network parameters such as the transmission power of each node, path loss information, the signal to interference plus noise ratio at a node, and the frequency response of the filters used in the transmitter and receiver. We show by simulations that our MILP formulation makes efficient use of the spectrum, by providing superior channel assignments and flow allocations with the addition of partially overlapped channels, without the use of any additional spectrum. We also justify the need to consider alternative objective functions such as, minimizing average queueing in the network. We also propose a polynomially bounded heuristic algorithm to scale the proposed algorithm to bigger network topologies.     

Collision-Aware Rate Adaptation in multi-rate WLANs: Design and implementation

Many rate adaptation algorithms have been proposed for IEEE 802.11 Wireless LAN devices and most of them operate in an open-loop manner, i.e., the transmitter adapts its transmission rate without using the feedback from the receiver. A key problem with such transmitter-based rate adaptation schemes is that they do not consider the collision effect. Accordingly, they often result in severe throughput degradation when many transmission failures are due to frame collisions. In this paper, we present a transmitter-based rate adaptation scheme, called CARA (Collision-Aware Rate Adaptation), and its MadWifi-based implementation. The key idea of CARA is that the transmitter combines adaptively the RTS/CTS (Request-to-Send/Clear-to-Send) exchange with the CCA (Clear Channel Assessment) functionality in order to differentiate frame collisions from transmission failures due to channel errors. The effectiveness of CARA schemes is evaluated via extensive ns-2 simulations and testbed experimentations.     

Molecular communication via diffusion with spherical receiver & transmitter and trapezoidal container

Molecular communication is a new paradigm that works on the principle of the discharge of molecules as carriers of information. The channel of molecular communication is determined by the signal that is received. The designs of the receiver, the modulation, coding, and capacity rely on the models of the received signal. Therefore, it is difficult to model the number of the received modules (until the time t) using an analytical approach. Indeed, communication through molecular diffusion is ubiquitous. In particular, the present, closed form of the impulse response of the diffusion channel usually perceives the transmitter as a source point. This research attempts to develop molecular communication via diffusion through a spherical transmitter and receiver and trapezoidal container. The study has been conducted in two parts. These parts include dataset generation using a probability distribution, and the modelling of the received signal – using a multitude of machine learning (ML) techniques. In this study the code is executed using Python language. In addition, the study utilizes deep neural networks, support vector regression, logistic regression, and ridge regression to model the received signal for a spherical transmitter before comparing the performance of all the models. The results of the study have been compared in terms of the models’ accuracy to determine the best performing approach. The proposed techniques offer promising results for modelling the received molecules number until time. The proposed technique models the received signal efficiently for longer distances.     

Data detection in relay-based communication systems using Bayesian methods

Data detection in a relay-based communication system (RCS) is challenging because its end-to-end channel, which comprises a cascade of several channels, has unique statistical characteristics. Assuming different channel conditions, in this paper, we address the problem of data detection in an RCS where one amplify-and-forward relay is used as an intermediate node between a transmitter and a receiver. Our approach is based on Bayesian methodologies in which a variant of Markov Chain Monte Carlo (MCMC) technique, known as Metropolis–Hasting-within-Gibbs, is applied for systems with quasi-static channel models, whereas particle filtering technique is used for systems with fast varying channels to develop joint data detection and channel estimation algorithms. By providing detailed derivations, we present two algorithms for each channel condition by formulating the transmission process of the communication systems in different ways. The effectiveness of our algorithms is demonstrated through computer simulations.     

A chaotic communication system of improved performance based on the Derivative-free nonlinear Kalman filter

The Derivative-free nonlinear Kalman Filter is used for developing a communication system that is based on a chaotic modulator such as the Duffing system. In the transmitter’s side, the source of information undergoes modulation (encryption) in which a chaotic signal generated by the Duffing system is the carrier. The modulated signal is transmitted through a communication channel and at the receiver’s side demodulation takes place, after exploiting the estimation provided about the state vector of the chaotic oscillator by the Derivative-free nonlinear Kalman Filter. Evaluation tests confirm that the proposed filtering method has improved performance over the Extended Kalman Filter and reduces significantly the rate of transmission errors. Moreover, it is shown that the proposed Derivative-free nonlinear Kalman Filter can work within a dual Kalman Filtering scheme, for performing simultaneously transmitter–receiver synchronisation and estimation of unknown coefficients of the communication channel.