arXiv subjects

Lingyang Song

Publications and source records attributed to Lingyang Song.

At least 109 records · Page 6Linked to original sources

arXiv2017

Short-Packet Two-Way Amplify-and-Forward Relaying

This letter investigates an amplify-and-forward two-way relay network (TWRN) for short-packet communications. We consider a classical three-node TWRN consisting of two sources and one relay. Both two time slots (2TS) scheme and three time slots (3TS) scheme are studied under the finite blocklength regime. We derive approximate closed-form expressions of sum-block error rate (BLER) for both schemes. Simple asymptotic expressions for sum-BLER at high signal-to-noise ratio (SNR) are also derived. Based on the asymptotic expressions, we analytically compare the sum-BLER performance of 2TS and 3TS schemes, and attain an expression of critical blocklength, which can determine the performance superiority of 2TS and 3TS in terms of sum-BLER. Extensive simulations are provided to validate our theoretical analysis. Our results discover that 3TS scheme is more suitable for a system with lower relay transmission power, higher differences between the average SNR of both links and relatively lower requirements on data rate and latency.

cs.IT↗

arXiv2017

Non-orthogonal Multiple Access for High-reliable and Low-latency V2X Communications

In this paper, we consider a dense vehicular communication network where each vehicle broadcasts its safety information to its neighborhood in each transmission period. Such applications require low latency and high reliability, and thus, we propose a non-orthogonal multiple access scheme to reduce the latency and to improve the packet reception probability. In the proposed scheme, the BS performs the semi-persistent scheduling to optimize the time scheduling and allocate frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control. We formulate the centralized scheduling and resource allocation problem as equivalent to a multi-dimensional stable roommate matching problem, in which the users and time/frequency resources are considered as disjoint sets of players to be matched with each other. We then develop a novel rotation matching algorithm, which converges to a q-exchange stable matching after a limited number of iterations. Simulation results show that the proposed scheme outperforms the traditional orthogonal multiple access scheme in terms of the latency and reliability.

cs.NI↗

arXiv2017

Antenna Selection in MIMO Non-orthogonal Multiple Access Systems

This paper considers the joint antenna selection (AS) problem for a classical two-user MIMO non-orthogonal multiple access (NOMA) system, where both the base station (BS) and users (UEs) are equipped with multiple antennas. Specifically, several computationally-efficient AS algorithms are developed for two commonly-used NOMA scenarios: fixed power allocation NOMA (F-NOMA) and cognitive radio-inspired NOMA (CR-NOMA). For the F-NOMA system, two novel AS schemes, namely max-max-max AS (A$^3$-AS) and max-min-max AS (AIA-AS), are proposed to maximize the system sum-rate, without and with the consideration of user fairness, respectively. In the CR-NOMA network, a novel AS algorithm, termed maximum-channel-gain-based AS (MCG-AS), is proposed to maximize the achievable rate of the secondary user, under the condition that the primary user's quality of service requirement is satisfied. The asymptotic closed-form expressions of the average sum-rate for A$^3$-AS and AIA-AS and that of the average rate of the secondary user for MCG-AS are derived, respectively. Numerical results demonstrate that the AIA-AS provides better user-fairness, while the A$^3$-AS achieves a near-optimal sum-rate in F-NOMA systems. For the CR-NOMA scenario, MCG-AS achieves a near-optimal performance in a wide SNR regime. Furthermore, all the proposed AS algorithms yield a significant computational complexity reduction, compared to exhaustive search-based counterparts.

cs.IT↗

arXiv2017

Realtime Profiling of Fine-Grained Air Quality Index Distribution using UAV Sensing

Given significant air pollution problems, air quality index (AQI) monitoring has recently received increasing attention. In this paper, we design a mobile AQI monitoring system boarded on unmanned-aerial-vehicles (UAVs), called ARMS, to efficiently build fine-grained AQI maps in realtime. Specifically, we first propose the Gaussian plume model on basis of the neural network (GPM-NN), to physically characterize the particle dispersion in the air. Based on GPM-NN, we propose a battery efficient and adaptive monitoring algorithm to monitor AQI at the selected locations and construct an accurate AQI map with the sensed data. The proposed adaptive monitoring algorithm is evaluated in two typical scenarios, a two-dimensional open space like a roadside park, and a three-dimensional space like a courtyard inside a building. Experimental results demonstrate that our system can provide higher prediction accuracy of AQI with GPM-NN than other existing models, while greatly reducing the power consumption with the adaptive monitoring algorithm.

eess.SP↗

arXiv2017

Game Theoretic Approaches to Massive Data Processing in Wireless Networks

Wireless communication networks are becoming highly virtualized with two-layer hierarchies, in which controllers at the upper layer with tasks to achieve can ask a large number of agents at the lower layer to help realize computation, storage, and transmission functions. Through offloading data processing to the agents, the controllers can accomplish otherwise prohibitive big data processing. Incentive mechanisms are needed for the agents to perform the controllers' tasks in order to satisfy the corresponding objectives of controllers and agents. In this article, a hierarchical game framework with fast convergence and scalability is proposed to meet the demand for real-time processing for such situations. Possible future research directions in this emerging area are also discussed.

cs.DC↗

arXiv2017

Non-Cash Auction for Spectrum Trading in Cognitive Radio Networks: A Contract Theoretical Model with Joint Adverse Selection and Moral Hazard

In cognitive radio networks (CRNs), spectrum trading is an efficient way for secondary users (SUs) to achieve dynamic spectrum access and to bring economic benefits for the primary users (PUs). Existing methods requires full payment from SU, which blocked many potential "buyers", and thus limited the PU's expected income. To better improve PUs' revenue from spectrum trading in a CRN, we introduce a financing contract, which is similar to a sealed non-cash auction that allows SU to do a financing. Unlike previous mechanism designs in CRN, the financing contract allows the SU to only pay part of the total amount when the contract is signed, known as the down payment. Then, after the spectrum is released and utilized, the SU pays the rest of payment, known as the installment payment, from the revenue generated by utilizing the spectrum. The way the financing contract carries out and the sealed non-cash auction works similarly. Thus, contract theory is employed here as the mathematical framework to solve the non-cash auction problem and form mutually beneficial relationships between PUs and SUs. As the PU may not have the full acknowledgement of the SU's financial status, nor the SU's capability in making revenue, the problems of adverse selection and moral hazard arise in the two scenarios, respectively. Therefore, a joint adverse selection and moral hazard model is considered here. In particular, we present three situations when either or both adverse selection and moral hazard are present during the trading. Furthermore, both discrete and continuous models are provided in this paper. Through extensive simulations, we show that the adverse selection and moral hazard cases serve as the upper and lower bounds of the general case where both problems are present.

cs.NI↗

arXiv2017

Hypergraph Theory: Applications in 5G Heterogeneous Ultra-Dense Networks

Heterogeneous ultra-dense network (HUDN) can significantly increase the spectral efficiency of cellular networks and cater for the explosive growth of data traffic in the fifth-generation (5G) communications. Due to the dense deployment of small cells (SCs), interference among neighboring cells becomes severe. As a result, the effective resource allocation and user association algorithms are essential to minimize inter-cell interference and optimize network performance. However, optimizing network resources in HUDN is extremely complicated as resource allocation and user association are coupled. Therefore, HUDN requires low-complexity but effective resource allocation schemes to address these issues. Hypergraph theory has been recognized as a useful mathematical tool to model the complex relations among multiple entities. In this article, we show how the hypergraph models can be used to effectively tackle resource allocation problems in HUDN. We also discuss several potential research issues in this field.

cs.IT↗

arXiv2017

V2X Meets NOMA: Non-Orthogonal Multiple Access for 5G Enabled Vehicular Networks

Benefited from the widely deployed infrastructure, the LTE network has recently been considered as a promising candidate to support the vehicle-to-everything (V2X) services. However, with a massive number of devices accessing the V2X network in the future, the conventional OFDM-based LTE network faces the congestion issues due to its low efficiency of orthogonal access, resulting in significant access delay and posing a great challenge especially to safety-critical applications. The non-orthogonal multiple access (NOMA) technique has been well recognized as an effective solution for the future 5G cellular networks to provide broadband communications and massive connectivity. In this article, we investigate the applicability of NOMA in supporting cellular V2X services to achieve low latency and high reliability. Starting with a basic V2X unicast system, a novel NOMA-based scheme is proposed to tackle the technical hurdles in designing high spectral efficient scheduling and resource allocation schemes in the ultra dense topology. We then extend it to a more general V2X broadcasting system. Other NOMA-based extended V2X applications and some open issues are also discussed.

cs.IT↗

arXiv2017

Full-duplex Amplify-and-Forward Relaying: Power and Location Optimization

In this paper, we consider a full-duplex (FD) amplify-and-forward (AF) relay system and optimize its power allocation and relay location to minimize the system symbol error rate (SER). We first derive the asymptotic expressions of the outage probability and SER performance by taking into account the residual self interference (RSI) in FD systems. We then formulate the optimization problem based on the minimal SER criterion. Analytical and numerical results show that optimized relay location and power allocation can greatly improve system SER performance, and the performance floor caused by the RSI can be significantly reduced via optimizing relay location or power allocation.

cs.IT↗

arXiv2017

D2D-U: Device-to-Device Communications in Unlicensed Bands for 5G and Beyond

Device-to-Device (D2D) communication, which enables direct communication between nearby mobile devices, is an attractive add-on component to improve spectrum efficiency and user experience by reusing licensed cellular spectrum in 5G system. In this paper, we propose to enable D2D communication in unlicensed spectrum (D2D-U) as an underlay of the uplink LTE network for further booming the network capacity. A sensing-based protocol is designed to support the unlicensed channel access for both LTE and D2D users. We further investigate the subchannel allocation problem to maximize the sum rate of LTE and D2D users while taking into account their interference to the existing Wi-Fi systems. Specifically, we formulate the subchannel allocation as a many-to-many matching problem with externalities, and develop an iterative user-subchannel swap algorithm. Analytical and simulation results show that the proposed D2D-U scheme can significantly improve the system sum-rate.

cs.NI↗

arXiv2017

Resource Management in Non-orthogonal Multiple Access Networks for 5G and Beyond

Non-orthogonal multiple access (NOMA) schemes have been proposed for the next generation of mobile communication systems to improve the access efficiency by allowing multiple users to share the same spectrum in a non-orthogonal way. Due to the strong co-channel interference among mobile users introduced by NOMA, it poses significant challenges for system design and resource management. This article reviews resource management issues in NOMA systems. The main taxonomy of NOMA is presented by focusing on the following two categories: power-domain NOMA and code-domain NOMA. Then a novel radio resource management framework is presented based on game-theoretic models for uplink and downlink transmissions. Finally, potential applications and open research directions in the area of resource management for NOMA are provided.

cs.IT↗

arXiv2017

X-duplex Relaying: Adaptive Antenna Configuration

In this letter, we propose a joint transmission mode and transmit/receive (Tx/Rx) antenna configuration scheme referred to as X-duplex in the relay network with one source, one amplify-and-forward (AF) relay and one destination. The relay is equipped with two antennas, each of which is capable of reception and transmission. In the proposed scheme, the relay adaptively selects its Tx and Rx antenna, operating in either full-duplex (FD) or half-duplex (HD) mode. The proposed scheme is based on minimizing the symbol error rate (SER) of the relay system. The asymptotic expressions of the cumulative distribution function (CDF) for the end-to-end signal to interference plus noise ratio (SINR), average SER and diversity order are derived and validated by simulations. Results show that the X-duplex scheme achieves additional spatial diversity, significantly reduces the performance floor at high SNR and improves the system performance.

cs.IT↗

arXiv2017

On the Performance of X-Duplex Relaying

In this paper, we study a X-duplex relay system with one source, one amplify-and-forward (AF) relay and one destination, where the relay is equipped with a shared antenna and two radio frequency (RF) chains used for transmission or reception. X-duplex relay can adaptively configure the connection between its RF chains and antenna to operate in either HD or FD mode, according to the instantaneous channel conditions. We first derive the distribution of the signal to interference plus noise ratio (SINR), based on which we then analyze the outage probability, average symbol error rate (SER), and average sum rate. We also investigate the X-duplex relay with power allocation and derive the lower bound and upper bound of the corresponding outage probability. Both analytical and simulated results show that the X-duplex relay achieves a better performance over pure FD and HD schemes in terms of SER, outage probability and average sum rate, and the performance floor caused by the residual self interference can be eliminated using flexible RF chain configurations.

cs.NI↗

arXiv2016

Sub-channel and Power Allocation for Non-orthogonal Multiple Access Relay Networks with Amplify-and-Forward Protocol

In this paper, we study the resource allocation problem for a single-cell non-orthogonal multiple access (NOMA) relay network where an OFDM amplify-and-forward (AF) relay allocates the spectrum and power resources to the source-destination (SD) pairs. We aim to optimize the resource allocation to maximize the average sum-rate. The optimal approach requires an exhaustive search, leading to an NP-hard problem. To solve this problem, we propose two efficient many-to-many two-sided SD pair-subchannel matching algorithms in which the SD pairs and sub-channels are considered as two sets of players chasing their own interests. The proposed algorithms can provide a sub-optimal solution to this resource allocation problem in affordable time. Both the static matching algorithm and dynamic matching algorithm converge to a pair-wise stable matching after a limited number of iterations. Simulation results show that the capacity of both proposed algorithms in the NOMA scheme significantly outperforms the conventional orthogonal multiple access scheme. The proposed matching algorithms in NOMA scheme also achieve a better user-fairness performance than the conventional orthogonal multiple access.

cs.NI↗

arXiv2016

Resource Allocation in Wireless Powered Relay Networks: A Bargaining Game Approach

Simultaneously information and power transfer in mobile relay networks have recently emerged, where the relay can harvest the radio frequency (RF) energy and then use this energy for data forwarding and system operation. Most of the previous works do not consider that the relay may have its own objectives, such as using the harvested energy for its own transmission instead of maximizing transmission of the network. Therefore, in this paper, we propose a Nash bargaining approach to balance the information transmission efficiency of source-destination pairs and the harvested energy of the relay in a wireless powered relay network with multiple source-destination pairs and one relay. We analyze and prove that the Nash bargaining problem has several desirable properties such as the discreteness and quasi-concavity, when it is decomposed into three sub-problems: the energy transmission power optimization, the power control for data transmission and the time division between energy transmission and data transmission. Based on the theoretical analysis, we propose an alternating power control and time division algorithm to find a suboptimal solution. Simulation results clearly show and demonstrate the properties of the problem and the convergence of our algorithm.

cs.IT↗

arXiv2016

Cost Efficiency for Economical Mobile Data Traffic Management from Users' Perspective

Explosive demand for wireless internet services has posed critical challenges for wireless network due to its limited capacity. To tackle this hurdle, wireless Internet service providers (WISPs) take the smart data pricing to manage data traffic loads. Meanwhile, from the users' perspective, it is also reasonable and desired to employ mobile data traffic management under the pricing policies of WISPs to improve the economic efficiency of data consumption. In this paper we introduce a concept of cost efficiency for user's mobile data management, defined as the ratio of user's mobile data consumption benefits and its expense. We propose an integrated cost-efficiency-based data traffic management scheme including long-term data demand planning, short-term data traffic pre-scheduling and real-time data traffic management. The real-time data traffic management algorithm is proposed to coordinate user's data consumption to tailor to the pre-scheduled data traffic profile. Numerical results demonstrate the effectiveness of cost efficiency framework in indicating and motivating mobile user's data consumption behavior. The proposed management scheme can effectively motivate the user to adjust its data consumption profile to obtain the optimal data consumption cost efficiency.

cs.NI↗

arXiv2016

Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks

In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We then propose a matching algorithm which converges to a two-side exchange stable matching after a limited number of iterations. A joint solution is thus provided to solve the sub-channel assignment and power allocation problems iteratively. Simulation results show that the proposed algorithm greatly outperforms the orthogonal multiple access scheme and a previous non-orthogonal multiple access scheme.

cs.NI↗

arXiv2016

Collaborative Smartphone Sensing using Overlapping Coalition Formation Games

With the rapid growth of sensor technology, smartphone sensing has become an effective approach to improve the quality of smartphone applications. However, due to time-varying wireless channels and lack of incentives for the users to participate, the quality and quantity of the data uploaded by the smartphone users are not always satisfying. In this paper, we consider a smartphone sensing system in which a platform publicizes multiple tasks, and the smartphone users choose a set of tasks to participate in. In the traditional non-cooperative approach with incentives, each smartphone user gets rewards from the platform as an independent individual and the limit of the wireless channel resources is often omitted. To tackle this problem, we introduce a novel cooperative approach with an overlapping coalition formation game (OCF-game) model, in which the smartphone users can cooperate with each other to form the overlapping coalitions for different sensing tasks. We also utilize a centralized case to describe the upper bound of the system sensing performance. Simulation results show that the cooperative approach achieves a better performance than the non-cooperative one in various situations.

cs.DC↗