Related papers: Throughput and Delay Scaling in Supportive Two-Tie…
Recently, physical layer security based approaches have drawn considerable attentions and are envisaged to provide secure communications in the wireless networks. However, most existing literatures only focus on the physical layer. Thus,…
Achievable degrees-of-freedom (DoF) of the large-scale interfering two-way relay network is investigated. The network consists of $K$ pairs of communication nodes (CNs) and $N$ relay nodes (RNs). It is assumed that $K\ll N$ and each pair of…
Distributed secondary frequency control for power systems, is a problem that has been extensively studied in the literature, and one of its key features is that an additional communication network is required to achieve optimal power…
We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous broadcast algorithms route packets along spanning trees. In…
We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the…
We consider a wireless device-to-device (D2D) network where $n$ nodes are uniformly distributed at random over the network area. We let each node with storage capacity $M$ cache files from a library of size $m \geq M$. Each node in the…
A great deal of significant progress has been seen in the study of information spreading on populations of networked individuals. A common point in many of past studies is that there is only one transition in the phase diagram of the final…
We study the effect of node mobility on the throughput scaling of the covert communication over a wireless adhoc network. It is assumed that $n$ mobile nodes want to communicate each other in a unit disk while keeping the presence of the…
For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…
This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two…
Two-tier networks, comprising a conventional cellular network overlaid with shorter range hotspots (e.g. femtocells, distributed antennas, or wired relays), offer an economically viable way to improve cellular system capacity. The…
We study the dynamics of priority-queue networks, generalizations of the binary interacting priority queue model introduced by Oliveira and Vazquez [Physica A {\bf 388}, 187 (2009)]. We found that the original AND-type protocol for…
In this paper we investigate cooperative secure communications in a four-node cognitive radio network where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission. The secondary user is…
In this paper, we adopt a cross layer design approach for analyzing the throughput-delay tradeoff of the multicast channel in a single cell system. To illustrate the main ideas, we start with the single group case, i.e., pure multicast,…
This paper introduces a new theoretical framework for optimizing second-order behaviors of wireless networks. Unlike existing techniques for network utility maximization, which only considers first-order statistics, this framework models…
We consider a spectrum sharing scenario where a secondary transmitter (ST) communicates with its destination via a decode-and-forward secondary relay (SR) in the presence of interference from multiple primary transmitters. The SR harvests…
Primary user activity is a major bottleneck for existing routing protocols in cognitive radio networks. Typical routing protocols avoid areas that are highly congested with primary users, leaving only a small fragment of available links for…
The time-varying feature of wireless channels usually makes the hard delay bound for data transmissions unrealistic to guarantee. In contrast, the statistically-bounded delay with a small violation probability has been widely used for delay…
A characterization of systematic network coding over multi-hop wireless networks is key towards understanding the trade-off between complexity and delay performance of networks that preserve the systematic structure. This paper studies the…
This paper proposes a dynamic primal-dual type algorithm to solve the optimal scheduling problem in wireless networks subject to uncertain parameters, which are generated by stochastic network processes such as random packet arrivals,…