1,510 research outputs found

    Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks

    Get PDF
    Copyright © 2014 Derui Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

    KALwEN+: Practical Key Management Schemes for Gossip-Based Wireless Medical Sensor Networks

    Get PDF
    The constrained resources of sensors restrict the design of a key management scheme for wireless sensor networks (WSNs). In this work, we first formalize the security model of ALwEN, which is a gossip-based wireless medical sensor network (WMSN) for ambient assisted living. Our security model considers the node capture, the gossip-based network and the revocation problems, which should be valuable for ALwEN-like applications. Based on Shamir's secret sharing technique, we then propose two key management schemes for ALwEN, namely the KALwEN+ schemes, which are proven with the security properties defined in the security model. The KALwEN+ schemes not only fit ALwEN, but also can be tailored to other scalable wireless sensor networks based on gossiping

    Resilient Network Coding in the Presence of Byzantine Adversaries

    Get PDF
    Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam zO links, our first algorithm achieves a rate of C - 2zO, where C is the network capacity. In contrast, when the adversary has limited eavesdropping capabilities, we provide algorithms that achieve the higher rate of C - zO. Our algorithms attain the optimal rate given the strength of the adversary. They are information-theoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomial time. Furthermore, only the source and destination need to be modified; nonmalicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks

    Intelligent spectrum management techniques for wireless cognitive radio networks

    Get PDF
    PhD ThesisThis thesis addresses many of the unique spectrum management chal- lenges in CR networks for the rst time. These challenges have a vital e ect on the network performance and are particularly di cult to solve due to the unique characteristics of CR networks. Speci cally, this thesis proposes and investigates three intelligent spectrum management tech- niques for CR networks. The issues investigated in this thesis have a fundamental impact on the establishment, functionality and security of CR networks. First, an intelligent primary receiver-aware message exchange protocol for CR ad hoc networks is proposed. It considers the problem of alleviat- ing the interference collision risk to primary user communication, explic- itly to protect primary receivers that are not detected during spectrum sensing. The proposed protocol achieves a higher measure of safeguard- ing. A practical scenario is considered where no global network topology is known and no common control channel is assumed to exist. Second, a novel CR broadcast protocol (CRBP) to reliably disseminate the broadcast messages to all or most of the possible CR nodes in the network is proposed. The CRBP formulates the broadcast problem as a bipartite-graph problem. Thus, CRBP achieves a signi cant successful delivery ratio by connecting di erent local topologies, which is a unique feature in CR ad hoc networks. Finally, a new defence strategy to defend against spectrum sensing data falsi cation attacks in CR networks is proposed. In order to identify malicious users, the proposed scheme performs multiple veri cations of sensory data with the assistance of trusted nodes.Higher Committee For Education Devel- opment in Iraq (HCED-Iraq

    A-VIP: Anonymous Verification and Inference of Positions in Vehicular Networks

    Get PDF
    MiniconferenceInternational audienceKnowledge of the location of vehicles and tracking of the routes they follow are a requirement for a number of applications, including e-tolling and liability attribution in case of accidents. However, public disclosure of the identity and position of drivers jeopardizes user privacy, and securing the tracking through asymmetric cryptography may have an exceedingly high computational cost. Additionally, there is currently no way an authority can verify the correctness of the position information provided by a potentially misbehaving car. In this paper, we address all of the issues above by introducing A-VIP, a lightweight framework for privacy preserving and tracking of vehicles. A-VIP leverages anonymous position beacons from vehicles, and the cooperation of nearby cars collecting and reporting the beacons they hear. Such information allows an authority to verify the locations announced by vehicles, or to infer the actual ones if needed. We assess the effectiveness of A-VIP through both realistic simulation and testbed implementation results, analyzing also its resilience to adversarial attacks
    corecore