An Efficient Routing Scheme Based on Node Attributes for Opportunistic Networks in Oceans

Along with the fast development of the marine economy and ever-increasing human activities, handy and reliable marine networking services are increasingly required in recent years. The ocean faces challenges to support cost-effective communication due to its special environments. Opportunistic networks with easy deployment and self-curing capability are expected to play an important role to adapt to such dynamic networking environments. In the literature, routing schemes for opportunistic networks mainly exploit node mobility and local relaying technologies. They did not take into account the impact of node behaviors on encountering opportunities and in case of no further relaying, network performance would be greatly degraded. To solve the problem, we propose an efficient routing scheme based on node attributes for opportunistic networks. We first construct delivery competency to predict the further relay nodes. Then a forwarding willingness mechanism is introduced to evaluate the relaying probability combining device capacity and movement behaviors of nodes. Finally, the utility metric is used to make decisions on message forwarding. The results show that the proposed scheme improves network performance in terms of delivery ratio, average latency, and overhead ratio as compared to other schemes.     

Half-duplex relaying with serially concatenated low-density generator matrix (SCLDGM) codes

Recently, the integration of cooperation with coding has proven to be a very useful technique to enhance relay system performance. Relay systems based on low-density parity-check (LDPC) codes have the potential to approach the theoretical information limits very closely. However, LDPC codes have a disadvantage in that the encoding complexity is high. To solve this problem, serially concatenated low-density generator matrix (SCLDGM) codes are attracting attention owing to their low encoding complexity. However, the performance of SCLDGM coded relaying has not been investigated. In this paper, we apply SCLDGM codes to relay channel with the motivation of lowering the encoding complexity. Since SCLDGM codes are concatenated codes, we cannot use the same method as LDPC coded relaying. We propose a new relaying system and three cooperation protocols suited for SCLDGM codes. Computer simulation results show that the bit error rate (BER) performance of the proposed system is equal to that of conventional LDPC coded relaying system.     

Performance of two-hop infrastructure based multi-antenna regenerative relaying in Rayleigh fading channel

Cooperative relaying is considered as an effective technique to enlarge the coverage area and enhance the system capacity for the future wireless systems. In this paper, an infrastructure based multi-antenna cooperative relay network has been investigated. Closed form expressions of outage probability and average error rate have been derived, when the relay and the destination perform selection combining of the signals. The relay is assumed to operate in the adaptive decode and forward mode. The effect of number of antennas installed on the relay and their placement has also been studied.     

Joint physical network coding and LDPC decoding for two way wireless relaying

In this paper, we investigate the joint design of channel and network coding in bi-directional relaying systems and propose a combined low complexity physical network coding and LDPC decoding scheme. For the same LDPC codes employed at both source nodes, we show that the relay can decode the network coded codewords from the superimposed signal received from the BPSK-modulated multiple-access channel. Simulation results show that this novel joint physical network coding and LDPC decoding method outperforms the existing MMSE network coding and LDPC decoding method over the AWGN and complex MAC channel.     

Cooperative diversity using per-user power control in the MAC channel

We consider a multiple access MAC fading channel with two users communicating with a common destination, where each user mutually acts as a relay for the other one as well as wishes to transmit its own information as opposed to having dedicated relays. We wish to evaluate the usefulness of relaying from the point of view of the system’s throughput (sum rate) rather than from the sole point of view of the user benefiting from the cooperation as is typically done. We do this by allowing a trade-off between relaying and fresh data transmission through a resource allocation framework. Specifically, We propose a cooperative transmission scheme allowing each user to allocate a certain amount of power for its own transmitted data while the rest is devoted to relaying. The underlying protocol is based on a modification of the so-called non-orthogonal amplify-and-forward (NAF) protocol Azarian et al. [18]. We develop capacity expressions for our scheme and derive the rate-optimum power allocation, in closed form for centralized and distributed frameworks. In the distributed scenario, partially statistical and partially instantaneous channel information is exploited.The centralized power allocation algorithm indicates that even in a mutual cooperation setting like ours, on any given realization of the channel, cooperation is never truly mutual, i.e. one of the users will always allocate zero power to relaying the data of the other one, and thus act selfishly. But in a distributed framework, our results indicate that the sum rate is maximized when both mobiles act selfishly.     

多跳噪声量子纠缠信道特性及最佳中继协议

在量子通信网络中, 最佳中继路径的计算与选择策略是影响网络性能的关键因素. 针对噪声背景下量子隐形传态网络中的中继路径选择问题, 本文首先研究了相位阻尼信道及振幅阻尼信道上的纠缠交换过程, 通过理论推导给出了两种多跳纠缠交换信道上的纠缠保真度与路径等效阻尼系数. 在此基础上提出以路径等效阻尼系数为准则的隐形传态网络最佳中继协议, 并给出了邻居发现、量子链路噪声参数测量、量子链路状态信息传递、中继路径计算与纠缠资源预留等工作的具体过程. 理论分析与性能仿真结果表明, 相比于现有的量子网络路径选择策略, 本文方法能获得更小的路径平均等效阻尼系数及更高的隐形传态保真度. 此外, 通过分析链路纠缠资源数量对协议性能的影响, 说明在进行量子通信网设计时, 可以根据网络的规模及用户的需求合理配置链路纠缠资源.     

Route selection for interference minimization to primary users in cognitive radio ad hoc networks: A cross layer approach

An opportunistic routing problem in a cognitive radio ad hoc network is investigated with an aim to minimize the interference to primary users (PUs) and under the constraint of a minimum end-to-end data rate for secondary users (SUs). Both amplify-and-forward (AF) and decode-and-forward (DF) relaying techniques are considered for message forwarding by SU nodes in the network. Unlike popular transmit power control based solutions for interference management in cognitive radio networks, we adopt a cross layer approach. The optimization problem is formulated as a joint power control, channel assignment and route selection problem. Next, closed form expression for transmission power is derived and corresponding channel selection scheme and routing metric are designed based on this solution. The proposed route selection schemes are shown to depend not only on gains of the interference channels between SUs and PUs but also on the values of the spectrum sensing parameters at the SU nodes in the network. Two distributed routing schemes are proposed based on our analysis; (i) optimal_DF and (ii) suboptimal_AF. The routing schemes could be implemented using existing table driven as well as on demand routing protocols. Extensive simulation results are provided to evaluate performance of our proposed schemes in random multihop networks. Results show significant reduction in PUs’ average interference experience and impressive performance as opportunistic routing schemes can be achieved by our schemes compared to traditional shortest path based routing schemes. Performance improvement is also reported over prominent recent schemes.     

Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-m fading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics.     

基于动力中继的小世界复杂电机网络混沌同步控制

利用链式结构中间节点参数不匹配能降低两个非直接相连外部节点的同步耦合强度临界值,促进两节点同步的特性,对一个双向耦合的小世界电机网络进行同步控制.首先从外部增加参数不匹配的中继节点,通过动力中继降低整个网络的同步耦合强度阈值,从而促进整个电机网络的同步,然后分析动力中继如何作用于网络,最后用数值仿真验证该方法的有效性.     

Power and rate control in wireless communication systems with energy harvesting and rateless codes

In this paper, for a wireless communication system with energy harvesting and rateless error correction codes, the joint optimization of transmit power, modulation scheme and code rate to maximize the long-term average achievable transmission rate under the constraint of available energy is studied. The method is given first to determine the codeword length (or code rate) for a signal-to-noise ratio (SNR) under the constraint of a pre-defined decoding error probability. Then the formula of the actual transmission rate is deduced with a specific modulation and code rate, and the optimization problem to maximize the long-term average actual transmission rate is constructed under the constraints of available harvested energy and the decoding complexity of the rateless code. Since energy harvesting and channel fading are both stochastic processes, the optimization problem is difficult to solve. By using the Lyapunov optimization framework, the original long-term optimization problem is transformed into a per time slot one. Then an efficient numerical method is proposed to obtain the solution to the problem. The proposed algorithm is verified by simulation, and the results show that the proposed algorithm can achieve a higher average actual transmission rate than the comparison algorithms aiming at optimizing the channel capacity.     

Cache-assisted relay selection algorithm based on incentive cooperation

An unrealistic preset condition exists in the cache-assisted relay system, namely that the social attributes of all nodes are highly overlapping and similar. In practice, however, this prerequisite is frequently not fulfilled because nodes exhibit a certain degree of selfishness. This paper, therefore, proposes a cache-assisted relay selection algorithm based on incentive cooperation to resolve the problem of system performance degradation precipitated by differences in the social attributes of nodes in cache-assisted networks. By incorporating the contribution of nodes to the system, nodes with poor social attributes are encouraged to participate in optimizing feedback effects actively. Nodes with high competition function values have a higher priority for information storage and transmission, improve the participation of low-attribute nodes, and attenuate the impact of channel changes, thereby enhancing network sustainability and system efficiency.     

基于(火积)耗散率最小的“盘点”冷却流道构形优化

基于构形理论, 以(火积)耗散率最小为优化目标, 对冷却流道的“盘点”传热问题进行构形优化, 得到冷却流道的圆盘构造体最优构形. 结果表明: 对于扇形单元体, 在其泵功率给定的条件下, 存在最佳展弦比使得扇形单元体无量纲当量热阻取得最小值; 对于一级树状圆盘, 在其总泵功率给定的条件下, 存在一级与单元级最佳流道宽度比和扇形单元体最佳无量纲半径使 得一级树状圆盘无量纲当量热阻取得最小值, 且一级与单元级最佳流道宽度比仅与单元体分支数有关. 当中心圆盘半径等于0时, 一级树状圆盘最终退化成辐射状圆盘, 此时一级树状圆盘半径为临界半径. 当一级树状圆盘半径大于临界半径时, 需对圆盘冷却流道采用树状布置, 反之则采用辐射状布置. 存在最佳单元体分支数使得无量纲当量热阻取得最小值, 这与高导热材料通道的“盘点”导热构形优化结果有明显区别. (火积)耗散率最小和最大温差最小的一级树状冷却流 道圆盘构造体最优构形是不同的. 与最大温差最小的冷却流道圆盘构造体相比, (火积)耗散率最小的冷却流道圆盘构造体当量热阻得到极大降低, 其整体传热性能得到明显提高. 因此, (火积)耗散极值原理与对流构形优化相结合, 有助于进一步揭示(火积)耗散极值原理在传热优化方面的优越性. 关键词： 构形理论 (火积)耗散率 冷却流道 广义热力学优化     

OFDM水声通信系统中基于中继选择的资源分配算法

针对水声通信中继系统中系统容量和中继选择问题,本文提出了一种基于中继选择的资源分配算法。首先将每条中继链路的信道增益等效为虚拟直传链路的信道增益,然后在等功率分配的前提下,根据信道信息最佳原则,提出了一种中继选择及资源分配的多用户迭代算法,以实现对每个用户的传输链路进行选择和子载波分配,最后通过线性迭代注水算法进行功率分配。仿真结果表明,所提算法在保证目标速率的前提下,提升了系统容量。     

Joint MMSE designs for analog network coding and different MIMO relaying schemes: A unified approach and performance benchmarks

To gain understanding of the analog network coding and different MIMO relaying schemes and to facilitate the scheme selection, there is a need for a unified approach and performance benchmarks. In this paper, analog network coding, direct transmission, Two-Hop relaying, and cooperative relaying schemes are analyzed and compared. A unified approach, the novel generalized iterative approach, is proposed for jointly designing the MMSE MIMO processors (including precoders, relay processors and decoders) for these schemes. Numerical results show that for each scheme, there exist system and channel parameter regime(s) where it is the most desirable among the four schemes. Performance benchmarks, physical insights and some guidelines for MIMO relaying scheme selection are presented.     

On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel

We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion. We derive single-letter inner and outer bounds for the zero-error capacity region, based on random coding, linear programming, linear codes, and the asymptotic spectrum of graphs. Among others, we provide a single-letter outer bound based on a combination of Shannon’s vanishing-error capacity region and a two-way analogue of the linear programming bound for point-to-point channels, which, in contrast to the one-way case, is generally better than both. Moreover, we establish an outer bound for the zero-error capacity region of a two-way channel via the asymptotic spectrum of graphs, and show that this bound can be achieved in certain cases.     

Network capacity of cognitive radio relay network

After successful dynamic spectrum access, cognitive radio (CR) must be able to relay the message/packets to the destination node by utilizing existing primary system(s) (PS) and/or cooperative/cognitive radio nodes in the cognitive radio network. In this paper, we pioneer the exploration of the fundamental behaviors of interference between CRs and PS in such a relay network via network coding. Interference on PS’s network capacity is shown to be unavoidable and unbounded in the one-hop relay network. Extending to the tandem structure, interference is unbounded but avoidable by appropriate constraints. In cooperative relay network, interference is bounded and avoidable. Moreover, parallel cooperative relay network can accommodate more CR transmission pairs. Such an analysis can be generalized to arbitrary networks. We derive that interference is avoidable when at least one route from CR’s source to the sink bypasses the bottlenecks of PS. Then under the constraint of no interference to PS, we derive CR’s maximum network capacity in such a network. Link allocation to achieve the maximum network capacity can be formulated and solved as a linear programming problem. Consequently, given any network topology, we can determine whether CR’s interference is avoidable, and maximize CR’s network capacity without interfering PS’s network capacity. Simulation results on randomly generated network topologies show that CR’s network capacity achieves on average 1.3 times of PS’s network capacity with interference avoidance constraint, and demonstrates spectrum efficiency at networking throughput and high availability.     

Outage Performance of Wireless Powered Decode-and-Forward Relaying Networks in Rician Fading

This paper investigates the outage performance of simultaneous wireless information and power transfer (SWIPT)-enabled relay networks with the decode-and-forward relaying protocol, where the effect of the energy triggering threshold at the relay on the system performance is considered. The closed-form expressions of the system outage probability and throughput are derived in Rician channel fading. Monte Carlo Simulation method is used to verify the accuracy of the derived closed-form expressions. The effects of some system parameters on the system performances are discussed via simulations, which show that the system outage probability increases with the increase of the minimum transmission rate required by the users and also decreases with the increase of the energy conversion efficiency. Besides, the system throughput increaseswith the increment of the transmit power of the source node, as well as the energy conversion efficiency. Additionally, the outage performance of the system with the equal two-hop distance is better than that of the system with unequal two-hop distance.     

Time allocation improvement method for UAV-based wireless energy transfer cooperative mobile edge

Wireless power transfer (WPT) and mobile edge computing (MEC) are two advanced technologies that could improve the computing power and range of mobile devices. However, by integrating the unmanned aerial vehicle (UAV) into wireless powered MEC systems, wireless energy transfer will be susceptible to the “double near–far” effect. Therefore, in order to further overcome the influence of the “double near–far” effect, this paper considers the optimization of time slot allocation for UAV-assisted wireless powered cooperative MEC system, which includes an access point (UAV) and two mobile devices. The purpose of the study is to minimize the total transmission energy of the UAV while satisfying the delay and size of the computational tasks, so this paper proposed a 2:1:1 time-slot optimization allocation method. The method exploits the synergy of users so that the mobile device which is closer to the UAV acts as an offloading relay, by combining power and time slot optimization to minimize the total energy consumption of the UAV. Compared with the equal time slot scheme before the improvement, this method can not only utilize the wireless transmission energy to charge the mobile device for more time in the first period, but also can save the time of data transmission of the closer device in the third period, and it can enhance the rate of data transmission of the mobile devices at the same time. The results show that the task capacity of the system computed will be increased compared to the original scheme; the total transmission rate of the whole system is also improved by the same order of magnitude. The simulation results verify the effectiveness and reliability of the algorithm of the paper, and the comprehensive performance of the system can be maximized by the flexible offloading algorithm.     

URLLC-oriented secure communication for UAV relay-assisted network

In this paper, we investigate the unmanned aerial vehicle (UAV) relay-assisted secure short packet communication. The UAV acts as a decode-and-forward relay to transmit control signals from the source to the actuators in the presence of a ground eavesdropper (EV) whose imperfect channel state information is available at the UAV. Specially, non-orthogonal multiple access is adopted in our work to achieve more connections and improve the fairness of communication and the short packets are employed for data transmission to reduce the latency. Explicitly, we maximize the minimum average secrecy throughput among all actuators by jointly optimizing the UAV trajectory, transmit power and blocklength allocation, which generates a challenging optimization problem. Therefore, we propose an iterative algorithm based on block coordinate descent method and successive convex approximation technique to handle the non-convex problem. Numerical results show that the proposed scheme has better performance compared to the benchmark schemes.     

Performance analysis of PDMA-based hybrid satellite–terrestrial networks with decode-and-forward relaying

As one of the most promising non-orthogonal multiple access (NOMA) technologies in 5G communication, pattern division multiple access (PDMA) has theoretically higher spectrum utilization and a larger communication capacity than conventional orthogonal multiple access (OMA) technologies. In this letter, PDMA is applied to hybrid satellite–terrestrial networks with decode-and-forward (DF) relaying in the downlink, and an in-depth study on the performance of outage probability (OP), ergodic capacity and system throughput is performed. For a more comprehensive analysis, hybrid satellite–terrestrial relay networks (HSTRNs) with conventional OMA technology are used in the comparative analysis. Analysis and simulation results show that PDMA-based hybrid satellite–terrestrial relay networks outperform the other system in terms of OP and ergodic capacity.