The Experts below are selected from a list of 25122 Experts worldwide ranked by ideXlab platform

Predrag Spasojevic - One of the best experts on this subject based on the ideXlab platform.

  • trade offs of source location protection in globally attacked sensor Networks a case analysis
    Sensor Mesh and Ad Hoc Communications and Networks, 2011
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    This paper studies source location anonymity in a large monitoring wireless sensor Network with a single data collector, and under a global attack. The qualifier ”global” indicates the capability of the eavesdropper (attacker) to capture all Network transmissions, and to discern their time and location. We propose a scheme for generating fake Network traffic to disguise the real event notification. This scheme is particularly effective for the protection of the monitored asset in delay-intolerant applications monitoring rare and spatially sparse events. Unlike earlier work on this topic, we jointly consider the protection strength, events' dynamics, probability of the attacker's exposure during the attack, notification latency, Network overhead, and scalability. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such framework, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. A good dummy-source group design also provides a robust protection of event bursts. This is achieved at the expense of the significant overhead as the number of dummy-source groups must be increased to the reciprocal value of the false alarm parameter used in the statistical test. Ultimately, our message is that designing a protection scheme to meet multiple requirements, imposed by realistic application scenarios, involves trade-offs among several performance measures, and calls for an evaluation framework that recognizes these challenges. We believe that the proposed source anonymity protection strategy, and the evaluation framework, are well justified by the abundance of the applications that monitor a rare event with uniform spatial distribution.

  • the quality of source location protection in globally attacked sensor Networks
    IEEE International Conference on Pervasive Computing and Communications, 2011
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    We propose an efficient scheme for generating fake Network traffic to disguise the real event notification in the presence of a global eavesdropper, which is especially relevant for the quality of service in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. We believe that the proposed source anonymity protection strategy, and the quality evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal and uniform spatial statistics.

  • quality of source location protection in globally attacked sensor Networks
    arXiv: Cryptography and Security, 2010
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    We propose an efficient scheme for generating fake Network traffic to disguise the real event notification in the presence of a global eavesdropper, which is especially relevant for the quality of service in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake traffic schedule. We believe that the proposed source anonymity protection strategy, and the quality evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal statistics, and uniform spatial distribution.

  • some important aspects of source location protection in globally attacked sensor Networks
    arXiv: Cryptography and Security, 2010
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    In the problem of location anonymity of the events exposed to a global eavesdropper, we highlight and analyze some aspects that are missing in the prior work, which is especially relevant for the quality of secure sensing in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. We propose an efficient scheme for generating fake Network traffic to disguise the real event notification. The efficiency of the scheme that provides statistical source location anonymity is achieved by Partitioning Network nodes randomly into several dummy source groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. A good dummy source group design also provides a robust protection of event bursts. This is achieved at the expense of the significant overhead as the number of dummy source groups must be increased to the reciprocal value of the false alarm parameter used in the statistical test. We believe that the proposed source anonymity protection strategy, and the evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal statistics, and uniform spatial distribution.

K. H. Wang - One of the best experts on this subject based on the ideXlab platform.

  • nonstop continuous multimedia streaming in wireless ad hoc Networks with node mobility
    IEEE Journal on Selected Areas in Communications, 2003
    Co-Authors: K. H. Wang
    Abstract:

    Guaranteeing continuous streaming of multimedia data from service providers to the users is a challenging task in wireless ad hoc Networks, particularly when node mobility is considered. The topological dynamics introduced by node mobility are further exacerbated by the natural grouping behavior of mobile users, which leads to frequent Network Partitioning. Network Partitioning poses significant challenges to the provisioning of continuous multimedia streaming services in wireless ad hoc Networks, since the Partitioning disconnects many mobile users from the centralized streaming service. In this paper, we propose NonStop, a collection of novel middleware-based run-time algorithms that ensures the continuous availability of such multimedia streaming services, while minimizing the overhead involved. The Network-wide continuous streaming coverage is achieved by partition prediction and service replication on the streaming sources and assisted by distributed selection of streaming sources on regular mobile nodes and users. The proposed algorithms are validated by extensive results from performance evaluations.

  • efficient and guaranteed service coverage in partitionable mobile ad hoc Networks
    International Conference on Computer Communications, 2002
    Co-Authors: K. H. Wang, Baochun Li
    Abstract:

    In wireless ad-hoc Networks, the Network topology changes dynamically and unpredictably due to node mobility. Such topological dynamics are further exacerbated by the natural grouping behavior in the mobile user's movement, which leads to frequent Network Partitioning. Network Partitioning poses significant challenges to the provisioning of centralized services in ad-hoc Networks, since Partitioning disconnects many mobile users from the central server. We propose a collection of novel run-time algorithms that adaptively ensure the centralized service is available to all mobile nodes during Network Partitioning, while minimizing the number of servers required. The Network-wide service coverage is achieved by partition prediction and service replication on the servers, and assisted by distributed service selection on regular mobile nodes. Simulation results show that our algorithm efficiently achieves guaranteed service coverage to all nodes. To the best of our knowledge, there have been no similar approaches that use partition prediction to provision centralized services adaptively in partitionable mobile ad-hoc Networks.

Silvija Kokaljfilipovic - One of the best experts on this subject based on the ideXlab platform.

  • trade offs of source location protection in globally attacked sensor Networks a case analysis
    Sensor Mesh and Ad Hoc Communications and Networks, 2011
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    This paper studies source location anonymity in a large monitoring wireless sensor Network with a single data collector, and under a global attack. The qualifier ”global” indicates the capability of the eavesdropper (attacker) to capture all Network transmissions, and to discern their time and location. We propose a scheme for generating fake Network traffic to disguise the real event notification. This scheme is particularly effective for the protection of the monitored asset in delay-intolerant applications monitoring rare and spatially sparse events. Unlike earlier work on this topic, we jointly consider the protection strength, events' dynamics, probability of the attacker's exposure during the attack, notification latency, Network overhead, and scalability. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such framework, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. A good dummy-source group design also provides a robust protection of event bursts. This is achieved at the expense of the significant overhead as the number of dummy-source groups must be increased to the reciprocal value of the false alarm parameter used in the statistical test. Ultimately, our message is that designing a protection scheme to meet multiple requirements, imposed by realistic application scenarios, involves trade-offs among several performance measures, and calls for an evaluation framework that recognizes these challenges. We believe that the proposed source anonymity protection strategy, and the evaluation framework, are well justified by the abundance of the applications that monitor a rare event with uniform spatial distribution.

  • the quality of source location protection in globally attacked sensor Networks
    IEEE International Conference on Pervasive Computing and Communications, 2011
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    We propose an efficient scheme for generating fake Network traffic to disguise the real event notification in the presence of a global eavesdropper, which is especially relevant for the quality of service in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. We believe that the proposed source anonymity protection strategy, and the quality evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal and uniform spatial statistics.

  • quality of source location protection in globally attacked sensor Networks
    arXiv: Cryptography and Security, 2010
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    We propose an efficient scheme for generating fake Network traffic to disguise the real event notification in the presence of a global eavesdropper, which is especially relevant for the quality of service in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake traffic schedule. We believe that the proposed source anonymity protection strategy, and the quality evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal statistics, and uniform spatial distribution.

  • some important aspects of source location protection in globally attacked sensor Networks
    arXiv: Cryptography and Security, 2010
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    In the problem of location anonymity of the events exposed to a global eavesdropper, we highlight and analyze some aspects that are missing in the prior work, which is especially relevant for the quality of secure sensing in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. We propose an efficient scheme for generating fake Network traffic to disguise the real event notification. The efficiency of the scheme that provides statistical source location anonymity is achieved by Partitioning Network nodes randomly into several dummy source groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. A good dummy source group design also provides a robust protection of event bursts. This is achieved at the expense of the significant overhead as the number of dummy source groups must be increased to the reciprocal value of the false alarm parameter used in the statistical test. We believe that the proposed source anonymity protection strategy, and the evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal statistics, and uniform spatial distribution.

Fabrice Le Fessant - One of the best experts on this subject based on the ideXlab platform.

  • trade offs of source location protection in globally attacked sensor Networks a case analysis
    Sensor Mesh and Ad Hoc Communications and Networks, 2011
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    This paper studies source location anonymity in a large monitoring wireless sensor Network with a single data collector, and under a global attack. The qualifier ”global” indicates the capability of the eavesdropper (attacker) to capture all Network transmissions, and to discern their time and location. We propose a scheme for generating fake Network traffic to disguise the real event notification. This scheme is particularly effective for the protection of the monitored asset in delay-intolerant applications monitoring rare and spatially sparse events. Unlike earlier work on this topic, we jointly consider the protection strength, events' dynamics, probability of the attacker's exposure during the attack, notification latency, Network overhead, and scalability. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such framework, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. A good dummy-source group design also provides a robust protection of event bursts. This is achieved at the expense of the significant overhead as the number of dummy-source groups must be increased to the reciprocal value of the false alarm parameter used in the statistical test. Ultimately, our message is that designing a protection scheme to meet multiple requirements, imposed by realistic application scenarios, involves trade-offs among several performance measures, and calls for an evaluation framework that recognizes these challenges. We believe that the proposed source anonymity protection strategy, and the evaluation framework, are well justified by the abundance of the applications that monitor a rare event with uniform spatial distribution.

  • the quality of source location protection in globally attacked sensor Networks
    IEEE International Conference on Pervasive Computing and Communications, 2011
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    We propose an efficient scheme for generating fake Network traffic to disguise the real event notification in the presence of a global eavesdropper, which is especially relevant for the quality of service in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. We believe that the proposed source anonymity protection strategy, and the quality evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal and uniform spatial statistics.

  • quality of source location protection in globally attacked sensor Networks
    arXiv: Cryptography and Security, 2010
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    We propose an efficient scheme for generating fake Network traffic to disguise the real event notification in the presence of a global eavesdropper, which is especially relevant for the quality of service in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. The efficiency of the scheme that provides statistical source anonymity is achieved by Partitioning Network nodes randomly into several node groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake traffic schedule. We believe that the proposed source anonymity protection strategy, and the quality evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal statistics, and uniform spatial distribution.

  • some important aspects of source location protection in globally attacked sensor Networks
    arXiv: Cryptography and Security, 2010
    Co-Authors: Silvija Kokaljfilipovic, Fabrice Le Fessant, Predrag Spasojevic
    Abstract:

    In the problem of location anonymity of the events exposed to a global eavesdropper, we highlight and analyze some aspects that are missing in the prior work, which is especially relevant for the quality of secure sensing in delay-intolerant applications monitoring rare and spatially sparse events, and deployed as large wireless sensor Networks with single data collector. We propose an efficient scheme for generating fake Network traffic to disguise the real event notification. The efficiency of the scheme that provides statistical source location anonymity is achieved by Partitioning Network nodes randomly into several dummy source groups. Members of the same group collectively emulate both temporal and spatial distribution of the event. Under such dummy-traffic framework of the source anonymity protection, we aim to better model the global eavesdropper, especially her way of using statistical tests to detect the real event, and to present the quality of the location protection as relative to the adversary's strength. In addition, our approach aims to reduce the per-event work spent to generate the fake traffic while, most importantly, providing a guaranteed latency in reporting the event. The latency is controlled by decoupling the routing from the fake-traffic schedule. A good dummy source group design also provides a robust protection of event bursts. This is achieved at the expense of the significant overhead as the number of dummy source groups must be increased to the reciprocal value of the false alarm parameter used in the statistical test. We believe that the proposed source anonymity protection strategy, and the evaluation framework, are well justified by the abundance of the applications that monitor a rare event with known temporal statistics, and uniform spatial distribution.

Jochen Schiller - One of the best experts on this subject based on the ideXlab platform.

  • a partition detection system for mobile ad hoc Networks
    Sensor Mesh and Ad Hoc Communications and Networks, 2004
    Co-Authors: Hartmut Ritter, Rolf Winter, Jochen Schiller
    Abstract:

    A vast amount of applications and mechanisms recently developed for mobile ad-hoc Networks could greatly benefit from the utilization of Network status information. That includes, but is not limited to the detection of Network Partitioning. Network Partitioning is a form of Network failure. A single connected Network topology breaks apart into two or more Network topologies separated from each other. Nodes within each partition are still able to communicate with each other but nodes in other partitions are unreachable. This paper proposes two different partition detection mechanisms, one using a centralized approach, the other one utilizing the advantages of a distributed mechanism. The simulations show that both approaches detect Partitioning reliably, with both having unique advantages.