2,431 research outputs found

    A context-aware matching game for user association in wireless small cell networks

    Full text link
    Small cell networks are seen as a promising technology for boosting the performance of future wireless networks. In this paper, we propose a novel context-aware user-cell association approach for small cell networks that exploits the information about the velocity and trajectory of the users while also taking into account their quality of service (QoS) requirements. We formulate the problem in the framework of matching theory with externalities in which the agents, namely users and small cell base stations (SCBSs), have strict interdependent preferences over the members of the opposite set. To solve the problem, we propose a novel algorithm that leads to a stable matching among the users and SCBSs. We show that the proposed approach can better balance the traffic among the cells while also satisfying the QoS of the users. Simulation results show that the proposed matching algorithm yields significant performance advantages relative to traditional context-unaware approaches.Comment: 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol., no., pp.439-443, 4-9 May 201

    A Colonel Blotto Game for Interdependence-Aware Cyber-Physical Systems Security in Smart Cities

    Full text link
    Smart cities must integrate a number of interdependent cyber-physical systems that operate in a coordinated manner to improve the well-being of the city's residents. A cyber-physical system (CPS) is a system of computational elements controlling physical entities. Large-scale CPSs are more vulnerable to attacks due to the cyber-physical interdependencies that can lead to cascading failures which can have a significant detrimental effect on a city. In this paper, a novel approach is proposed for analyzing the problem of allocating security resources, such as firewalls and anti-malware, over the various cyber components of an interdependent CPS to protect the system against imminent attacks. The problem is formulated as a Colonel Blotto game in which the attacker seeks to allocate its resources to compromise the CPS, while the defender chooses how to distribute its resources to defend against potential attacks. To evaluate the effects of defense and attack, various CPS factors are considered including human-CPS interactions as well as physical and topological characteristics of a CPS such as flow and capacity of interconnections and minimum path algorithms. Results show that, for the case in which the attacker is not aware of the CPS interdependencies, the defender can have a higher payoff, compared to the case in which the attacker has complete information. The results also show that, in the case of more symmetric nodes, due to interdependencies, the defender achieves its highest payoff at the equilibrium compared to the case with independent, asymmetric nodes

    Cognitive multiple-antenna network in outage-restricted primary system

    Get PDF

    Cognitive Multiple-Antenna Network with Outage and Rate Margins at the Primary System

    Get PDF

    An F-statistic based multi-detector veto for detector artifacts in continuous-wave gravitational wave data

    Full text link
    Continuous gravitational waves (CW) are expected from spinning neutron stars with non-axisymmetric deformations. A network of interferometric detectors (LIGO, Virgo and GEO600) is looking for these signals. They are predicted to be very weak and retrievable only by integration over long observation times. One of the standard methods of CW data analysis is the multi-detector F-statistic. In a typical search, the F-statistic is computed over a range in frequency, spin-down and sky position, and the candidates with highest F values are kept for further analysis. However, this detection statistic is susceptible to a class of noise artifacts, strong monochromatic lines in a single detector. By assuming an extended noise model - standard Gaussian noise plus single-detector lines - we can use a Bayesian odds ratio to derive a generalized detection statistic, the line veto (LV-) statistic. In the absence of lines, it behaves similarly to the F-statistic, but it is more robust against line artifacts. In the past, ad-hoc post-processing vetoes have been implemented in searches to remove these artifacts. Here we provide a systematic framework to develop and benchmark this class of vetoes. We present our results from testing this LV-statistic on simulated data.Comment: 2 pages, 1 figure, to be published in Proceedings of Statistical Challenges in Modern Astronomy V, Springer 201
    corecore