Accueil

Salah A. Aly

  1. A Distributed Data Collection Algorithm for Wireless Sensor Networks with Persistent Storage Nodes.

    Mon, 11/15/2010 - 16:01 — SomNambul
    Authors: H. Vincent Poor, Salah A. Aly, Ahmed Ali-Eldin
    Subjects: Networking and Internet Architecture
    Abstract

    A distributed data collection algorithm to accurately store and forward
    information obtained by wireless sensor networks is proposed. The proposed
    algorithm does not depend on the sensor network topology, routing tables, or
    geographic locations of sensor nodes, but rather makes use of uniformly
    distributed storage nodes. Analytical and simulation results for this algorithm
    show that, with high probability, the data disseminated by the sensor nodes can
    be precisely collected by querying any small set of storage nodes.

  2. Nonbinary Quantum Cyclic and Subsystem Codes Over Asymmetrically-decohered Quantum Channels.

    Wed, 02/17/2010 - 16:01 — SomNambul
    Authors: Salah A. Aly, Alexei Ashikhmin
    Subjects: Information Theory
    Abstract

    Quantum computers theoretically are able to solve certain problems more
    quickly than any deterministic or probabilistic computers. A quantum computer
    exploits the rules of quantum mechanics to speed up computations. However, one
    has to mitigate the resulting noise and decoherence effects to avoid
    computational errors in order to successfully build quantum computers.

  3. Asymmetric Quantum Cyclic Codes.

    Tue, 12/01/2009 - 16:02 — SomNambul
    Authors: Salah A. Aly
    Subjects: Information Theory
    Abstract

    It is recently conjectured in quantum information processing that phase-shift
    errors occur with high probability than qubit-flip errors, hence the former is
    more disturbing to quantum information than the later one. This leads us to
    construct asymmetric quantum error controlling codes to protect quantum
    information over asymmetric channels, $\Pr Z \geq \Pr X$.

  4. Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks.

    Wed, 10/28/2009 - 16:01 — SomNambul
    Authors: Zhenning Kong, Emina Soljanin, Salah A. Aly
    Subjects: Information Theory
    Abstract

    We consider large-scale wireless sensor networks with $n$ nodes, out of which
    k are in possession, (e.g., have sensed or collected in some other way) k
    information packets.

  5. Distributed Flooding-based Storage Algorithms for Large-scale Sensor Networks.

    Tue, 09/01/2009 - 12:47 — SomNambul
    Authors: Moustafa Youssef, Salah A. Aly, Hager S. Darwish, Mahmoud Zidan
    Subjects: Information Theory
    Abstract

    In this paper we propose distributed flooding-based storage algorithms for
    large-scale wireless sensor networks. Assume a wireless sensor network with $n$
    nodes that have limited power, memory, and bandwidth. Each node is capable of
    both sensing and storing data. Such sensor nodes might disappear from the
    network due to failures or battery depletion. Hence it is desired to design
    efficient schemes to collect data from these $n$ nodes. We propose two
    distributed storage algorithms (DSA's) that utilize network flooding to solve
    this problem.

Math-arch

Syndicate content