Beijing University of Posts and Telecommunications

About: Beijing University of Posts and Telecommunications is a education organization based out in Beijing, Beijing, China. It is known for research contribution in the topics: MIMO & Quality of service. The organization has 39576 authors who have published 41525 publications receiving 403759 citations. The organization is also known as: BUPT.

Virtual Reality Over Wireless Networks: Quality-of-Service Model and Learning-Based Resource Management

Abstract: In this paper, the problem of resource management is studied for a network of wireless virtual reality (VR) users communicating over small cell networks (SCNs). In order to capture the VR users’ quality-of-service (QoS) in SCNs, a novel VR model, based on multi-attribute utility theory, is proposed. This model jointly accounts for VR metrics, such as tracking accuracy, processing delay, and transmission delay. In this model, the small base stations (SBSs) act as the VR control centers that collect the tracking information from VR users over the cellular uplink. Once this information is collected, the SBSs will then send the 3-D images and accompanying audio to the VR users over the downlink. Therefore, the resource allocation problem in VR wireless networks must jointly consider both the uplink and downlink. This problem is then formulated as a noncooperative game and a distributed algorithm based on the machine learning framework of echo state networks (ESNs) is proposed to find the solution of this game. The proposed ESN algorithm enables the SBSs to predict the VR QoS of each SBS and is guaranteed to converge to mixed-strategy Nash equilibrium. The analytical result shows that each user’s VR QoS jointly depends on both VR tracking accuracy and wireless resource allocation. Simulation results show that the proposed algorithm yields significant gains, in terms of VR QoS utility, that reach up to 22.2% and 37.5%, respectively, compared with Q-learning and a baseline proportional fair algorithm. The results also show that the proposed algorithm has a faster convergence time than Q-learning and can guarantee low delays for VR services.

An SMDP-Based Resource Allocation in Vehicular Cloud Computing Systems

Abstract: Vehicular ad hoc networks are expected to significantly improve traffic safety and transportation efficiency while providing a comfortable driving experience. However, available communication, storage, and computation resources of the connected vehicles are not well utilized to meet the service requirements of intelligent transportation systems. Vehicular cloud computing (VCC) is a promising approach that makes use of the advantages of cloud computing and applies them to vehicular networks. In this paper, we propose an optimal computation resource allocation scheme to maximize the total long-term expected reward of the VCC system. The system reward is derived by taking into account both the income and cost of the VCC system as well as the variability feature of available resources. Then, the optimization problem is formulated as an infinite horizon semi-Markov decision process (SMDP) with the defined state space, action space, reward model, and transition probability distribution of the VCC system. We utilize the iteration algorithm to develop the optimal scheme that describes which action has to be taken under a certain state. Numerical results demonstrate that the significant performance gain can be obtained by the SMDP-based scheme within the acceptable complexity.

Quantum secure direct communication with χ -type entangled states

Abstract: In this paper, a quantum secure direct communication protocol with $\ensuremath{\chi}$-type entangled states ${\ensuremath{\mid}{\ensuremath{\chi}}^{00}⟩}_{3214}$ is proposed. We analyze the security of this protocol and prove that it is secure in ideal conditions. Then, an alternative way is presented to ensure the security of this protocol in a noisy channel. Moreover, this protocol utilizes quantum superdense coding to achieve a high intrinsic efficiency and source capacity. The practical implementation of this protocol is also discussed.

Simultaneously Transmitting And Reflecting (STAR) RIS Aided Wireless Communications

Abstract: The novel concept of simultaneously transmitting and reflecting (STAR) reconfigurable intelligent surfaces (RISs) is investigated, where the incident wireless signal is divided into transmitted and reflected signals passing into both sides of the space surrounding the surface, thus facilitating a full-space manipulation of signal propagation. Based on the introduced basic signal model of ‘STAR’, three practical operating protocols for STAR-RISs are proposed, namely energy splitting (ES), mode switching (MS), and time switching (TS). Moreover, a STAR-RIS aided downlink communication system is considered for both unicast and multicast transmission, where a multi-antenna base station (BS) sends information to two users, i.e., one on each side of the STAR-RIS. A power consumption minimization problem for the joint optimization of the active beamforming at the BS and the passive transmission and reflection beamforming at the STAR-RIS is formulated for each of the proposed operating protocols, subject to communication rate constraints of the users. For ES, the resulting highly-coupled non-convex optimization problem is solved by an iterative algorithm, which exploits the penalty method and successive convex approximation. Then, the proposed penalty-based iterative algorithm is extended to solve the mixed-integer non-convex optimization problem for MS. For TS, the optimization problem is decomposed into two subproblems, which can be consecutively solved using state-of-the-art algorithms and convex optimization techniques. Finally, our numerical results reveal that: 1) the TS and ES operating protocols are generally preferable for unicast and multicast transmission, respectively; and 2) the required power consumption for both scenarios is significantly reduced by employing the proposed STAR-RIS instead of conventional reflecting/transmiting-only RISs.

Energy-Efficient Opportunistic Routing in Wireless Sensor Networks

Abstract: Opportunistic routing, has been shown to improve the network throughput, by allowing nodes that overhear the transmission and closer to the destination to participate in forwarding packets, i.e., in forwarder list. The nodes in forwarder list are prioritized and the lower priority forwarder will discard the packet if the packet has been forwarded by a higher priority forwarder. One challenging problem is to select and prioritize forwarder list such that a certain network performance is optimized. In this paper, we focus on selecting and prioritizing forwarder list to minimize energy consumption by all nodes. We study both cases where the transmission power of each node is fixed or dynamically adjustable. We present an energy-efficient opportunistic routing strategy, denoted as EEOR. Our extensive simulations in TOSSIM show that our protocol EEOR performs better than the well-known ExOR protocol (when adapted in sensor networks) in terms of the energy consumption, the packet loss ratio, and the average delivery delay.