6,731 research outputs found
Applications of Game Theory and Microeconomics in Cognitive Radio and Femtocell Networks
Cognitive radio networks have recently been proposed as a promising approach to overcome the serious problem of spectrum scarcity. Other emerging concept for innovative spectrum utilization is femtocells. Femtocells are low-power and short-range wireless access points installed by the end-user in residential or enterprise environments. A common feature of cognitive radio and femtocells is their two-tier nature involving primary and secondary users (PUs, SUs). While this new paradigm enables innovative alternatives to conventional spectrum management and utilization, it also brings its own technical challenges.
A main challenge in cognitive radio is the design of efficient resource (spectrum) trading methods. Game and microeconomics theories provide tools for studying the strategic interactions through rationality and economic benefits between PUs and SUs for effective resource allocation. In this thesis, we investigate some efficient game theoretic and microeconomic approaches to address spectrum trading in cognitive networks. We propose two auction frameworks for shared and exclusive use models. In the first auction mechanism, we consider the shared used model in cognitive radio networks and design a spectrum trading method to maximize the total satisfaction of the SUs and revenue of the Wireless Service Provider (WSP). In the second auction mechanism, we investigate spectrum trading via auction approach for exclusive usage spectrum access model in cognitive radio networks. We consider a realistic valuation function and propose an efficient concurrent Vickrey-Clarke-Grove (VCG) mechanism for non-identical channel allocation among r-minded bidders in two different cases.
The realization of cognitive radio networks in practice requires the development of effective spectrum sensing methods. A fundamental question is how much time to allocate for sensing purposes. In the literature on cognitive radio, it is commonly assumed that fixed time durations are assigned for spectrum sensing and data transmission. It is however possible to improve the network performance by finding the best tradeoff between sensing time and throughput. In this thesis, we derive an expression for the total average throughput of the SUs over time-varying fading channels. Then we maximize the total average throughput in terms of sensing time and the number of SUs assigned to cooperatively sense each channel. For practical implementation, we propose a dynamical programming algorithm for joint optimization of sensing time and the number of cooperating SUs for sensing purpose. Simulation results demonstrate that significant improvement in the throughput of SUs is achieved in the case of joint optimization.
In the last part of the thesis, we further address the challenge of pricing in oligopoly market for open access femtocell networks. We propose dynamic pricing schemes based on microeconomic and game theoretic approaches such as market equilibrium, Bertrand game, multiple-leader-multiple-follower Stackelberg game. Based on our approaches, the per unit price of spectrum can be determined dynamically and mobile service providers can gain more revenue than fixed pricing scheme. Our proposed methods also provide residential customers more incentives and satisfaction to participate in open access model.1 yea
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
Adaptive resource allocation for cognitive wireless ad hoc networks
Widespread use of resource constrained wireless ad hoc networks requires careful management of the network resources in order to maximize the utilization. In cognitive wireless networks, resources such as spectrum, energy, communication links/paths, time, space, modulation scheme, have to be managed to maintain quality of service (QoS). Therefore in the first paper, a distributed dynamic channel allocation scheme is proposed for multi-channel wireless ad hoc networks with single-radio nodes. The proposed learning scheme adapts the probabilities of selecting each channel as a function of the error in the performance index at each step.
Due to frequent changes in topology and flow traffic over time, wireless ad hoc networks require a dynamic routing protocol that adapts to the changes of the network while allocating network resources. In the second paper, approximate dynamic programming (ADP) techniques are utilized to find dynamic routes, while solving discrete-time Hamilton-Jacobi-Bellman (HJB) equation forward-in-time for route cost. The third paper extends the dynamic routing to multi-channel multi-interface networks which are affected by channel uncertainties and fading channels. By the addition of optimization techniques through load balancing over multiple paths and multiple wireless channels, utilization of wireless channels throughout the network is enhanced.
Next in the fourth paper, a decentralized game theoretic approach for resource allocation of the primary and secondary users in a cognitive radio networks is proposed. The priorities of the networks are incorporated in the utility and potential functions which are in turn used for resource allocation. The proposed game can be extended to a game among multiple co-existing networks, each with different priority levels --Abstract, page iv
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
Matching Theory for Future Wireless Networks: Fundamentals and Applications
The emergence of novel wireless networking paradigms such as small cell and
cognitive radio networks has forever transformed the way in which wireless
systems are operated. In particular, the need for self-organizing solutions to
manage the scarce spectral resources has become a prevalent theme in many
emerging wireless systems. In this paper, the first comprehensive tutorial on
the use of matching theory, a Nobelprize winning framework, for resource
management in wireless networks is developed. To cater for the unique features
of emerging wireless networks, a novel, wireless-oriented classification of
matching theory is proposed. Then, the key solution concepts and algorithmic
implementations of this framework are exposed. Then, the developed concepts are
applied in three important wireless networking areas in order to demonstrate
the usefulness of this analytical tool. Results show how matching theory can
effectively improve the performance of resource allocation in all three
applications discussed
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]})
- …