Multiplexed harmonic broadcasting scheme for efficient video-on-demand services

Periodic broadcasting schemes can improve the efficiency of video-on-demand (VOD) services by reducing the bandwidth requirement to transmit popular videos. The harmonic broadcasting scheme has the best performance in reducing service bandwidth under a given access time, but it uses too many channels. However, a multiplexed harmonic broadcasting scheme that overcomes this drawback is now proposed. This scheme divides each video into equal-sized segments and then broadcasts segments periodically in a small number of sever channels with equal bandwidth. The idea of segment-to-channel mapping in the scheme is inspired by the time division multiplexing system. Each segment is divided equally into several subsegments; subsegments of different segments are multiplexed in a slot with the guarantee of being able to keep playing out continuously for every user. The proposed scheme outperforms the pagoda broadcasting and recursive frequency splitting schemes in reducing the viewers' maximum waiting time, and the scheme requires less client storage     

一种基于节目流行度的自适应流调度方案

提出了一种基于节目流行度的自适应流调度方案。该方案根据节目点播请求的强度自适应地调整分配给节目的信道数和带宽,并给出了在信道数改变过程中如何实现信道平滑过渡的方法。该方案综合了周期广播算法和流合并算法的优点。实验表明,采用此方案,在点播请求很少时能获得同流分并算法（如补丁算法）一样的性能,在点播请求很多时又有和周期广播算法一样少的服务带宽要求。     

acSB: Anti-Collision Selective-Based Broadcast Protocol in CR-AdHocs

As a fundamental operation in ad hoc networks, broadcast could achieve efficient message propagations. Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels, broadcasts are carried out on multiple channels. Accordingly, channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting. In this paper, an anti-collision selective broadcast protocol, called acSB, is proposed. A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel. Moreover, an anti-collision scheme is adopted to avoid simultaneous rebroadcasts. Consequently, the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay, higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.     

Dynamic Proofs of Retrievability Based on Partitioning-Based Square Root Oblivious RAM

With the development of cloud storage, the problem of efficiently checking and proving data integrity needs more consideration. Therefore, much of growing interest has been pursed in the context of the integrity verification of cloud storage. Provable data possession (PDP) and Proofs of retrievablity (POR) are two kinds of important scheme which can guarantee the data integrity in the cloud storage environments. The main difference between them is that POR schemes store a redundant encoding of the client data on the server so as to she has the ability of retrievablity while PDP does not have. Unfortunately, most of POR schemes support only static data. Stefanov et al. proposed a dynamic POR, but their scheme need a large of amount of client storage and has a large audit cost. Cash et al. use Oblivious RAM (ORAM) to construct a fully dynamic POR scheme, but the cost of their scheme is also very heavy. Based on the idea which proposed by Cash, we propose dynamic proofs of retrievability via Partitioning-Based Square Root Oblivious RAM (DPoR-PSR-ORAM). Firstly, the notions used in our scheme are defined. The Partitioning-Based Square Root Oblivious RAM (PSR-ORAM) protocol is also proposed. The DPOR-PSR-ORAM Model which includes the formal definitions, security definitions and model construction methods are described in the paper. Finally, we give the security analysis and efficiency analysis. The analysis results show that our scheme not only has the property of correctness, authenticity, next-read pattern hiding and retrievabiltiy, but also has the high efficiency.     

Dimensional scalable lossless compression of MRI images using haar wavelet lifting scheme with EBCOT

Modern medical imaging requires storage of large quantities of digitized clinical data. To provide high bandwidth and to reduce the storage space, a medical image must be compressed before transmission. One of the best image compression techniques is using the Haar wavelet transform. The method of discrete cosine transform (DCT) is chosen to be the preprocessing scheme to identify the image frequency information and has excellent energy compaction property. The block coding algorithm uses a wavelet transform to generate the sub band samples, which can be quantized and coded. It is more robust to errors than many other wavelet‐based schemes. In this article, simulations are carried out on different medical Images and it demonstrates the performance in terms of peak signal to noise ratio (PSNR) & bits per pixel (BPP). Our proposed method is found to preserve information fidelity while reducing the amount of data. © 2014 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 24, 175–181, 2014     

EA-RDSP: Energy Aware Rapidly Deployable Wireless Ad hoc System for Post Disaster Management

In post disaster scenarios such as war zones floods and earthquakes, the cellular communication infrastructure can be lost or severely damaged. In such emergency situations, remaining in contact with other rescue response teams in order to provide inputs for both headquarters and disaster survivors becomes very necessary. Therefore, in this research work, a design, implementation and evaluation of energy aware rapidly deployable system named EA-RDSP is proposed. The proposed research work assists the early rescue workers and victims to transmit their location information towards the remotely located servers. In EA-RDSP, two algorithms are proposed i.e., Hop count Assignment (HCA) algorithm and Maximum Neighbor Selection (MNS) algorithm. The EA-RDSP contains three types of nodes; the client node sends information about casualty in the disaster area to the server, the relay nodes transmit this information from client node to server nodes via multi-hop transmission, the server node receives messages sent by client node to alert rescue teams. The EAM-RDSP contains three types of nodes; the client node sends information about casualty in the disaster area to the server, the relay nodes transmit this information from client node to server nodes via multi-hop transmission, the server node receives messages sent by client node to alert rescue teams. The proposed EA-RDSP scheme is simulated using NS-2 simulator and its performance is compared with existing scheme in terms of end-to-end delay, message delivery ratio, network overhead and energy consumption.     

一种应用于FM IBOC DAB系统的比特交织编码调制方案

提出了一种适用于FM IBOC广播系统的比特交织编码调制方案。此方案结合互补增信删余卷积码(CPPC)和基于迭代译码的比特交织编码调制(BICM-ID)算法。互补增信删余卷积码能有效抵抗FM IBOC系统中面对的第一邻频干扰和无线信道噪声、衰落等干扰。同时,运用基于软判决反馈迭代译码的比特交织编码调制算法,可以不通过扩展频带来提高FM IBOC广播系统在瑞利信道中的编码增益。仿真结果表明,本方案能有效提高FM IBOC广播系统的接收性能。     

基于最大化信干噪比的广播信道干扰消除算法

研究了广播信道分布式干扰消除算法的性能,提出了一种基于动态功率分配的多天线广播干扰信道对齐算法.该算法利用多用户多天线干扰信道相关矩阵的迹来计算分配功率,并采用最大化码流信干噪比的方法来得到预编码矩阵和接收滤波器矩阵.数值仿真表明,该动态功率分配算法与等功率分配算法相比,尽管低负荷下干扰对齐后的平均信干噪比增益不明显,但中、高负荷下其干扰对齐后的平均信干噪比大幅提高,特别是高负荷下可以解决等功率方法存在的信干噪比瓶颈效应.由于低负荷的应用需求并不强烈,因而该算法是一种实用的广播信道干扰消除方法.     

Experimental evaluation of a bandwidth allocation scheme for foundation fieldbus

Operation of the data link layer of the foundation fieldbus is based on scheduling and token-passing disciplines. This paper presents a network design for the foundation fieldbus protocol using a bandwidth allocation scheme. Fieldbus traffic consists of periodic data and sporadically generated time-critical and time-available data. The bandwidth allocation scheme schedules the transmission of periodic data. Time-critical and time-available data are transmitted via a token-passing service. The validity of this bandwidth allocation scheme was determined using an experimental model of a network system. The results obtained from the model show that the proposed scheme restricted the delay of both periodic and time-critical data to a pre-specified bound. The proposed bandwidth allocation scheme also fully utilized the bandwidth resources of the network system.     

Cluster-Based Stable BSM Dissemination System for Safe Autonomous Platooning

Recently, the importance of vehicle safety supporting system has been highlighted as autonomous driving and platooning has attracted the researchers. To ensure driving safety, each vehicle must broadcast a basic safety message (BSM) every 100 ms. However, stable BSM exchange is difficult because of the changing environment and limited bandwidth of vehicular wireless communication. The increasing number of vehicles on the road increases the competition to access wireless networks for BSM exchange; this increases the packet collision rate. An increased packet collision rate impairs the transmission and reception of BSM information, which can easily cause a traffic accident. We propose a solution, the vehicular safety support system (V3S), which exchanges BSMs reliably even when many vehicles are on the road. The V3S uses a clustering scheme to decrease network traffic by reducing the amount of data exchanged between a vehicle and the roadside unit (RSU). In addition, the V3S reduces the collision rate of wireless network packets by broadcasting the vehicle's BSM in an allocated timeslot using the time division multiple access (TDMA) MAC protocol. The V3S also deals with insufficient bandwidth for dedicated short-range communications (DSRC) by changing DSRC channels according to traffic flow. In evaluating the packet error rate for stable BSM packet delivery, the V3S demonstrates an excellent packet error rate of less than 1%, compared to the 802.11p with its packet error rate of 82%.     

Effective transmission opportunity allocation scheme for real-time variable bit rate traffic flows with different delay bounds

The medium access control of IEEE 802.11e defines a novel coordination function, namely, hybrid coordination function (HCF), which allocates transmission opportunity (TXOP) to stations taking their quality of service (QoS) requirements into account. However, the reference TXOP allocation scheme of HCF controlled channel access, a contention-free channel access function of HCF, is only suitable for constant bit rate traffic. For variable bit rate traffic, packet loss may occur seriously. The authors propose a TXOP allocation scheme to efficiently allocate bandwidth and meet the QoS requirements in terms of both delay bound and packet loss probability. To achieve high bandwidth efficiency, the authors take advantage of not only intra-flow multiplexing gain of traffic flows with large delay bounds, but also inter-flow multiplexing gain of multiple traffic flows with different delay bounds. According to numerical results obtained by computer simulations, the proposed TXOP allocation scheme results in much higher bandwidth efficiency than previous algorithms under the same constraints of delay bounds and packet loss probability.     

Optimisation of limited feedback design for heterogeneous users in multi-antenna downlinks

The authors study the problem of limited channel information feedback in multiple-input single-output (MISO) broadcast channels serving heterogeneous users. The heterogeneous users have different feedback channel capacities because of their physical constraints and limitations. Our objective is to design an optimised limited feedback strategy for multiple users by using a set of multi-resolution codebooks such that, under varying and quantised channel information feedback, the multiuser system can maximise its achievable sum rate. By exploiting the receive antenna combining technique, the authors further generalise the proposed scheme to the multiuser beamforming case with multi-antenna users. Finally, the authors verify the proposed scheme by numerical methods. Simulation results show that the sum rate performance for heterogeneous users can be effectively improved by using the proposed limited feedback scheme, which is optimised according to only statistic channel information of users.     

Error recovery in video transmission over CDMA2000 broadcast networks

Multimedia services over a CDMA2000 broadcast network face a challenge from the unreliable and error-prone nature of the radio channel. Reed-Solomon (RS) coding, integrated with the MAC protocol, is used to cope with this problem. However, performance analysis of RS coding under varying channel conditions shows that it is not always effective, especially for slow-moving nodes which experience relatively long error bursts. Therefore a more efficient scheme is proposed that uses a RS code with reduced parity overhead, and freeing bandwidth can be used flexibly for retransmission. The packets to be retransmitted are prioritised by a utility function derived from the map of the error control block at each mobile node and the number of mobile nodes that require the lost packet. Simulation results show that the gain of retransmission exceeds the loss incurred by reducing the parity, leading to an improvement in the playback quality of MPEG-4 video streams. As a result, service area for high-quality multimedia can be expanded.     

Lattice-Based Searchable Encryption Scheme against Inside Keywords Guessing Attack

To save the local storage, users store the data on the cloud server who offers convenient internet services. To guarantee the data privacy, users encrypt the data before uploading them into the cloud server. Since encryption can reduce the data availability, public-key encryption with keyword search (PEKS) is developed to achieve the retrieval of the encrypted data without decrypting them. However, most PEKS schemes cannot resist quantum computing attack, because the corresponding hardness assumptions are some number theory problems that can be solved efficiently under quantum computers. Besides, the traditional PEKS schemes have an inherent security issue that they cannot resist inside keywords guessing attack (KGA). In this attack, a malicious server can guess the keywords encapsulated in the search token by computing the ciphertext of keywords exhaustively and performing the test between the token and the ciphertext of keywords. In the paper, we propose a lattice-based PEKS scheme that can resist quantum computing attacks. To resist inside KGA, this scheme adopts a lattice-based signature technique into the encryption of keywords to prevent the malicious server from forging a valid ciphertext. Finally, some simulation experiments are conducted to demonstrate the performance of the proposed scheme and some comparison results are further shown with respect to other searchable schemes.     

Predictive closed-loop power control scheme with comb-type sample arrangement for code division multiple access cellular networks

The authors present and analyse a predictive closed-loop power control (CLPC) scheme, which employs a comb-type sample arrangement to effectively compensate multiple power control group delays over mobile fading channels. The authors consider both least squares and recursive least squares filters in our CLPC scheme. The effects of channel estimation error, prediction filter error and power control bit transmission error on the performance of the proposed CLPC method along with competing non-predictive and predictive CLPC schemes are thoroughly investigated. The results clearly indicate the superiority of the proposed scheme with its improved robustness under non-ideal conditions. Furthermore, the authors carry out a Monte-Carlo simulation study of a 5%5 square grid cellular network and evaluate the user capacity. Capacity improvements up to 90% are observed for a typical cellular network scenario.     

HARQ Optimization for PDCP Duplication-Based 5G URLLC Dual Connectivity

Packet duplication (PD) with dual connectivity (DC) was newly introduced in the 5G New Radio (NR) specifications to meet the stringent ultra reliable low latency communication (URLLC) requirements. PD technology uses duplicated packets in the packet data convergence protocol (PDCP) layer that are transmitted via two different access nodes (ANs) to the user equipment (UE) in order to enhance the reliability performance. However, PD can result in unnecessary retransmissions in the lower layers since the hybrid automatic retransmission request (HARQ) operation is unaware of the transmission success achieved through the alternate DC link to the UE. To overcome this issue, in this paper, a novel duplication-aware retransmission optimization (DRO) scheme is proposed to reduce the resource usage induced by unnecessary HARQ retransmissions. The proposed DRO scheme can minimize the average channel use while satisfying the URLLC requirements. The proposed DRO scheme derives the optimal HARQ retransmission attempts for different ANs by solving a nonlinear integer programming (NLIP) problem. The performance of the proposed DRO scheme was evaluated using MATLAB simulation and is compared to the existing 5G HARQ support schemes. The simulations results show that the proposed DRO scheme can provide a 14.71% and 15.11% reduced average channel use gain compared to the selective data duplication upon failure (SDUF) scheme and latency-aware dynamic multi-connectivity algorithm (LADMA) scheme, respectively, which are the existing 5G PD schemes that use HARQ.     

A cooperative turbo coding scheme for wireless fading channels

A coded cooperative transmission scheme based on turbo encoding/decoding, in which only newly generated parity bits of the partner are sent if the user successfully decodes its partner's information in order to improve bandwidth efficiency is proposed. The proposed encoding structure introduces correlation between users' data over multiple frames, which offers effectively longer codes and facilitates high-performance iterative multi-user decoding at the destination. Additionally, the iterative decoding over multiple frames can provide time diversity besides spatial diversity inherent in user cooperation even for flat block fading channels. Simulation results show that the proposed scheme significantly outperforms direct transmission for the same transmitted power and bandwidth efficiency.     

A Proxy Re-Encryption with Keyword Search Scheme in Cloud Computing

With the widespread use of cloud computing technology, more and more users and enterprises decide to store their data in a cloud server by outsourcing. However, these huge amounts of data may contain personal privacy, business secrets and other sensitive information of the users and enterprises. Thus, at present, how to protect, retrieve, and legally use the sensitive information while preventing illegal accesses are security challenges of data storage in the cloud environment. A new proxy re-encryption with keyword search scheme is proposed in this paper in order to solve the problem of the low retrieval efficiency of the encrypted data in the cloud server. In this scheme, the user data are divided into files, file indexes and the keyword corresponding to the files, which are respectively encrypted to store. The improved scheme does not need to re-encrypt partial file cipher-text as in traditional schemes, but re-encrypt the cipher-text of keywords corresponding to the files. Therefore the scheme can improve the computational efficiency as well as resist chosen keyword attack. And the scheme is proven to be indistinguishable under Hash Diffie-Hellman assumption. Furthermore, the scheme does not need to use any secure channels, making it more effective in the cloud environment.     

Fractional M-band dual tree complex wavelet transform for digital watermarking

In this paper, a novel digital watermarking scheme using fractional M-band dual tree complex wavelet transform (Fr-M-band-DT-CWT) is proposed. High frequency channels have wide bandwidth and low frequency channels have narrow bandwidth. These characteristics are suitable for analysing low frequency signal, but not for relatively high frequency signal. The images often contain many edges, which may cause rich middle and high frequency components in the 2-band wavelet domain. Therefore, the ordinary 2-band dual tree complex wavelet transform (DT-CWT) is not well-suited for analysing the image. So, the M-band DT-CWT with the FrFT called Fr-M-band-DT-CWT is proposed in this paper to address this problem. Further, we integrate the Fr-M-Band-DT-CWT with singular value decomposition (SVD) in order to enhance the performance. Experimental results of the proposed watermarking scheme are compared with the previously available watermarking algorithms, fractional Fourier transform (FrFT), fractional wavelet transform (FrWT). Further, the proposed watermark extraction scheme is also tested on different attacks. The results of the present investigations show that the proposed watermarking scheme is superior as compared to other existing watermarking schemes.     

Precoded orthogonal frequency division multiplexing with hidden pilots for ultrawideband wireless communications

The authors propose a new hidden pilot scheme equipped with precoding and its application to orthogonal frequency division multiplexing-ultra-wideband (OFDM-UWB) systems. The proposed scheme can be thought of as an improvement over conventional hidden pilot schemes. By carefully designing precoder and hidden pilot from the view point of frequency diversity, channel estimation and the peak-to-average power ratio (PAPR), more frequency diversity gain and reduced PAPR can be achieved. In addition, the authors can support more pilots to estimate a channel providing mitigated self-interference between data symbol and hidden pilot with almost no loss of bandwidth efficiency in OFDM-based UWB communication systems. The authors show improved performance of the proposed scheme over the multiband OFDM scheme through simulations in a realistic UWB channel environment.