Coalition Formation Game for Cooperative Cognitive Radio Using Gibbs Sampling

This paper considers a cognitive radio network in which each secondary user selects a primary user to assist in order to get a chance of accessing the primary user channel. Thus, each group of secondary users assisting the same primary user forms a coaltion. Within each coalition, sequential relaying is employed, and a relay ordering algorithm is used to make use of the relays in an efficient manner. It is required then to find the optimal sets of secondary users assisting each primary user such that the sum of their rates is maximized. The problem is formulated as a coalition formation game, and a Gibbs Sampling based algorithm is used to find the optimal coalition structure.Comment: 7 pages, 2 figure

Collaborative Information Processing in Wireless Sensor Networks for Diffusive Source Estimation

In this dissertation, we address the issue of collaborative information processing for diffusive source parameter estimation using wireless sensor networks (WSNs) capable of sensing in dispersive medium/environment, from signal processing perspective. We begin the dissertation by focusing on the mathematical formulation of a special diffusion phenomenon, i.e., an underwater oil spill, along with statistical algorithms for meaningful analysis of sensor data leading to efficient estimation of desired parameters of interest. The objective is to obtain an analytical solution to the problem, rather than using non-model based sophisticated numerical techniques. We tried to make the physical diffusion model as much appropriate as possible, while maintaining some pragmatic and reasonable assumptions for the simplicity of exposition and analytical derivation. The dissertation studies both source localization and tracking for static and moving diffusive sources respectively. For static diffusive source localization, we investigate two parametric estimation techniques based on the maximum-likelihood (ML) and the best linear unbiased estimator (BLUE) for a special case of our obtained physical dispersion model. We prove the consistency and asymptotic normality of the obtained ML solution when the number of sensor nodes and samples approach infinity, and derive the Cramer-Rao lower bound (CRLB) on its performance. In case of a moving diffusive source, we propose a particle filter (PF) based target tracking scheme for moving diffusive source, and analytically derive the posterior Cramer-Rao lower bound (PCRLB) for the moving source state estimates as a theoretical performance bound. Further, we explore nonparametric, machine learning based estimation technique for diffusive source parameter estimation using Dirichlet process mixture model (DPMM). Since real data are often complicated, no parametric model is suitable. As an alternative, we exploit the rich tools of nonparametric Bayesian methods, in particular the DPMM, which provides us with a flexible and data-driven estimation process. We propose DPMM based static diffusive source localization algorithm and provide analytical proof of convergence. The proposed algorithm is also extended to the scenario when multiple diffusive sources of same kind are present in the diffusive field of interest. Efficient power allocation can play an important role in extending the lifetime of a resource constrained WSN. Resource-constrained WSNs rely on collaborative signal and information processing for efficient handling of large volumes of data collected by the sensor nodes. In this dissertation, the problem of collaborative information processing for sequential parameter estimation in a WSN is formulated in a cooperative game-theoretic framework, which addresses the issue of fair resource allocation for estimation task at the Fusion center (FC). The framework allows addressing either resource allocation or commitment for information processing as solutions of cooperative games with underlying theoretical justifications. Different solution concepts found in cooperative games, namely, the Shapley function and Nash bargaining are used to enforce certain kinds of fairness among the nodes in a WSN

Joint Service Caching and Task Offloading for Mobile Edge Computing in Dense Networks

Mobile Edge Computing (MEC) pushes computing functionalities away from the centralized cloud to the network edge, thereby meeting the latency requirements of many emerging mobile applications and saving backhaul network bandwidth. Although many existing works have studied computation offloading policies, service caching is an equally, if not more important, design topic of MEC, yet receives much less attention. Service caching refers to caching application services and their related databases/libraries in the edge server (e.g. MEC-enabled BS), thereby enabling corresponding computation tasks to be executed. Because only a small number of application services can be cached in resource-limited edge server at the same time, which services to cache has to be judiciously decided to maximize the edge computing performance. In this paper, we investigate the extremely compelling but much less studied problem of dynamic service caching in MEC-enabled dense cellular networks. We propose an efficient online algorithm, called OREO, which jointly optimizes dynamic service caching and task offloading to address a number of key challenges in MEC systems, including service heterogeneity, unknown system dynamics, spatial demand coupling and decentralized coordination. Our algorithm is developed based on Lyapunov optimization and Gibbs sampling, works online without requiring future information, and achieves provable close-to-optimal performance. Simulation results show that our algorithm can effectively reduce computation latency for end users while keeping energy consumption low

A Game-theoretic Model for Regulating Freeriding in Subsidy-Based Pervasive Spectrum Sharing Markets

Cellular spectrum is a limited natural resource becoming scarcer at a worrisome rate. To satisfy users\u27 expectation from wireless data services, researchers and practitioners recognized the necessity of more utilization and pervasive sharing of the spectrum. Though scarce, spectrum is underutilized in some areas or within certain operating hours due to the lack of appropriate regulatory policies, static allocation and emerging business challenges. Thus, finding ways to improve the utilization of this resource to make sharing more pervasive is of great importance. There already exists a number of solutions to increase spectrum utilization via increased sharing. Dynamic Spectrum Access (DSA) enables a cellular operator to participate in spectrum sharing in many ways, such as geological database and cognitive radios, but these systems perform spectrum sharing at the secondary level (i.e., the bands are shared if and only if the primary/licensed user is idle) and it is questionable if they will be sufficient to meet the future expectations of the spectral efficiency. Along with the secondary sharing, spectrum sharing among primary users is emerging as a new domain of future mode of pervasive sharing. We call this type of spectrum sharing among primary users as pervasive spectrum sharing (PSS) . However, such spectrum sharing among primary users requires strong incentives to share and ensuring a freeriding-free cellular market. Freeriding in pervasively shared spectrum markets (be it via government subsidies/regulations or self-motivated coalitions among cellular operators) is a real techno-economic challenge to be addressed. In a PSS market, operators will share their resources with primary users of other operators and may sometimes have to block their own primary users in order to attain sharing goals. Small operators with lower quality service may freeride on large operators\u27 infrastructure in such pervasively shared markets. Even worse, since small operators\u27 users may perceive higher-than-expected service quality for a lower fee, this can cause customer loss to the large operators and motivate small operators to continue freeriding with additional earnings from the stolen customers. Thus, freeriding can drive a shared spectrum market to an unhealthy and unstable equilibrium. In this work, we model the freeriding by small operators in shared spectrum markets via a game-theoretic framework. We focus on a performance-based government incentivize scheme and aim to minimize the freeriding issue emerging in such PSS markets. We present insights from the model and discuss policy and regulatory challenges

D13.1 Fundamental issues on energy- and bandwidth-efficient communications and networking

Deliverable D13.1 del projecte europeu NEWCOM#The report presents the current status in the research area of energy- and bandwidth-efficient communications and networking and highlights the fundamental issues still open for further investigation. Furthermore, the report presents the Joint Research Activities (JRAs) which will be performed within WP1.3. For each activity there is the description, the identification of the adherence with the identified fundamental open issues, a presentation of the initial results, and a roadmap for the planned joint research work in each topic.Preprin

D11.2 Consolidated results on the performance limits of wireless communications

Deliverable D11.2 del projecte europeu NEWCOM#The report presents the Intermediate Results of N# JRAs on Performance Limits of Wireless Communications and highlights the fundamental issues that have been investigated by the WP1.1. The report illustrates the Joint Research Activities (JRAs) already identified during the first year of the project which are currently ongoing. For each activity there is a description, an illustration of the adherence and relevance with the identified fundamental open issues, a short presentation of the preliminary results, and a roadmap for the joint research work in the next year. Appendices for each JRA give technical details on the scientific activity in each JRA.Peer ReviewedPreprin