Time diversity scheme and adaptive signal clipping with blanking applied to G3 systems for narrowband power‐line communications

In this paper, an investigation into the behavior of modern narrowband power‐line communication systems when concatenated with both a fountain code named Luby transform code and a combination of nonlinear preprocessing techniques called signal clipping with blanking is presented. The new systems can be used in applications such as the automatic meter reading component of smart grid technology. Testing is performed on a range of systems provided by the G3 standard and the results show that a bit error rate improvement can be achieved with the correct encoder/decoder settings. The recommended settings include an adaptive technique that uses Gaussian elimination for Luby transform code decoding and code rates that depend on the system specifications used. From there, it is shown that a further improvement is achieved when both the Luby transform code and adaptive signal clipping/blanking based on signal power are combined. It is found that these modifications present a complexity trade‐off, which is higher on the receiver side. This added complexity can be well‐tolerated in automatic meter‐reading systems because of the star topology and asymmetric nature of the network, which has a centralized agent acting as a receiver that collects data from various transmitter nodes.     

Efficient wireless multicast retransmission using network coding

In wireless multicast,network coding has recently attracted attentions as a substantial improvement to packet retransmission schemes.However,the problem of finding the optimal network code which minimizes the retransmissions is hard to solve or approximate.This paper presents two schemes to reduce the number of retransmissions for reliable multicast efficiently.One is retransmission using network coding based on improved Vandermonde matrix(VRNC),the other is retransmission using network coding based on adaptive improved Vandermonde matrix(AVRNC).Using VRNC scheme the sender selects the packets all receivers have lost and encodes them with improved Vandermonde matrix;when receivers receive enough encoded retransmission packets,all the lost packets can be recovered.With AVRNC scheme,the sender can obtain the recovery information from all the receivers after sending out per retransmission packet,and then the improved Vandermonde matrix can be updated,thus reducing the complexity of encoding and decoding.Our proposed schemes can achieve the theoretical lower bound assuming retransmission packets lossless,and approach the theoretical lower bound considering retransmission packets loss.Simulation results show that the proposed algorithms can efficiently reduce the number of retransmissions,thus improving transmission efficiency.     

Space–time coding for broadband wireless communications

The development of broadband wireless communication systems must cope with various performance‐limiting challenges that include channel fading as well as size and power limitations at the mobile units. As a promising method dealing with these challenges, space–time coding is effective in supporting reliable, high‐data‐rate transmissions: the major goal in broadband wireless communications. A survey of space–time coding schemes is provided in this paper. Targeting broadband wireless communications, the focus is on space–time coding in the presence of frequency‐ and time‐selective fading and the associated channel estimation and symbol recovery algorithms for both single user and multiuser settings. Copyright © 2001 John Wiley & Sons, Ltd.     

单频网多播系统中的开环半动态功率分配算法

在单频网多播传输中,传统的全反馈动态功率分配数算法需要根据每个时隙反馈的用户瞬时信道信息进行实时的调整,所以造成了资源分配频率快、上行反馈开销大的缺点。为了克服这个缺点,提出了一个低复杂度、没有用户反馈的单频网多播开环半动态功率分配算法。首先在各小区等功率分配的假设下,根据单频网的形状信息算出各小区等价信道增益,然后再根据这个增益值,实现满足速率需求情况下的各小区功率分配。仿真结果显示,与全反馈的动态功率分配算法相比,该算法以一小部分性能损失为代价,大大减少了单频网的上行反馈和资源分配的开销,因此更适用于实际的单频网多播系统。     

A novel key management scheme for dynamic multicast communications

Secure multicasting allows the sender to deliver an identical secret to an arbitrary set of recipients through an insecure broadcasting channel, whereas the unintended recipients cannot obtain the secret. A practical approach for securing multicast communications is to apply a session key to encrypt the transmitted data. However, the challenges of secure multicast are to manage the session keys possessed by a dynamic group of recipients and to reduce the overhead of computation and transmission when the membership is changed. In this paper, we propose a new key management scheme for dynamic multicast communication, which is based on privacy homomorphism and Chinese remainder theorem. Our scheme can efficiently and securely deliver an identical message to multiple recipients. In particular, the complexity of the key update process in our scheme is O(1). Copyright © 2008 John Wiley & Sons, Ltd.     

Minimum coding nodes multicast tree for two-channel all-optical network coding scheme

A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented.To minimize the coding nodes,the heuri...     

An integrated routing and admission control mechanism for real‐time multicast connection establishment

There are two major difficulties in real‐time multicast connection setup. One is the design of an efficient distributed routing algorithm which optimizes the network cost of routing trees under the real‐time constraints. The other is the integration of routing with admission control into one single phase of operations. This paper presents a real‐time multicast connection setup mechanism, which integrates multicast routing with real‐time admission control. The proposed mechanism performs the real‐time admission tests on a cost optimal tree (COT) and a shortest path tree (SPT) in parallel, aiming at optimizing network cost of the routing tree under real‐time constraints. It has the following important features: (1) it is fully distributed; (2) it achieves sub‐optimal network cost of routing trees; (3) it takes less time and less network messages for a connection setup. Copyright © 2001 John Wiley & Sons, Ltd.     

Efficient use of DS/CDMA signals for broadband communications over power lines

This paper investigates the use of direct‐sequence/code‐division multiple access (DS/CDMA) signals for broadband communications over power lines. Each user is assumed to utilize all available spreading codes for sending the information to the destination. The transmitter and the receiver are assumed to have perfect channel knowledge with the receiver employing a zero‐forcing multiuser detector. Based on channel knowledge we attempt to maximize the data throughput by suitable choice of the number of codes used and the power and the constellation size (bit‐load) assigned to the data modulating each spreading code. We employ Gold codes, in addition to special codes derived based on the channel knowledge for ISI minimization, termed ‘eigen codes’. In contrast to some earlier results concerning CDMA and OFDM, we show that DS/CDMA signals can be optimized to achieve an overall data throughput of approximately 80% of that achieved by OFDM systems. This result shows that DS/CDMA signaling can be a good candidate for broadband power line communications. Copyright © 2011 John Wiley & Sons, Ltd.     

Comparison of coded orthogonal frequency division multiplexing and multicarrier code division multiple access systems for power line communications

Orthogonal frequency division multiplexing (OFDM) and multicarrier code division multiple access (MC‐CDMA) systems are comparatively evaluated for power line communications (PLC) in a frequency‐selective fading environment with additive coloured Gaussian noise which is used to model the actual in‐home power line channel. OFDM serves as a benchmark in order to measure the performance of various MC‐CDMA systems, since multicarrier modulation systems are considered the best candidate for this kind of channel. Both single‐user and multi‐user cases are taken into account, making use of the appropriate combiner schemes to take full advantage of each case. System efficiency is enhanced by the application of different coding techniques, a fact which shows that powerful coding can make the difference under such a hostile medium. The impact of block interleaving is investigated, while the simulation examines how different modulation schemes fair under the imposed channel conditions as well. The performance of the system is assessed by the commonly used bit error rate vs signal‐to‐noise ratio diagrams and there is also a comparison regarding throughput efficiency among all the tested systems. As stated in Section 4, a promising PLC application is attained. Copyright © 2004 John Wiley & Sons, Ltd.     

A fast bit-loading algorithm for high speed power line communications

Adaptive bit-loading is a key technology in high speed power line communications with the Orthogonal Frequency Division Multiplexing (OFDM) modulation technology. According to the real situation of the transmitting power spectrum limited in high speed power line communications, this paper explored the adaptive bit loading algorithm to maximize transmission bit number when transmitting power spectral density and bit error rate are not exceed upper limit. With the characteristics of the power line channel, first of all, it obtains the optimal bit loading algorithm, and then provides the improved algorithm to reduce the computational complexity. Based on the analysis and simulation, it offers a non-iterative bit allocation algorithm, and finally the simulation shows that this new algorithm can greatly reduce the computational complexity, and the actual bit allocation results close to optimal.     

基于网络编码的非等长多播数据分发策略

提出了一种新的编码数据分发算法,该算法通过收集每个多播路径簇上承载业务信息的带宽,来确定编码后数据的分发策略,使编码节点能够对带宽不相同的数据进行处理并在解码节点正确解码,从而更加贴近现实网络.仿真结果表明,该算法在资源消耗和网络均衡方面较传统的多播算法有更好的表现.     

电源线通信系统的可能发展

简述了在住家电源线上实行数据通信的可能发展前途。首先，较全面地说明了住家电源线的通路特性，以表示它们用于供给电力的同时，也有可能传送通信信号，籍以实现电源线通信(PLC)。接着，介绍电源线实行通信所必需的调制、编码和接入等技术。     

WDM网络组播连接保护切换时间分析

保护切换时间是衡量一个网络保护方案性能优劣的重要指标之一.文章给出了一种波分复用(WDM)网络中组播连接的保护切换模型,并在此基础上对目前主要的组播连接保护方案的保护切换时间做了理论上的分析和比较,这些方案包括link-disjoint保护、arc-disjoint保护和段保护.同时,结合各方案的连接阻塞率,对各方案的总体性能做了简要的分析.     

基于稀疏贝叶斯学习的电力线载波通信接收机设计

针对多径信道和脉冲噪声对电力线载波通信系统性能影响的问题,提出了一种能有效对抗多径信道和脉冲噪声影响的电力线通信系统接收机设计方案.该方案将时域上的电力线信道参数和脉冲噪声联合视作稀疏向量,然后利用稀疏贝叶斯理论联合估计电力线信道和脉冲噪声,从而在接收端得以去除脉冲噪声及补偿信道增益.仿真结果表明,与传统将信道估计与脉冲噪声抑制单独考虑的传统接收机相比,本文提出的接收机方案在误符号率和误比特率等性能指标上有较好的提升.     

A source authentication scheme based on message recovery digital signature for multicast

The source authentication is an important issue for the multicast applications because it can let the receiver know whether the multicast message is sent from a legal source or not. However, the previously related schemes did not provide the confidentiality for data packets. In addition, the communication costs of these schemes are still high for real‐time applications in the multicast environments. To solve the aforementioned problems, we propose a new source authentication scheme based on message recovery signature for multicast in this paper. In the proposed scheme, the encrypted data can be embedded in the digital signature, so the communication loads can be greatly reduced. In addition, the digital signature contains the encrypted data, and thus the confidentiality of data packets can be well protected. According to the aforementioned advantages, the proposed scheme is securer and more efficient than the related works for the real‐time applications. Copyright © 2013 John Wiley & Sons, Ltd.     

Confronting the performances of a switched Ethernet network with industrial constraints by using the network calculus

The Ethernet network is more and more used to interconnect industrial devices. The objective of this paper is to study the performances of such a network to support real‐time communications. For this, first we propose a general representation to model a switched Ethernet network by using a sequence of elementary components such as buffers, multiplexers, etc. Second, we aggregate the individual temporal properties of each component given in the Cruz' survey to obtain a global formula enabling one to calculate the maximum end‐to‐end delay for any industrial communication scenarios. Finally, we deduce the limits of the switched Ethernet network regarding the number of input/output cards connected to the network and to the sizes of periodic and aperiodic messages. Copyright © 2005 John Wiley & Sons, Ltd.     

Space–time coding and signal processing for high data rate wireless communications

The information capacity of wireless communication systems can be increased dramatically by employing multiple transmit and receive antennas [Foschini GJ, Gans MJ. On limits of wireless communications in a fading environment when using multiple antennas. Wireless Communications Magazine 1998; 6 311–335. Telatar E. Capacity of Multi‐Antenna Gaussian Channels, Technical Memorandum, AT&T Bell Laboratories, 1995.] An effective approach to increasing data rate over wireless channels is to employ coding techniques appropriate to multiple transmit antennas, that is space–time coding. Space–time codes introduce temporal and spatial correlation into signals transmitted from different antennas, in order to provide diversity at the receiver, and coding gain over an uncoded system. The spatial–temporal structure of these codes can be exploited to further increase the capacity of wireless systems with a relatively simple receiver structure. This paper provides an overview of space–time coding techniques and the associated signal processing framework. Copyright © 2001 John Wiley & Sons, Ltd.     

一种时延受限的低代价移动IP组播路由算法

基于固定和移动IP混合网络，针对时延敏感的实时通信业务，建立了网络模型，提出了有时延约束的低代价组播路由问题，给出了一种分布启发式组播路由算法，证明了算法的正确性，分析了算法的复杂度。仿真结果表明，算法是有效的、稳定的。     

Mode selection schemes for unicasting device‐to‐device communications supported by network coding

Device‐to‐device (D2D) communication in a cellular spectrum increases the spectral and energy efficiency of local communication sessions, while also taking advantage of accessing licensed spectrum and higher transmit power levels than when using unlicensed bands. To realize the potential benefits of D2D communications, appropriate mode selection algorithms that select between the cellular and D2D communication modes must be designed. On the other hand, physical‐layer network coding (NWC) at a cellular base station—which can be used without D2D capability—can also improve the spectral efficiency of a cellular network that carries local traffic. In this paper, we ask whether cellular networks should support D2D communications, physical‐layer NWC, or both. To this end, we study the performance of mode selection algorithms that can be used in cellular networks that use physical‐layer NWC and support D2D communications. We find that the joint application of D2D communication and NWC scheme yields additional gains compared with a network that implements only one of these schemes, provided that the network implements proper mode selection and resource allocation algorithms. We propose 2 mode selection schemes that aim to achieve high signal‐to‐interference‐plus‐noise ratio and spectral efficiency, respectively, and take into account the NWC and D2D capabilities of the network.     

Clustering strategies for multicast precoding in multibeam satellite systems

Next generation multibeam SatCom architectures will heavily exploit full frequency reuse schemes along with interference management techniques, eg, precoding or multiuser detection, to drastically increase the system throughput. In this framework, we address the problem of the user selection for multicast precoding by formulating it as a clustering problem. By introducing a novel mathematical framework, we design fixed/variable size clustering algorithms that group users into simultaneously precoded and served clusters while maximising the system throughput. Numerical simulations are used to validate the proposed algorithms and to identify the main system‐level trade‐offs.