arXiv subjects

Bingli Jiao

Publications and source records attributed to Bingli Jiao.

53 records · Page 3Linked to original sources

arXiv2016

Source and Physical-Layer Network Coding for Correlated Two-Way Relaying

In this paper, we study a half-duplex two-way relay channel (TWRC) with correlated sources exchanging bidirectional information. In the case, when both sources have the knowledge of correlation statistics, a source compression with physical-layer network coding (SCPNC) scheme is proposed to perform the distributed compression at each source node. When only the relay has the knowledge of correlation statistics, we propose a relay compression with physical-layer network coding (RCPNC) scheme to compress the bidirectional messages at the relay. The closed-form block error rate (BLER) expressions of both schemes are derived and verified through simulations. It is shown that the proposed schemes achieve considerable improvements in both error performance and throughput compared with the conventional non-compression scheme in correlated two-way relay networks (CTWRNs).

cs.IT↗

arXiv2014

Compressed Relaying for Two-Way Relay Networks with Correlated Sources

In this letter, a compressed relaying scheme via Huffman and physical-layer network coding (HPNC) is proposed for two-way relay networks with correlated sources (TWRN-CS). In the HPNC scheme, both sources first transmit the correlated raw source messages to the relay simultaneously. The relay performs physical-layer network coding (PNC) on the received symbols, compresses the PNC-coded symbols using Huffman coding, and broadcasts the compressed symbols to both source nodes. Then, each source decodes the other source's messages by using its own messages as side information. Compression rate and block error rate (BLER) of the proposed scheme are analyzed. Simulation results demonstrate that the HPNC scheme can effectively improve the network throughput, and meanwhile, achieve the superior BLER performance compared with the conventional non-compressed relaying scheme in TWRN-CS.

cs.IT↗

arXiv2014

Study on Downlink Spectral Efficiency in Orthogonal Frequency Division Multiple Access Systems

In previous studies on the capacity of orthogonal frequency division multiple access (OFDMA) systems, it is usually assumed that co-channel interference (CCI) from adjacent cells is a Gaussian-distributed random variable. However, very-little work shows that the Gaussian assumption does not hold true in OFDMA systems. In this paper, the statistical property of CCI in downlink OFDMA systems is studied, and spectral efficiency of downlink OFDMA system is analyzed based on the derived statistical model. First, the probability density function (PDF) of CCI in downlink OFDMA cellular systems is studied with the considerations of path loss, multipath fading and Gaussian-like transmit signals. Moreover, some closed-form expressions of the PDF are obtained for special cases. The derived results show that the PDFs of CCI are with a heavy tail, and significantly deviate from the Gaussian distribution. Then, based on the derived statistical properties of CCI, the downlink spectral efficiency is derived. Numerical and simulation results justify the derived statistical CCI model and spectral efficiency.

cs.IT↗

arXiv2014

Selective Combining for Hybrid Cooperative Networks

In this study, we consider the selective combining in hybrid cooperative networks (SCHCNs scheme) with one source node, one destination node and $N$ relay nodes. In the SCHCN scheme, each relay first adaptively chooses between amplify-and-forward protocol and decode-and-forward protocol on a per frame basis by examining the error-detecting code result, and $N_c$ ($1\leq N_c \leq N$) relays will be selected to forward their received signals to the destination. We first develop a signal-to-noise ratio (SNR) threshold-based frame error rate (FER) approximation model. Then, the theoretical FER expressions for the SCHCN scheme are derived by utilizing the proposed SNR threshold-based FER approximation model. The analytical FER expressions are validated through simulation results.

cs.IT↗

arXiv2013

A Distributed Differential Space-Time Coding Scheme With Analog Network Coding in Two-Way Relay Networks

In this paper, we consider general two-way relay networks (TWRNs) with two source and N relay nodes. A distributed differential space time coding with analog network coding (DDSTC-ANC) scheme is proposed. A simple blind estimation and a differential signal detector are developed to recover the desired signal at each source. The pairwise error probability (PEP) and block error rate (BLER) of the DDSTC-ANC scheme are analyzed. Exact and simplified PEP expressions are derived. To improve the system performance, the optimum power allocation (OPA) between the source and relay nodes is determined based on the simplified PEP expression. The analytical results are verified through simulations.

cs.IT↗

arXiv2013

Truthful Mechanisms for Secure Communication in Wireless Cooperative System

To ensure security in data transmission is one of the most important issues for wireless relay networks, and physical layer security is an attractive alternative solution to address this issue. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source may select several relays to help forward the signal to the corresponding destination to achieve the best security performance. However, the relays may have the incentive not to report their true private channel information in order to get more chances to be selected and gain more payoff from the source. We propose a Vickey-Clark-Grove (VCG) based mechanism and an Arrow-d'Aspremont-Gerard-Varet (AGV) based mechanism into the investigated relay network to solve this cheating problem. In these two different mechanisms, we design different "transfer payment" functions to the payoff of each selected relay and prove that each relay gets its maximum (expected) payoff when it truthfully reveals its private channel information to the source. And then, an optimal secrecy rate of the network can be achieved. After discussing and comparing the VCG and AGV mechanisms, we prove that the AGV mechanism can achieve all of the basic qualifications (incentive compatibility, individual rationality and budget balance) for our system. Moreover, we discuss the optimal quantity of relays that the source node should select. Simulation results verify efficiency and fairness of the VCG and AGV mechanisms, and consolidate these conclusions.

cs.CR↗

arXiv2013

Relay Selection for Bidirectional AF Relay Network with Outdated CSI

Most previous researches on bidirectional relay selection (RS) typically assume perfect channel state information (CSI). However, outdated CSI, caused by the the time-variation of channel, cannot be ignored in the practical system, and it will deteriorate the performance. In this paper, the effect of outdated CSI on the performance of bidirectional amplify-and-forward RS is investigated. The optimal single RS scheme in minimizing the symbol error rate (SER) is revised by incorporating the outdated channels. The analytical expressions of end-to-end signal to noise ratio (SNR) and symbol error rate (SER) are derived in a closed-form, along with the asymptotic SER expression in high SNR. All the analytical expressions are verified by the Monte-Carlo simulations. The analytical and the simulation results reveal that once CSI is outdated, the diversity order degrades to one from full diversity. Furthermore, a multiple RS scheme is proposed and verified that this scheme is a feasible solution to compensate the diversity loss caused by outdated CSI.

cs.IT↗

arXiv2013

Capacity Analysis of Bidirectional AF Relay Selection with Imperfect Channel State Information

In this letter, we analyze the ergodic capacity of bidirectional amplify-and-forward relay selection (RS) with imperfect channel state information (CSI), i.e., outdated CSI and imperfect channel estimation. Practically, the optimal RS scheme in maximizing the ergodic capacity cannot be achieved, due to the imperfect CSI. Therefore, two suboptimal RS schemes are discussed and analyzed, in which the first RS scheme is based on the imperfect channel coefficients, and the second RS scheme is based on the predicted channel coefficients. The lower bound of the ergodic capacity with imperfect CSI is derived in a closed-form, which matches tightly with the simulation results. The results reveal that once CSI is imperfect, the ergodic capacity of bidirectional RS degrades greatly, whereas the RS scheme based on the predicted channel has better performance, and it approaches infinitely to the optimal performance, when the prediction length is sufficiently large.

cs.IT↗

arXiv2012

Dynamic Popular Content Distribution in Vehicular Networks using Coalition Formation Games

Driven by both safety concerns and commercial interests, vehicular ad hoc networks (VANETs) have recently received considerable attentions. In this paper, we address popular content distribution (PCD) in VANETs, in which one large popular file is downloaded from a stationary roadside unit (RSU), by a group of on-board units (OBUs) driving through an area of interest (AoI) along a highway. Due to high speeds of vehicles and deep fadings of vehicle-to-roadside (V2R) channels, some of the vehicles may not finish downloading the entire file but only possess several pieces of it. To successfully send a full copy to each OBU, we propose a cooperative approach based on the coalition formation games, in which OBUs exchange their possessed pieces by broadcasting to and receiving from their neighbors. Simulation results show that our proposed approach presents a considerable performance improvement relative to the non-cooperative approach, in which the OBUs broadcast randomly selected pieces to their neighbors as along as the spectrum is detected to be unoccupied.

cs.GT↗

arXiv2012

Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.

cs.GT↗

arXiv2012

Physical Layer Security for Two-Way Untrusted Relaying with Friendly Jammers

In this paper, we consider a two-way relay network where two sources can communicate only through an untrusted intermediate relay, and investigate the physical layer security issue of this two-way relay scenario. Specifically, we treat the intermediate relay as an eavesdropper from which the information transmitted by the sources needs to be kept secret, despite the fact that its cooperation in relaying this information is essential. We indicate that a non-zero secrecy rate is indeed achievable in this two-way relay network even without external friendly jammers. As for the system with friendly jammers, after further analysis, we can obtain that the secrecy rate of the sources can be effectively improved by utilizing proper jamming power from the friendly jammers. Then, we formulate a Stackelberg game model between the sources and the friendly jammers as a power control scheme to achieve the optimized secrecy rate of the sources, in which the sources are treated as the sole buyer and the friendly jammers are the sellers. In addition, the optimal solutions of the jamming power and the asking prices are given and a distributed updating algorithm to obtain the Stakelberg equilibrium is provided for the proposed game. Finally, the simulations results verify the properties and the efficiency of the proposed Stackelberg game based scheme.

cs.GT↗

arXiv2011

Performance Analysis of Bidirectional Relay Selection with Imperfect Channel State Information

In this paper, we investigate the performance of bidirectional relay selection using amplify-and-forward protocol with imperfect channel state information, i.e., delay effect and channel estimation error. The asymptotic expression of end-to-end SER in high SNR regime is derived in a closed form, which indicates that the delay effect causes the loss of both coding gain and diversity order, while the channel estimation error merely affects the coding gain. Finally, analytical results are verified by Monte-Carlo simulations.

cs.NI↗

arXiv2011

Performance Analysis of Hybrid Relay Selection in Cooperative Wireless Systems

The hybrid relay selection (HRS) scheme, which adaptively chooses amplify-and-forward (AF) and decode-and-forward (DF) protocols, is very effective to achieve robust performance in wireless networks. This paper analyzes the frame error rate (FER) of the HRS scheme in general cooperative wireless networks without and with utilizing error control coding at the source node. We first develop an improved signal-to-noise ratio (SNR) threshold-based FER approximation model. Then, we derive an analytical average FER expression as well as an asymptotic expression at high SNR for the HRS scheme and generalize to other relaying schemes. Simulation results are in excellent agreement with the theoretical analysis, which validates the derived FER expressions.

cs.IT↗

arXiv2011

Differential Modulation for Bi-directional Relaying with Analog Network Coding

In this paper, we propose an analog network coding scheme with differential modulation (ANC-DM) using amplify-and-forward protocol for bidirectional relay networks when neither the source nodes nor the relay knows the channel state information (CSI). The performance of the proposed ANC-DM scheme is analyzed and a simple asymptotic bit error rate (BER) expression is derived. The analytical results are verified through simulations. It is shown that the BER performance of the proposed differential scheme is about 3 dB away from that of the coherent detection scheme. To improve the system performance, the optimum power allocation between the sources and the relay is determined based on the simplified BER. Simulation results indicate that the proposed differential scheme with optimum power allocation yields 1-2 dB performance improvement over an equal power allocation scheme.

cs.IT↗

arXiv2011

Joint Relay Selection and Analog Network Coding using Differential Modulation in Two-Way Relay Channels

In this paper, we consider a general bi-directional relay network with two sources and N relays when neither the source nodes nor the relays know the channel state information (CSI). A joint relay selection and analog network coding using differential modulation (RS-ANC-DM) is proposed. In the proposed scheme, the two sources employ differential modulations and transmit the differential modulated symbols to all relays at the same time. The signals received at the relay is a superposition of two transmitted symbols, which we call the analog network coded symbols. Then a single relay which has minimum sum SER is selected out of N relays to forward the ANC signals to both sources. To facilitate the selection process, in this paper we also propose a simple sub-optimal Min-Max criterion for relay selection, where a single relay which minimizes the maximum SER of two source nodes is selected. Simulation results show that the proposed Min-Max selection has almost the same performance as the optimal selection, but is much simpler. The performance of the proposed RS-ANC-DM scheme is analyzed, and a simple asymptotic SER expression is derived. The analytical results are verified through simulations.

cs.IT↗

arXiv2011

Joint Relay and Jammer Selection for Secure Two-Way Relay Networks

In this paper, we investigate joint relay and jammer selection in two-way cooperative networks, consisting of two sources, a number of intermediate nodes, and one eavesdropper, with the constraints of physical layer security. Specifically, the proposed algorithms select two or three intermediate nodes to enhance security against the malicious eavesdropper. The first selected node operates in the conventional relay mode and assists the sources to deliver their data to the corresponding destinations using an amplify-and-forward protocol. The second and third nodes are used in different communication phases as jammers in order to create intentional interference upon the eavesdropper node. Firstly, we find that in a topology where the intermediate nodes are randomly and sparsely distributed, the proposed schemes with cooperative jamming outperform the conventional non-jamming schemes within a certain transmitted power regime. We also find that, in the scenario in which the intermediate nodes gather as a close cluster, the jamming schemes may be less effective than their non-jamming counterparts. Therefore, we introduce a hybrid scheme to switch between jamming and non-jamming modes. Simulation results validate our theoretical analysis and show that the hybrid switching scheme further improves the secrecy rate.

cs.IT↗

arXiv2011

Non-cooperative Feedback Rate Control Game for Channel State Information in Wireless Networks

It has been well recognized that channel state information (CSI) feedback is of great importance for dowlink transmissions of closed-loop wireless networks. However, the existing work typically researched the CSI feedback problem for each individual mobile station (MS), and thus, cannot efficiently model the interactions among self-interested mobile users in the network level. To this end, in this paper, we propose an alternative approach to investigate the CSI feedback rate control problem in the analytical setting of a game theoretic framework, in which a multiple-antenna base station (BS) communicates with a number of co-channel MSs through linear precoder. Specifically, we first present a non-cooperative feedback-rate control game (NFC), in which each MS selects the feedback rate to maximize its performance in a distributed way. To improve efficiency from a social optimum point of view, we then introduce pricing, called the non-cooperative feedback-rate control game with price (NFCP). The game utility is defined as the performance gain by CSI feedback minus the price as a linear function of the CSI feedback rate. The existence of the Nash equilibrium of such games is investigated, and two types of feedback protocols (FDMA and CSMA) are studied. Simulation results show that by adjusting the pricing factor, the distributed NFCP game results in close optimal performance compared with that of the centralized scheme.

cs.NI↗