基于子节点编码和声搜索的QoS组播路由算法

传统启发式方法求解QoS组播路由问题复杂度高,收敛速率慢,无法满足实际需求。该文提出一种基于子节点编码的和声搜索算法以解决该问题。在和声搜索算法的基础上,该算法设计了新的初始解及新解生成方式,提升了算法执行效率;提出了参数动态调整方案,兼顾了全局搜索以及局部搜索能力;同时设计了一种基于子节点的组播树编码方式,加快了新解生成过程。通过理论分析仿真实验,证明了该文算法的低复杂度,表明该文算法在收敛速率和代价方面具有明显优势。

全时1:1信源垫播编码系统的建设

本文围绕广西电视台新一代信源编码系统的建设,介绍系统多级1:1冗余备份的整体构架,着重讲述在新型编码设备应用下需要在系统设计上做出的有别于传统的设计思路,并详细说明IPUDP组播传输和信源垫播编码两个创新的应用。

基于分级网络编码的一种数据传输方法

为了降低中间节点在编码计算时需要的有限域的阶,提出了分级网络编码数据传输方法。针对主干网-子网结构的单源组播网络,在连接子网的节点处进行解码,并以该节点为源点,把解码得出的信息采用网络编码数据传输方式组播至子网。理论分析与仿真测试结果表明:与单级网络编码方法相比,该方法可以降低有限域的阶,进而减少网络编码的运算延迟,并能充分地利用网络的带宽。

佛山市高明区“村村响”农村应急广播系统建设

主要阐述了佛山市高明区农村应急广播系统的建设项目,全面介绍了该系统的整体构成、技术实现、功能特点、日常运作、效益发挥等情况,并对系统后续的发展提出了思路。

基于遗传算法的层间等级网络编码优化

面向单信源异构信宿网络,研究了层间等级网络编码的编码类型优化。基于遗传算法,提出了一种最优编码类型的快速搜索方案。该方案充分考虑了信源输出链路上进行的层间等级网络编码的编码类型对整个网络传输性能的影响,将网络总吞吐量作为评价编码类型优劣的标准,设计了符合层间等级网络编码本质特性的遗传操作。实验结果表明,与分层组播网络编码和基于现有启发式算法的层间等级网络编码相比,基于本文方案实现的层间等级网络编码能够为单信源异构信宿网络获得更高的网络总吞吐量。

一个融合组播流媒体系统

文章对目前网络中IP组播流媒体存在组播孤岛和不同接入带宽用户群组播数据不能共享等问题,提出了一种新的流媒体融合组播覆盖网络,研究通过P2P互联不同IP组播区,实现组播数据共享。每一个IP组播区内有一个IP组播源(IP-SM)和一到多个P2P组播源(P2P-SM),所有的IP-SM和P2P-SM组成一个融合组播树,将不同的IP组播区互联。IP组播区内采用网络层组播技术,组播区之间采用应用层组播技术,实现不同组播模式的融合,使流媒体系统具有扩展性和网络适应能力。

Network Coding-based Reliable Broadcast Transmission in Wireless Networks

Recently, network coding has been applied to the loss recovery of reliable broadcast transmission in wireless networks. Since it was proved that fi nding the optimal set of lost packets for XOR-ing is a complex NP-complete problem, the available time-based retransmission scheme and its enhanced retransmission scheme have exponential computational complexity and thus are not scalable to large networks. In this paper, we present an efficient heuristic scheme based on hypergraph coloring and also its enhanced heuristic scheme to improve the transmission efficiency. Basically, our proposed schemes fi rst create a hypergraph according to the packet-loss matrix. Then our schemes solve the problem of generating XORed packets by coloring the edges of hypergraph. Extensive simulation results demonstrate that, the heuristic scheme based on hypergraph coloring and its enhanced scheme can achieve almost the same transmission efficiency as the available ones, but have much lower computational complexity, which is very important for the wireless devices without high computation capacity.

New algorithm for variable-rate linear broadcast network coding

To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.

Science Letters:Peak-power reduction by the lattice-reduction-aided closest point search for MIMO broadcast channels

In this letter, we present a modified vector-perturbation precoding scheme for the multiple-input multiple-output broadcast channel, where a perturbation vector is chosen to take into account both the instantaneous power and the instantaneous peak power of the transmitted signal. This perturbation vector is obtained by using the closest point search, with the aid of the lattice-reduction algorithm. Simulation results show that the proposed scheme yields a tradeoff among power efficiency, peak-to-average power ratio reduction, and complexity.

Hierarchical multicast with inter-layer random network coding

To maximize the aggregate throughput achieved in heterogeneous networks, this paper investigates inter-session network coding for the distribution of layered source data. We define inter-layer hierarchical random linear network codes （IHRLNC）, which not only take the flexibility of intersession network coding for layer mixing but also consider the strict priority inherent in the layered source data. Furthermore, we propose the inter-layer hierarchical multicast （IHM）, which performs IHRLNC in the network such that each sink can recover some source layers according to its individu- al capacity. To determine the optimal type of IHRLNC that should be performed on each edge in IHM, we formulate an optimization problem based on 0-1 integer linear programming, and propose a heuristic approach to approximate the optimal solution in polynomial time. Simulation results show that the proposed IHM can achieve throughput gains over the layered muhicast schemes.

Bag-of-visual-words model for artificial pornographic images recognition

It is illegal to spread and transmit pornographic images over internet,either in real or in artificial format.The traditional methods are designed to identify real pornographic images and they are less efficient in dealing with artificial images.Therefore,criminals turn to release artificial pornographic images in some specific scenes,e.g.,in social networks.To efficiently identify artificial pornographic images,a novel bag-of-visual-words based approach is proposed in the work.In the bag-of-words(Bo W)framework,speeded-up robust feature(SURF)is adopted for feature extraction at first,then a visual vocabulary is constructed through K-means clustering and images are represented by an improved Bo W encoding method,and finally the visual words are fed into a learning machine for training and classification.Different from the traditional BoW method,the proposed method sets a weight on each visual word according to the number of features that each cluster contains.Moreover,a non-binary encoding method and cross-matching strategy are utilized to improve the discriminative power of the visual words.Experimental results indicate that the proposed method outperforms the traditional method.

Multiuser Pre-Coding Aided Quadrature Spatial Modulation for Large-Scale MIMO Channels

Pre-coding aided quadrature spatial modulation(PQSM) is a promising multiple input multiple output(MIMO) transmission technology. The multiuser(MU) detection in PQSM system is investigated in this paper. Based on the known channel state information, pre-coding matrix is designed to pre-process the in-phase and quadrature signals of quadrature spatial modulation(QSM) to reduce the inter-channel interference. In order to lower the complexity at the receiver brought by the orthogonality of the PQSM system, an orthogonal matching pursuit(OMP) detection algorithm and a reconstructed model are proposed. The analysis and simulation results show that the proposed algorithm can obtain a similar bit error rate(BER) performance as the maximum likelihood(ML) detection algorithm with more than 80% reduction of complexity.

MINIMUM-PHASE FIR PRECODER DESIGN FOR MULTICASTING OVER MIMO FREQUENCY-SELECTIVE CHANNELS

To maximize the throughput of frequency-selective multicast channel, the minimum-phase Finite Impulse Response (FIR) precoder design is investigated in this paper. This problem can be solved in two steps. Firstly, we focus on designing a nonminimum-phase FIR precoder under the criterion of maximizing the throughput, and develop two efficient algorithms for the FIR precoder design from perspectives of frequency domain and time domain. In the second step, based on the theory of spectral factorization, the nonminimum-phase FIR precoder is transformed into the corresponding minimum-phase FIR precoder by a classic iterative algorithm without affecting the throughput. Numerical results indicate that the achievable rate of the proposed design has remarkable improvement over that of existing schemes, moreover, the group delay introduced by the FIR precoder is minimized.

Network coding resources optimization with transmission delay constraint in multicast networks

Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To resolve this optimal problem,an integer encoding routing-based genetic algorithm( REGA) is presented to map the optimization problem into a genetic algorithm( GA)framework. Moreover,to speed up the search process of the algorithm,an efficient local search procedure which can reduce the searching space size is designed for searching the feasible solution.Compared with the binary link state encoding representation genetic algorithm( BLSGA),the chromosome length of REGA is shorter and just depends on the number of sinks. Simulation results show the advantages of the algorithm in terms of getting the optimal solution and algorithmic convergence speed.

Efficient Broadcast Retransmission Based on Network Coding for InterPlaNetary Internet

In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).

Efficient network coding-based retransmission algorithm for reliable wireless multicast

Recent research shows using network sion efficiency in wireless networks greatly et for retransmission over composite fading coding for reliable multicast can improve the retransmis- In this paper, we study how to code the composite pack- channels efficiently. For the composite fading environ- ment with muhiple receivers, receivers experience different fading at any time. It＇ s very important to code the composite packet so that intended receivers are in good channel qualities, because in- tended receivers in deep fading have little opportunity to receive the composite packet correctly. Hence, we propose a novel composite packet coding principle of maximizing the total SNR of intend- ed receivers. Since the proposed principle is an NP-complete problem, an efficient heuristic algo- rithm with low complexity is given for finding a suboptimal solution. Simulation results show the heu- ristic based scheme achieves higher transmission efficiency than other network coding-based schemes due to the multi-user diversity gain.

Transmit Antenna Selection in MIMO-OFDM System Based on CO-SFBC Schemes

A transmit antenna selection(TAS)multi-input multi-output orthogonal frequency-division multiplexing(MIMO-OFDM)system based on channel-orthogonalized space-frequency block coding(CO-SFBC)schemes was proposed for better performance.Firstly,the principles and criterions for designing CO-STBC/SFBC schemes with angle feedback were proposed,and then the effect of quantization for the feedback angle information within such schemes was discussed.Meanwhile,the TAS scheme was applied to the system to further improve the overall performance.Simulation results show that the combination of the proposed CO-STBC and TAS schemes can significantly improve the system performance,which is much larger than only applying them to systems individually.

Identity-based Broadcast Encryption with Shorter Transmissions

This paper describes two identity-based broadcast encryption （IBBE） schemes for mobile ad hoc networks. The first scheme proposed achieves sub-linear size cipertexts and the second scheme achieves O（1）- size ciphertexts. Furthermore, when the public keys are transmitted, the two schemes have short transmissions and achieve O（1） user storage cost, which are important for a mobile ad hoc network. Finally, the proposed schemes are provable security under the decision generalized bilinear Diffi-Hellman （GBDH） assumption in the random oracles model.

Photonic quantum network transmission assisted by the weak cross-Kerr nonlinearity

Classical network coding permits all internal nodes to encode or decode the incoming messages over proper fields in order to complete a network multicast. Similar quantum encoding scheme cannot be easily followed because of various quantum no-go theorems. In this paper, to avoid these theorems in quantum multiple-source networks, we present a photonic strategy by exploring quantum transferring approaches assisted by the weak cross-Kerr nonlinearity. The internal node may nearly deterministically fuse all incoming photons into a single photon with multiple modes. The fused single photon may be transmitted using twophotonic hyperentanglement as a quantum resource. The quantum splitting as the inverse operation of the quantum fusion allows forwarding quantum states under the quantum no-cloning theorem. Furthermore, quantum addressing schemes are presented to complete the quantum transmissions on multiple-source networks going beyond the classical network broadcasts or quantum n-pair transmissions in terms of their reduced forms.