Dynamic Spectrum Sharing in Cognitive Radio Networks Using Truthful Mechanisms and Virtual Currency

In cognitive radio networks, there are scenarios where secondary users (SUs) utilize opportunistically the spectrum originally allocated to primary users (PUs). The spectrum resources available to SUs fluctuates over time due to PUs activity, SUs mobility and competition between SUs. In order to utilize these resources efficiently spectrum sharing techniques need to be implemented. In this paper we present an approach based on game-theoretical mechanism design for dynamic spectrum sharing. Each time a channel is not been used by any PU, it is allocated to SUs by a central spectrum manager based on the valuations of the channel reported by all SUs willing to use it. When an SU detects a free channel, it estimates its capacity according to local information and sends the valuation of it to the spectrum manager. The manager calculates a conflict-free allocation by implementing a truthful mechanism. The SUs have to pay for the allocation an amount which depends on the set of valuations. The objective is not to trade with the spectrum, but to share it according to certain criteria. For this, a virtual currency is defined and therefore monetary payments are not necessary. The spectrum manager records the credit of each SU and redistributes the payments to them after each spectrum allocation. The mechanism restricts the chances of each SU to be granted the channel depending on its credit availability. This credit restriction provides an incentive to SUs to behave as benefit maximizers. If the mechanism is truthful, their best strategy is to communicate the true valuation of the channel to the manager, what makes possible to implement the desired spectrum sharing criteria. We propose and evaluate an implementation of this idea by using two simple mechanisms which are proved to be truthful, and that are tractable and approximately efficient. We show the flexibility of these approach by illustrating how these mechanisms can be modified to achieve different sharing objectives which are trade-offs between efficiency and fairness. We also investigate how the credit restriction and redistribution affects the truthfulness of these mechanisms.This work was supported by the Spanish government through Projects TIN 2008-06739-C04-02 and TIN 2010-21378-C02-02.Vidal Catalá, JR.; Pla, V.; Guijarro Coloma, LA.; Martínez Bauset, J. (2013). Dynamic Spectrum Sharing in Cognitive Radio Networks Using Truthful Mechanisms and Virtual Currency. Ad Hoc Networks. 11:1858-1873. https://doi.org/10.1016/j.adhoc.2013.04.010S185818731

Novel Approaches for the Performance Enhancement of Cognitive Radio Networks

This research is dedicated to the study of the challenges faced by Cognitive Radio (CR) networks, which include self-coexistence of the networks in the spectral environment, security and performance threats from malicious entities, and fairness in spectrum contention and utilization. We propose novel channel acquisition schemes that allow decentralized CR networks to have multiple channel access with minimal spectrum contentions. The multiple channel acquisition schemes facilitate fast spectrum access especially in cases where networks cannot communicate with each other. These schemes enable CR networks to self-organize and adapt to the dynamically changing spectral environment. We also present a self-coexistence mechanism that allows CR networks to coexist via the implementation of a risk-motivated channel selection based deference structure (DS). By forming DS coalitions, CR networks are able to have better access to preferred channels and can defer transmission to one another, thereby mitigating spectrum conflicts. CR networks are also known to be susceptible to Sybil threats from smart malicious radios with either monopolistic or disruptive intentions. We formulate novel threat and defense mechanisms to combat Sybil threats and minimize their impact on the performance of CR networks. A dynamic reputation system is proposed that considerably minimizes the effectiveness of intelligent Sybil attacks and improves the accuracy of spectrum-based decision-making processes. Finally, we present a distributed and cheat-proof spectrum contention protocol as an enhancement of the adaptive On-Demand Spectrum Contention (ODSC) protocol. The Modified On-Demand Spectrum Contention (MODSC) protocol enhances fairness and efficiency of spectrum access. We also show that there is substantial improvement in spectrum utilization with the incorporation of channel reuse into the MODSC protocol

Cognitive-Empowered Femtocells: An Intelligent Paradigm of a Robust and Efficient Media Access

Driven by both the need for ubiquitous wireless services and the stringent strain on radio spectrum faced in today's wireless communications, cognitive radio (CR) have been investigated as a promising solution to deploy Wireless Regional Area Networks (WRANs) for an efficient spectrum utilization. Communication devices with CR capabilities are able to access spectrum bands licensed for other wireless services in an opportunistic and secondary fashion, while preventing harmful interference to incumbent licensed services. However, a lesson learned from early experiences in developing such macro-cellular networks is that it becomes increasingly less economically viable to develop CR macrocellular infrastructures for increasing data rates in both line-of-sight as well as non-line-of-sight situation of WRAN, and the corresponding quality of service (QoS) in macrocellular networks is also noticeably degraded due to path loss, shadowing, and multipath fading due to wall penetration. Moreover, there are several challenges to make the real-world CR enabling dynamic spectrum access a difficult problem to implement without harmful interference. First, the hardware design of cognitive radio on the physical layer involves the tuning over a broad range of spectrum to detect a weak signal in a dynamic environment of fading channels, which in turn makes identification of the spectrum opportunities hard to achieve in an efficient and accurate manner. Second, opportunistic media access based on imperfect spectrum usage information obtain from physical layer brings up undesirable interference issue, as well as reliability issues introduced by mutual interference. Third, the curial issue is to determine which channels to use for data transmissions in presence of the dynamic and opportunistic nature of wireless environments, in the case where pre-defined dedicated control channel is not available in the complex and heterogenous networks. In this dissertation, a novel framework called Cognitive-Empowered Femtocell (CEF), which combines CR techniques with femtocell networking, is introduced to tackle these challenges and achieve better spectrum reuse, lower interference, easy integration, wider network coverage, as well as fast and cost effective early stage WRAN. In this framework, a sensing coordination scheme is proposed to gracefully unshackles the master/slave relationship between central controllers and end users, while maintaining order and coordination such that better sensing precision and efficiency can be achieved. As such, the network intelligence can be expanded from controlling the intelligence paradigm to better understand the satisfy wireless user needs. We also discuss design and deployment aspects such as sensing with reasoning approach, gossip-enabled stochastic media access without a dedicated control channel, all of which are important to the success of the CEF framework. We illustrate that such a framework allows wireless users to intelligently capture spectrum opportunities while mitigating interference to other users, as well as improving the network capacity. Performance analysis and simulations were conducted based on these techniques to provide insight on the future direction of interference suppression for dynamic spectrum access

Modular wireless networks for infrastructure-challenged environments

While access to Internet and cellular connectivity is easily achieved in densely-populated areas, provisioning of communication services is much more challenging in remote rural areas. At the same time Internet access is of critical importance to residents of such rural communities. People's curiosity and realization of the opportunities provided by Internet and cellular access is the key ingredient to adoption. However, poor network performance can easily impede the process of adoption by discouraging people to access and use connectivity. With this in mind, we evaluate performance and adoption of various connectivity technologies in rural developing regions and identify avenues that need immediate attention to guarantee smoother technology adoption. In light of this analysis we propose novel system designs that meet these needs. In this thesis we focus on cellular and broadband Internet connectivity. Commercial cellular networks are highly centralized, which requires costly backhaul. This, coupled with high price for equipment, maintenance and licensing renders cellular network access commercially-infeasible in rural areas. At the same time rural cellular communications are highly local: 70% of the rural-residential calls have an originator-destination pair within the same antenna. In line with this observation we design a low-cost cellular network architecture dubbed Kwiizya, to provide local voice and text messaging services in a rural community. Where outbound connectivity is available, Kwiizya can provide global services. While commercial networks are becoming more available in rural areas they are often out of financial reach of rural residents. Furthermore, these networks typically provide only basic voice and SMS services and no mobile data. To address these challenges, our proposed work allows Kwiizya to operate in coexistence with commercial cellular networks in order to extend local coverage and provide more advanced services that are not delivered by the commercial networks. Internet connectivity in rural areas is typically provided through slow satellite links. The challenges in performance and adoption of such networks have been previously studied. We add a unique dataset and consequent analysis to this spectrum of work, which captures the upgrade of the gateway connectivity in the rural community of Macha, Zambia from a 256kbps satellite link to a more capable 2Mbps terrestrial link. We show that the improvement in performance and user experience is not necessarily proportional to the bandwidth increase. While this increase improved the network usability, it also opened opportunities for adoption of more demanding services that were previously out of reach. As a result the network performance was severely degraded over the long term. To address these challenges we employ white space communication both for connectivity to more capable remote gateways, as well as for end user connectivity. We develop VillageLink, a distributed method that optimizes channel allocation to maximize throughput and enables both remote gateway access as well as end user coverage. While VillageLink features lightweight channel probing, we also consider external sources of channel availability. We design a novel approach for estimation of channel occupancy called TxMiner, which is capable of extracting transmitter characteristics from raw spectrum measurements. We study the adoption and implications of network connectivity in rural communities. In line with the results of our analyses we design and build system architectures that are geared to meet critical needs in these communities. While the focus of analysis in this thesis is on rural sub-Saharan Africa, the proposed designs and system implementations are more general and can serve in infrastructure-challenged communities across the world

Messhu-gata musen nettowaku ni okeru supekutoramu kenchi to MAC-so purotokoru ni kansuru kenkyu

制度:新 ; 報告番号:甲3458号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2011/11/16 ; 早大学位記番号:新578

Traffic Scheduling in Point-to-Multipoint OFDMA-based Systems

The new generation of wireless networks (e.g., WiMAX, LTE-Advanced, Cognitive Radio) support many high resource-consuming services (e.g., VoIP, video conference, multiplayer interactive gaming, multimedia streaming, digital video broadcasting, mobile commerce). The main problem of such networks is that the bandwidth is limited, besides to be subject to fading process, and shared among multiple users. Therefore, a combination of sophisticated transmission techniques (e.g., OFDMA) and proper packet scheduling algorithms is necessary, in order to provide applications with suitable quality of service. This Thesis addresses the problem of traffic scheduling in Point-to-Multipoint OFDMA-based systems. We formally prove that in such systems, even a simple scheduling problem of a Service Class at a time, is NP-complete, therefore, computationally intractable. An optimal solution is unfeasible in term of time, thus, fast and simple scheduling heuristics are needed. First, we address the Best Effort traffic scheduling issue, in a system adopting variable-length Frames, with the objective of producing a legal schedule (i.e., the one meeting all system constraints) of minimum length. Besides, we present fast and simple heuristics, which generate suboptimal solutions, and evaluate their performance in the average case, as in the worst one. Then, we investigate the scheduling of Real Time traffic, with the objective of meeting as many deadlines as possible, or equivalently, minimizing the packet drop ratio. Specifically, we propose two scheduling heuristics, which apply two different resource allocation mechanisms, and evaluate their average-case performance by means of a simulation experiment

Improving Inter-service bandwidth fairness in Wireless Mesh Networks

Includes bibliographical references.We are currently experiencing many technological advances and as a result, a lot of applications and services are developed for use in homes, offices and out in the field. In order to attract users and customers, most applications and / or services are loaded with graphics, pictures and movie clips. This unfortunately means most of these next generation services put a lot of strain on networking resources, namely bandwidth. Efficient management of bandwidth in next generation wireless network is therefore important for ensuring fairness in bandwidth allocation amongst multiple services with diverse quality of service needs. A number of algorithms have been proposed for fairness in bandwidth allocation in wireless networks, and some researchers have used game theory to model the different aspects of fairness. However, most of the existing algorithms only ensure fairness for individual requests and disregard fairness among the classes of services while some other algorithms ensure fairness for the classes of services and disregard fairness among individual requests