A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on Communications, vol. E98-B, no. 9, Sept. 201

Spectrum Trading: An Abstracted Bibliography

This document contains a bibliographic list of major papers on spectrum trading and their abstracts. The aim of the list is to offer researchers entering this field a fast panorama of the current literature. The list is continually updated on the webpage \url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers suggested for inclusion may be pointed out to the authors through e-mail (\textit{[email protected]})

Software-defined routing protocol for mobile cognitive radio networks : a cross-layer perspective

The growing demand for wireless applications, combined with inefficient spectrum use, necessitates developing a new wireless communication paradigm that focuses on dynamic spectrum access rather than the fixed spectrum using cognitive radio technology. The unlicensed user, known as secondary user or cognitive user, uses cognitive radio technology to grow opportunistic communication over licensed spectrum bands and improve spectrum management performance. The routing protocol in Cognitive Radio Networks (CRNs) serves as a communication backbone, allowing data packets to transfer between cognitive user nodes through multiple paths and channels. However, the problem of routing in CRNs is to create a robust-stable route over higher channel availability. The previously developed protocols missed opportunities to exploit the time-variant channel estimation technique, which selects the best route using the cross-layer routing decision engine to track the adverse impact of cognitive user mobility and primary user activity. This study aims to construct a robust routing path while limiting interference with primary user activity, delaying routing, and maximizing routing throughput. Here, a new routing framework is created in this study to explore new extended routing functions and features from the lower layers (Physical layer and Data Link layer) feedback to improve routing performance. Then, the link-oriented channel availability and channel quality have been developed based on two reliable metrics, which are channel availability probability and channel quality, to estimate and select a channel that maximizes link-throughput. Furthermore, this study proposes a novel cross layer routing protocol, namely, the Software-Defined Routing Protocol. It is a cross-layer method to combine the lower layer (Physical layer and Data Link layer) sensing derived from the channel estimation model. It periodically updates the routing table for optimal route decision making. The output simulation of the channel estimation method has shown that it has produced a powerful channel selection strategy to maximize the average rate of link throughput and achieved a channel estimate under the time-variant effect. Extensive simulation experiments have been performed to evaluate the proposed protocol in compression with the existing benchmark protocols, namely, dual diversity cognitive Ad-hoc routing protocol and cognitive Ad-hoc on-demand distance vector. The proposed protocol outperforms the benchmarks, resulting in increasing the packet delivery ratio by around (11.89%-12.80%), reducing delay by around (2.74%-4.05%), reducing overhead by around (14.31%-18.36%), and increasing throughput by around (23.94%-28.35%). The software-defined routing protocol, however, lacks the ability to determine the better idle channel at high-speed node mobility. In conclusion, the cross-layer routing protocol successfully achieves high routing performance in finding a robust route, selecting high channel stability, and reducing the probability of interference with primary users for continued communication

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Resource Allocation and Pricing in Secondary Dynamic Spectrum Access Networks

The paradigm shift from static spectrum allocation to a dynamic one has opened many challenges that need to be addressed for the true vision of Dynamic Spectrum Access (DSA) to materialize. This dissertation proposes novel solutions that include: spectrum allocation, routing, and scheduling in DSA networks. First, we propose an auction-based spectrum allocation scheme in a multi-channel environment where secondary users (SUs) bid to buy channels from primary users (PUs) based on the signal to interference and noise ratio (SINR). The channels are allocated such that i) the SUs get their preferred channels, ii) channels are re-used, and iii) there is no interference. Then, we propose a double auction-based spectrum allocation technique by considering multiple bids from SUs and heterogeneity of channels. We use virtual grouping of conflict-free buyers to transform multi-unit bids to single-unit bids. For routing, we propose a market-based model where the PUs determine the optimal price based on the demand for bandwidth by the SUs. Routes are determined through a series of price evaluations between message senders and forwarders. Also, we consider auction-based routing for two cases where buyers can bid for only one channel or they could bid for a combination of non-substitutable channels. For a centralized DSA, we propose two scheduling algorithms-- the first one focuses on maximizing the throughput and the second one focuses on fairness. We extend the scheduling algorithms to multi-channel environment. Expected throughput for every channel is computed by modelling channel state transitions using a discrete-time Markov chain. The state transition probabilities are calculated which occur at the frame/slot boundaries. All proposed algorithms are validated using simulation experiments with different network settings and their performance are studied

Exploiting the power of multiplicity: a holistic survey of network-layer multipath

The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work