Wanlu Sun

Energy-efficient relay selection and optimal relay location in cooperative cellular networks with asymmetric traffic

Energy-efficient communication is an important requirement for mobile relay networks due to the limited battery power of user terminals. This paper considers energy-efficient relaying schemes through selection of mobile relays in cooperative cellular systems with asymmetric traffic. The total energy consumption per information bit of the battery-powered terminals, i.e., the mobile station (MS) and the relay, is derived in theory. In the Joint Uplink and Downlink Relay Selection (JUDRS) scheme we proposed, the relay which minimizes the total energy consumption is selected. Additionally, the energy-efficient cooperation regions are investigated, and the optimal relay location is found for cooperative cellular systems with asymmetric traffic. The results reveal that the MS-relay and the relay-base station (BS) channels have different influence over relay selection decisions for optimal energy-efficiency. Information theoretic analysis of the diversity-multiplexing tradeoff (DMT) demonstrates that the proposed scheme achieves full spatial diversity in the quantity of cooperating terminals in this network. Finally, numerical results further confirm a significant energy efficiency gain of the proposed algorithm comparing to the previous best worse channel selection and best harmonic mean selection algorithms.

Radio Resource Management for D2D-Based V2V Communication

Direct device-to-device (D2D) links are proposed as a possible enabler for vehicle-to-vehicle (V2V) communications, where the incurred intracell interference and the stringent latency and reliability requirements are challenging issues. In this paper, we investigate the radio resource management problem for D2D-based V2V communication. First, we analyze and transform the latency and reliability requirements of V2V communication into optimization constraints that are computable using only the slowly varying channel information. This transformation opens up the possibility of extending certain existing D2D techniques to cater to V2V communication. Second, we propose a problem formulation that fulfills the different requirements of V2V communication and traditional cellular communication. Moreover, a Separate resOurce bLock and powEr allocatioN (SOLEN) algorithm is proposed to solve this problem. Finally, simulations are presented to evaluate different schemes, which illustrate the necessity of careful design when extending D2D methods to V2V communication, as well as show promising performance of the proposed SOLEN algorithm.

D2D-based V2V communications with latency and reliability constraints

Direct device-to-device (D2D) communication has been proposed as a possible enabler for vehicle-to-vehicle (V2V) applications, where the incurred intra-cell interference and the stringent latency and reliability requirements are challenging issues. In this paper, we investigate the radio resource management problem for D2D-based V2V communications. Firstly, we analyze and mathematically model the actual requirements for vehicular communications and traditional cellular links. Secondly, we propose a problem formulation to fulfill these requirements, and then a Separate Resource Block allocation and Power control (SRBP) algorithm to solve this problem. Finally, simulations are presented to illustrate the improved performance of the proposed SRBP scheme compared to some other existing methods.

Cluster-Based Radio Resource Management for D2D-Supported Safety-Critical V2X Communications

Deploying direct device-to-device (D2D) links is a promising technology for vehicle-to-X (V2X) applications. However, intracell interference, along with stringent requirements on latency and reliability, are challenging issues. In this paper, we study the radio resource management problem for D2D-based safety-critical V2X communications. We first transform the V2X requirements into the constraints that are computable using slowly varying channel state information only. Secondly, we formulate an optimization problem, taking into account the requirements of both vehicular users (V-UEs) and cellular users (C-UEs), where resource sharing can take place not only between a V-UE and a C-UE but also among different V-UEs. The NP-hardness of the problem is rigorously proved. Moreover, a heuristic algorithm, called Cluster-based Resource block sharing and pOWer allocatioN (CROWN), is proposed to solve this problem. Finally, simulation results indicate promising performance of the CROWN scheme.

Performance Study of fixed and moving relays for vehicular users with multi-cell handover under co-channel interference

In this paper, we investigate the power outage probability (OP) of a vehicular user equipment (VUE) device served by half-duplex decode-and-forward relay nodes (RNs) under co-channel interference. Both moving RNs (MRNs) and fixed RNs (FRNs) are studied, and compared with the baseline, base station (BS) to VUE direct transmission. In order to understand the benefit for vehicular users served by an RN, we consider practical channel models for different involved links as well as the impact of handover (HO) between the BS and the RNs. For an accurate comparison, we present a comprehensive framework to optimize the HO parameters, as well as we numerically optimize the FRN position which minimizes the average power OP at the VUE. FRN shows its advantage to serve its nearby VUEs. However, when vehicular penetration loss is moderate to high, MRN assisted transmission greatly outperforms transmission assisted by an FRN as well as direct transmission. Hence, the use of MRNs is very promising for improving the quality-of-service (QoS) of VUEs in future mobile communication systems.

Distributed clock synchronization with application of D2D communication without infrastructure

This paper investigates the clock synchronization problem for Device-to-Device (D2D) communication without infrastructure. Employing affine models for local clocks, it is proposed a random broadcast based distributed consensus clock synchronization algorithm. In the absence of transmission delays, we theoretically prove the convergence of the proposed scheme, which is further illustrated by the numerical evaluations. On the other hand, when the delays are also taken into account, the proposed approach still performs well. Besides, it is further concluded from the simulations that the proposed scheme is robust against dynamic topologies and scalable to the increased number of devices, and has a fast speed regarding the synchronization error decrease.

Joint Subcarrier Pairing, Relay Selection and Power Allocation in OFDM Relay Systems

In this paper, joint optimization of subcarrier pairing, relay selection and power allocation is formulated through a capacity maximization problem in orthogonal frequency division multiplexing (OFDM) relay systems, with fairness considerations and individual power constraint on each node. Because achieving the optimal solution is computationally demanding, which is resulted from the excessive possibilities of joint resource allocation, we propose a sub-optimal allocation method. The proposed scheme decouples the allocation procedures into two steps, which reduces the complexity significantly by avoiding the search for all possible subcarrier pairs. Moreover, simulation results reveal the effectiveness of the proposed algorithm in both Amplify-and-Forward (AF) and Decode-and-Forward (DF) relay systems.

Resource Sharing and Power Allocation for D2D-based safety-critical V2X communications

Deploying direct device-to-device (D2D) links is considered an enabler for V2X applications, with intra-cell interference and stringent latency and reliability requirements as challenging issues.We investigate the radio resource management problem for D2D-based safety-critical V2X communications. Firstly, we analyze and transform the V2X latency and reliability requirements into mathematical forms that are computable using only slowly varying channel information. Secondly, we propose a problem formulation fulfilling the requirements of V2X, where resource sharing can take place not only between vehicles and cellular users but also among different vehicles. Moreover, a Resource Block Sharing and Power Allocation (RBSPA) algorithm is proposed to solve this problem. Finally, simulations are presented that indicate promising performance of the proposed RBSPA scheme.

Random Broadcast Based Distributed Consensus Clock Synchronization for Mobile Networks

Clock synchronization is a crucial issue for mobile ad hoc networks due to the dynamic and distributed nature of these networks. In this paper, employing affine models for local clocks, a random broadcast based distributed consensus clock synchronization algorithm is proposed. In the absence of transmission delays, we theoretically prove the convergence of the proposed scheme, which is further illustrated by numerical results. In addition, it is concluded from simulations that the proposed scheme is scalable and robust to transmission delays as well as different accuracy requirements.

Long-Term Clock Synchronization in wireless sensor networks with arbitrary delay distributions

Clock synchronization is a crucial issue in the operation of wireless sensor networks. Although the existing synchronization algorithms under linear clock model assumptions perform well for short periods, they will become problematic for applications with long-term requirements. In this paper, we consider a more realistic and flexible relationship model for two clocks and exploit a Taylor expansion to approximate the relationship. Based on this model and a two-way time message exchange procedure, an estimation algorithm is proposed to recover the relationship and then achieve the synchronization. Finally, simulation results demonstrate that the proposed algorithm improves the accuracy of synchronization as compared to existing algorithms in many scenarios, and is also robust to different distributions of random delays.