相关论文: Robust Spectrum Sharing via Worst Case Approach

This paper considers non-cooperative and fully-distributed power-allocation for selfish transmitter-receiver pairs in shared unlicensed spectrum when normalized-interference to each receiver is uncertain. We model each uncertain parameter…

We study the robust Nash equilibrium (RNE) for a class of games in communications systems and networks where the impact of users on each other is an additive function of their strategies. Each user measures this impact, which may be…

We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that each agent has i.i.d. values for the item across rounds, and…

In this paper, we develop a social group utility maximization (SGUM) framework for cooperative wireless networking that takes into account both social relationships and physical coupling among users. We show that this framework provides…

Efficient resource allocation and scheduling algorithms are essential for various distributed applications, ranging from wireless networks and cloud computing platforms to autonomous multi-agent systems and swarm robotic networks. However,…

Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless channel problems, like…

We formulate the resource allocation problem for the uplink of code division multiple access (CDMA) networks using a game theoretic framework, propose an efficient and distributed algorithm for a joint rate and power allocation, and show…

In the first part of this paper, we have studied solely the spectrum sharing aspect of the above problem, and proposed algorithms for the CUs in the single AP network to efficiently share the spectrum. In this second part of the paper, we…

Providing proper economic incentives is essential for the success of dynamic spectrum sharing. Cooperative spectrum sharing is one effective way to achieve this goal. In cooperative spectrum sharing, secondary users (SUs) relay traffics for…

In this paper, a stochastic approximation (SA) based distributed algorithm is proposed to solve the resource allocation (RA) with uncertainties. In this problem, a group of agents cooperatively optimize a separable optimization problem with…

In this paper, a Device-to-Device communication on unlicensed bands (D2D-U) enabled network is studied. To improve the spectrum efficiency (SE) on the unlicensed bands and fit its distributed structure while ensuring the fairness among…

Spectrum sharing is an elegant solution to addressing the scarcity of the bandwidth for wireless communications systems. This research studies the feasibility of sharing the spectrum between sectorized cellular systems and stationary radars…

RadioWeaves network operates a large number of distributed antennas using cell-free architecture to provide high data rates and support a large number of users. Operating this network in an energy-efficient manner in the limited available…

The joint user association and spectrum allocation problem is studied for multi-tier heterogeneous networks (HetNets) in both downlink and uplink in the interference-limited regime. Users are associated with base-stations (BSs) based on the…

This paper proposes distributed algorithms to solve robust convex optimization (RCO) when the constraints are affected by nonlinear uncertainty. We adopt a scenario approach by randomly sampling the uncertainty set. To facilitate the…

Deregulation of energy markets, penetration of renewables, advanced metering capabilities, and the urge for situational awareness, all call for system-wide power system state estimation (PSSE). Implementing a centralized estimator though is…

Radio access network (RAN) slicing is an effective methodology to dynamically allocate networking resources in 5G networks. One of the main challenges of RAN slicing is that it is provably an NP-Hard problem. For this reason, we design…

We aim at maximizing the sum rate of secondary users (SUs) in OFDM-based Heterogeneous Cognitive Radio (CR) Networks using RF energy harvesting. Assuming SUs operate in a time switching fashion, each time slot is partitioned into three…

We consider a network where strategic agents, who are contesting for allocation of resources, are divided into fixed groups. The network control protocol is such that within each group agents get to share the resource and across groups they…

Social utility maximization refers to the process of allocating resources in such a way that the sum of agents' utilities is maximized under the system constraints. Such allocation arises in several problems in the general area of…