scispace - formally typeset
B

Beiyu Rong

Researcher at University of Maryland, College Park

Publications -  18
Citations -  2527

Beiyu Rong is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Relay & Network packet. The author has an hindex of 12, co-authored 18 publications receiving 2407 citations. Previous affiliations of Beiyu Rong include University of Texas at Austin & Marvell Technology Group.

Papers
More filters
Journal ArticleDOI

User Association for Load Balancing in Heterogeneous Cellular Networks

TL;DR: In this paper, the authors provide a low-complexity distributed algorithm that converges to a near-optimal solution with a theoretical performance guarantee, and observe that simple per-tier biasing loses surprisingly little, if the bias values Aj are chosen carefully.
Posted Content

User Association for Load Balancing in Heterogeneous Cellular Networks

TL;DR: A low-complexity distributed algorithm that converges to a near-optimal solution with a theoretical performance guarantee is provided, and it is observed that simple per-tier biasing loses surprisingly little, if the bias values Aj are chosen carefully.
Journal ArticleDOI

On combating the half-duplex constraint in modern cooperative networks: protocols and techniques

TL;DR: Four different techniques which combat the half-duplex constraint by using existing technology are highlighted, including non-orthogonal protocols, which allow the source to be active during relay transmissions, and two-way relay channel where two sources exchange data via the assistance of a shared relay.
Journal ArticleDOI

Cooperative Access in Wireless Networks: Stable Throughput and Delay

TL;DR: This work investigates the impact of a protocol-level cooperation idea in a wireless multiple-access system, and indicates that cooperation can significantly reduce delay for both users.
Proceedings ArticleDOI

Cooperation above the physical layer: The case of a simple network

TL;DR: The effects of “network-level” cooperation in a wireless three-node network with packet erasure links is investigated, and it is observed that the throughput region depends on the priority choices at the relay node, and may or may not be equal to the stability region, which is shown to be independent of thepriority choices.