Related papers: Analysis of the shortest relay queue policy in a c…
Future wireless networks are expected to be a convergence of many diverse network technologies and architectures, such as cellular networks, wireless local area networks, sensor networks, and device to device communications. Through…
In this paper, we investigate the problem of cooperative relay in CR networks for further enhanced network performance. In particular, we focus on the two representative cooperative relay strategies, and develop optimal spectrum sensing and…
Extensive research has been done to achieve better throughput and reliability in wireless networks, with focus on multiple-input multiple-output systems. Recently, cooperative networking techniques have been investigated to increase the…
We analyze the performance of an interference-limited, decode-and-forward, cooperative relaying system that comprises a source, a destination, and $N$ relays, placed arbitrarily on the plane and suffering from interference by a set of…
In this work, we investigate a slotted-time relay assisted cooperative random access wireless network with multipacket (MPR) reception capabilities. MPR refers to the capability of a wireless node to successfully receive packets from more…
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed…
In this paper, we study and analyze fundamental throughput-delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves either…
In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling,…
In this paper, we study and analyze fundamental throughput and delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves…
Consider the communication of a single-user aided by a nearby relay involved in a large wireless network where the nodes form an homogeneous Poisson point process. Since this network is interference-limited the asymptotic error probability…
In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each…
This work analyzes the gains of cooperative relaying in interference-limited networks, in which outages can be due to interference and fading. A stochastic model based on point process theory is used to capture the spatial randomness…
In this work, we investigate the optimal dynamic packet scheduling policy in a wireless relay network (WRN). We model this network by two sets of parallel queues, that represent the subscriber stations (SS) and the relay stations (RS), with…
Relay nodes are used to improve the throughput, delay and reliability performance of energy harvesting networks by assisting both energy and information transfer between information nodes and access point. Previous studies on radio…
In this paper, we consider a queue-aware distributive resource control algorithm for two-hop MIMO cooperative systems. We shall illustrate that relay buffering is an effective way to reduce the intrinsic half-duplex penalty in cooperative…
In this article, we study the classical shortest queue problem under the influence of malicious attacks, which is relevant to a variety of engineering system including transportation, manufacturing, and communications. We consider a…
In this paper, the application of wireless information and power transfer to cooperative networks is investigated, where the relays in the network are randomly located and based on the decode-forward strategy. For the scenario with one…
Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…
Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding…
This work introduces the join the shortest queue policy in the retrial setting. We consider a Markovian single server retrial system with two infinite capacity orbits. An arriving job finding the server busy, it is forwarded to the least…