Distributed Resource Management for Cognitive Ad Hoc Networks With Cooperative Relays

Abstract

It is well known that the data transport capacity of a wireless network can be increased by leveraging the spatial and frequency diversity of the wireless transmission medium. This has motivated the recent surge of research in cooperative and dynamicspectrum-access (which we also refer to as cognitive spectrum access) networks. Still, as of today, a key open research challenge is to design distributed control strategies to dynamically jointly assign: 1) portions of the spectrum and 2) cooperative relays to different traffic sessions to maximize the resulting network-wide data rate. In this paper, we make a significant contribution in this direction. First, we mathematically formulate the problem of joint spectrum management and relay selection for a set of sessions concurrently utilizing an interference-limited infrastructure-less wireless network. We then study distributed solutions to this (nonlinear and nonconvex) problem. The overall problem is separated into two subproblems: 1) spectrum management through power allocation with given relay selection strategy; and 2) relay selection for a given spectral profile. Distributed solutions for each of the two subproblems are proposed, which are then analyzed based on notions from variational inequality (VI) theory. The distributed algorithms can be proven to converge, under certain conditions, to VI solutions, which are also Nash equilibrium (NE) solutions of the equivalent NE problems. A distributed algorithm based on iterative solution of the two subproblems is then designed. Performance and price of anarchy of the distributed algorithm are then studied by comparing it to the globally optimal solution obtained with a newly designed centralized algorithm. Simulation results show that the proposed distributed algorithm achieves performance that is within a few percentage points of the optimal solution.Index Terms-Cognitive radio networks, cooperative relay, distributed spectrum management, game theory. Manuscript

Multiple User Cooperative Mobility in Mobile Ad Hoc Networks: An Interaction Position Game

“…whered w andd υ are known constants and denote different fixed locations. Based on (26) and (27), we can derive and rewrite the utility function u2 i (a i , a −i ) as (28). Definition 4 (Bilateral Symmetric Interaction (BSI) game [40]): A strategic form game…”

“…Koji Yamamoto et al [27] introduced the properties of potential games and discussed a variety of channel assignment problems that can be solved by potential games. For ad hoc network applications, Zhangyu Guan et al [28] used Nash equilibrium (NE) points to obtain nonlinear and nonconvex problem solutions in cognitive ad hoc networks. Moreover, in [29], Yuhua Xu et al proposed a local altruistic game that can maximize the network throughput by considering payoffs both for each user and its neighbors.…”

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

“…The relevant technical networking aspects that mitigate congestion and empower the performance of MEC systems are traffic offloading [250][11] [251], D2D communication [170][54] [9], relaying [252] [196] [134], novel pricing schemes for peer-to-peer sharing platforms under incomplete information of users' service valuation [253], and Full Duplex (FD) communications [254]. The latter could enhance the performance of upcoming 5G wireless access technology [200][255] [256].…”

Utility‐based cooperative spectrum leasing scheme for CR networks with hybrid energy supplies

“…A joint pricing and power allocation scheme for dynamic spectrum access networks is formulated as a Stackelberg game in [9]. Guan et al in [10] aim at investigating the distributed resource management in cognitive ad hoc networks, different from other papers, they solve this problem with variational inequality theory. In [11], a simple communication system which has only one pair of PU and one pair of SU is extended to a more complex scenario which has multiple PUs and one pair of SU.…”