Related papers: A Monetary Mechanism for Stabilizing Cooperative D…
Existing proactive caching policies are designed by assuming that all users request contents with identical activity level at uniformly-distributed or known locations, among which most of the policies are optimized by assuming that user…
The Stable Roommates problems are characterized by the preferences of agents over other agents as roommates. A solution is a partition of the agents into pairs that are acceptable to each other (i.e., they are in the preference lists of…
A smartphone user's personal hotspot (pH) allows him to share cellular connection to another (e.g., a traveler) in the vicinity, but such sharing consumes the limited data quota in his two-part tariff plan and may lead to overage charge.…
We study data exchange among strategic agents without monetary transfers, motivated by domains such as research consortia and healthcare collaborations where payments are infeasible or restricted. The central challenge is to reap the…
Exchange of services and resources in, or over, networks is attracting nowadays renewed interest. However, despite the broad applicability and the extensive study of such models, e.g., in the context of P2P networks, many fundamental…
This paper investigates joint user pairing, power and time slot duration allocation in the uplink multiple-input single-output (MISO) multi-user cooperative rate-splitting multiple access (C-RSMA) networks in half-duplex (HD) mode. We…
In this paper, we analyse how a peer-to-peer sharing platform should price its service (when imagined as an excludable public good) to maximize profit, when each user's participation adds value to the platform service by creating a positive…
In cognitive radio networks, secondary users (SUs) may cooperate with the primary user (PU), so that the success probability of PU transmissions are improved, while SUs obtain more transmission opportunities. Thus, SUs have to take…
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine…
This paper considers the basic $\mathcal{PULL}$ model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each…
We investigate opportunistic cooperation between unlicensed secondary users and legacy primary users in a cognitive radio network. Specifically, we consider a model of a cognitive network where a secondary user can cooperatively transmit…
Commonly considered user association frameworks in millimeter-wave communications are based on the sum rate maximization, and they essentially neglect user specific rate and service requirements. Furthermore, new features of millimeter-wave…
Unlike commercial ridesharing, non-commercial peer-to-peer (P2P) ridesharing has been subject to limited research -- although it can promote viable solutions in non-urban communities. This paper focuses on the core problem in P2P…
In this paper, we study a problem where multiple operators (OPs) need to share a common pool of spectrum with each other. Our objective is to maximize the social welfare, defined as the overall weighted sum rate of the OPs. The problem is…
In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide…
In this paper, we present a novel algorithm for power allocation in the Amplify-and-Forward cooperative communication that minimizes the outage probability with a given value of total power. We present the problem with new formulation and…
The rapid advance of mega-constellation facilitates the booming of direct-to-satellite massive access, where multi-user detection is critical to alleviate the induced inter-user interference. While centralized implementation of on-board…
Sharing economy is a transformative socio-economic phenomenon built around the idea of sharing underused resources and services, e.g. transportation and housing, thereby reducing costs and extracting value. Anticipating continued reduction…
Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent trade off between the gains in terms of probability of detection of…
We consider a source (Alice) trying to communicate with a destination (Bob), in a way that an unauthorized node (Eve) cannot infer, based on her observations, the information that is being transmitted. The communication is assisted by…