Mechanisms And Games For Dynamic Spectrum Allocation

An innovative and comprehensive book presenting state-of-the-art research into wireless spectrum allocation based on game theory and mechanism design.

An innovative and comprehensive book presenting state-of-the-art research into wireless spectrum allocation based on game theory and mechanism design.

"Presenting state-of-the-art research into methods of wireless spectrum allocation based on game theory and mechanism design, this innovative and comprehensive book provides a strong foundation for the design of future wireless mechanisms and spectrum markets. Prominent researchers showcase a diverse range of novel insights and approaches to the increasing demand for limited spectrum resources, with a consistent emphasis on theoretical methods, analytical results and practical examples. Covering fundamental underlying principles, licensed spectrum sharing, opportunistic spectrum sharing, and wider technical and economic considerations, this singular book will be of interest to academic and industrial researchers, wireless industry practitioners, and regulators interested in the foundations of cutting-edge spectrum management"--

An innovative and comprehensive book presenting state-of-the-art research into wireless spectrum allocation based on game theory and mechanism design.

This brief explores current research on dynamic spectrum auctions, focusing on fundamental auction theory, characteristics of the spectrum market, spectrum auction architecture and possible auction mechanisms. The brief explains how dynamic spectrum auctions, which enable new users to gain spectrum access and existing spectrum owners to obtain financial benefits, can greatly improve spectrum efficiency by resolving the artificial spectrum shortage. It examines why operators and users face significant challenges due to specialty of the spectrum market and the related requirements imposed on the auction mechanism design. Concise and up-to-date, Dynamic Spectrum Auction in Wireless Communication is designed for researchers and professionals in computer science or electrical engineering. Students studying networking will also find this brief a valuable resource.

With the rapid growth of new wireless devices and applications over the past decade, the demand for wireless radio spectrum is increasing relentlessly. The development of cognitive radio networking provides a framework for making the best possible use of limited spectrum resources, and it is revolutionising the telecommunications industry. This book presents the fundamentals of designing, implementing, and deploying cognitive radio communication and networking systems. Uniquely, it focuses on game theory and its applications to various aspects of cognitive networking. It covers in detail the core aspects of cognitive radio, including cooperation, situational awareness, learning, and security mechanisms and strategies. In addition, it provides novel, state-of-the-art concepts and recent results. This is an ideal reference for researchers, students and professionals in industry who need to learn the applications of game theory to cognitive networking.

In the ever-evolving telecommunication industry, technological improvements alone are not able to keep up with the significant growth of mobile broadband traffic. As such, new research on communications networks is necessary to keep up with rising demand. Convergence of Broadband, Broadcast, and Cellular Network Technologies addresses the problems of broadband, broadcast, and cellular coexistence, including the increasing number of advanced mobile users and their bandwidth demands. This book will serve as a link between academia and industry, serving students, researchers, and industry professionals.

This book offers means to handle interference as a central problem of operating wireless networks. It investigates centralized and decentralized methods to avoid and handle interference as well as approaches that resolve interference constructively. The latter type of approach tries to solve the joint detection and estimation problem of several data streams that share a common medium. In fact, an exciting insight into the operation of networks is that it may be beneficial, in terms of an overall throughput, to actively create and manage interference. Thus, when handled properly, "mixing" of data in networks becomes a useful tool of operation rather than the nuisance as which it has been treated traditionally. With the development of mobile, robust, ubiquitous, reliable and instantaneous communication being a driving and enabling factor of an information centric economy, the understanding, mitigation and exploitation of interference in networks must be seen as a centrally important task.

Traditionally, radio spectrum has been statically allocated to wireless service providers (WSPs). Regulators, like FCC, give wireless service providers exclusive long term licenses for using specific range of frequencies in particular geographic areas. Moreover, restrictions are imposed on the technologies to be used and the services to be provided. The lack of flexibility in static spectrum allocation constrains the ability to make use of new technologies and the ability to redeploy the spectrum to higher valued uses, thereby resulting in inefficient spectrum utilization (23, 38, 42, 62, 67). These limitations have motivated a paradigm shift from static spectrum allocation towards a more 'liberalized' notion of spectrum management in which secondary users can borrow idle spectrum from primary spectrum licensees, without causing harmful interference to the latter- a notion commonly referred to as dynamic spectrum access (DSA) or open spectrum access (3), (82). Cognitive radio (30, 47), empowered by Software Defined Radio (SDR) (81), is poised to promote the efficient use of spectrum by adopting this open spectrum approach. In this dissertation, we first address the problem of dynamic channel (spectrum) access by a set of cognitive radio enabled nodes, where each node acting in a selfish manner tries to access and use as many channels as possible, subject to the interference constraints. We model the dynamic channel access problem as a modified Rubinstein-Stahl bargaining game. In our model, each node negotiates with the other nodes to obtain an agreeable sharing rule of the available channels, such that, no two interfering nodes use the same channel. We solve the bargaining game by finding Subgame Perfect Nash Equilibrium (SPNE) strategies of the nodes. First, we consider finite horizon version of the bargaining game and investigate its SPNE strategies that allow each node to maximize its utility against the other nodes (opponents). We then extend these results to the infinite horizon bargaining game. Furthermore, we identify Pareto optimal equilibria of the game for improving spectrum utilization. The bargaining solution ensures that no node is starved of channels. The spectrum that a secondary node acquires comes to it at a cost. Thus it becomes important to study the 'end system' perspective of such a cost, by focusing on its implications. Specifically, we consider the problem of incentivizing nodes to provide the service of routing using the acquired spectrum. In this problem, each secondary node having a certain capacity incurs a cost for routing traffic through it. Secondary nodes will not have an incentive to relay traffic unless they are compensated for the costs they incur in forwarding traffic. We propose a path auction scheme in which each secondary node announces its cost and capacity to the routing mechanism, both of which are considered as private information known only to the node. We design a route selection mechanism and a pricing function that can induce nodes to reveal their cost and capacity honestly (making our auction truthful), while minimizing the payment that needs to be given to the nodes (making our auction optimal). By considering capacity constraint of the nodes, we explicitly support multiple path routing. For deploying our path auction based routing mechanism in DSA networks, we provide polynomial time algorithms to find the optimal route over which traffic should be routed and to compute the payment that each node should receive. All our proposed algorithms have been evaluated via extensive simulation experiments. These results help to validate our design philosophy and also illustrate the effectiveness of our solution approach.

The two-volume set LNCS 6640 and 6641 constitutes the refereed proceedings of the 10th International IFIP TC 6 Networking Conference held in Valencia, Spain, in May 2011. The 64 revised full papers presented were carefully reviewed and selected from a total of 294 submissions. The papers feature innovative research in the areas of applications and services, next generation Internet, wireless and sensor networks, and network science. The second volume includes 28 papers organized in topical sections on peer-to-peer, pricing, resource allocation, resource allocation radio, resource allocation wireless, social networks, and TCP.