Moustafa Youssef

  1. A Hidden Markov Model for Localization Using Low-End GSM Cell Phones.

    Authors: Moustafa Youssef, Mohamed Ibrahim
    Subjects: Networking and Internet Architecture
    Abstract

    Research in location determination for GSM phones has gained interest
    recently as it enables a wide set of location based services. RSSI-based
    techniques have been the preferred method for GSM localization on the handset
    as RSSI information is available in all cell phones. Although the GSM standard
    allows for a cell phone to receive signal strength information from up to seven
    cell towers, many of today's cell phones are low-end phones, with limited API
    support, that gives only information about the associated cell tower.

  2. ARQ Security in Wi-Fi and RFID Networks.

    Authors: Moustafa Youssef, Hesham El Gamal, Mohamed Elsabagh, Yara Abdallah
    Subjects: Cryptography and Security
    Abstract

    In this paper, we present two practical ARQ-Based security schemes for Wi-Fi
    and RFID networks. Our proposed schemes enhance the confidentiality and
    authenticity functions of these networks, respectively. Both schemes build on
    the same idea; by exploiting the statistical independence between the multipath
    fading experienced by the legitimate nodes and potential adversaries, secret
    keys are established and then are continuously updated.

  3. The Two Way Wiretap Channel: Theory and Practice.

    Authors: Moustafa Youssef, Hesham El Gamal, Aly El Gamal, O. Ozan Koyluoglu
    Subjects: Information Theory
    Abstract

    This work considers the two way wiretap channel in which two legitimate
    users, Alice and Bob, wish to exchange messages securely in the presence of a
    passive eavesdropper Eve. In the full duplex scenario, where each node can
    transmit and receive simultaneously, we obtain new achievable secrecy rate
    regions based on the idea of allowing the two users to jointly optimize their
    channel prefixing distributions and binning codebooks; in addition to key
    sharing. The new regions are shown to be strictly larger than the known ones
    for a wide class of discrete memoryless and Gaussian channels.

  4. Keys through ARQ: Theory and Practice.

    Authors: Moustafa Youssef, Hesham El Gamal, Ahmed Sultan, Yara Abdallah, Mohamed Abdel Latif
    Subjects: Information Theory
    Abstract

    This paper develops a novel framework for sharing secret keys using the
    Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying
    information theoretic limits, under different assumptions on the channel
    spatial and temporal correlation function. Our analysis reveals a novel role of
    "dumb antennas" in overcoming the negative impact of spatial correlation on the
    achievable secrecy rates.

  5. GAC: Energy-Efficient Hybrid GPS-Accelerometer-Compass GSM Localization.

    Authors: Moustafa Youssef, Mohamed Amir Yosef, Mohamed El-Derini
    Subjects: Networking and Internet Architecture
    Abstract

    Adding location to the available information enables a new category of
    applications. With the constrained battery on cell phones, energy-efficient
    localization becomes an important challenge. In this paper we introduce a
    low-energy calibration-free localization scheme based on the available internal
    sensors in many of today's phones. We start by energy profiling the different
    sensors that can be used for localization.

  6. AROMA: Automatic Generation of Radio Maps for Localization Systems.

    Authors: Moustafa Youssef, Ahmed Eleryan, Mohamed Elsabagh
    Subjects: Networking and Internet Architecture
    Abstract

    WLAN localization has become an active research field recently. Due to the
    wide WLAN deployment, WLAN localization provides ubiquitous coverage and adds
    to the value of the wireless network by providing the location of its users
    without using any additional hardware. However, WLAN localization systems
    usually require constructing a radio map, which is a major barrier of WLAN
    localization systems' deployment. The radio map stores information about the
    signal strength from different signal strength streams at selected locations in
    the site of interest.

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

    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.

  8. Overlapping Multi-hop Clustering for Wireless Sensor Networks.

    Authors: Moustafa Youssef, Adel Youssef, Mohamed Younis
    Subjects: Networking and Internet Architecture
    Abstract

    Clustering is a standard approach for achieving efficient and scalable
    performance in wireless sensor networks. Traditionally, clustering algorithms
    aim at generating a number of disjoint clusters that satisfy some criteria. In
    this paper, we formulate a novel clustering problem that aims at generating
    overlapping multi-hop clusters. Overlapping clusters are useful in many sensor
    network applications, including inter-cluster routing, node localization, and
    time synchronization protocols.

  9. Randomization for Security in Half-Duplex Two-Way Gaussian Channels.

    Authors: Moustafa Youssef, Hesham El Gamal, Aly El Gamal
    Subjects: Information Theory
    Abstract

    This paper develops a new physical layer framework for secure two-way
    wireless communication in the presence of a passive eavesdropper, i.e., Eve.
    Our approach achieves perfect information theoretic secrecy via a novel
    randomized scheduling and power allocation scheme. The key idea is to allow
    Alice and Bob to send symbols at random time instants. While Alice will be able
    to determine the symbols transmitted by Bob, Eve will suffer from ambiguity
    regarding the source of any particular symbol. This desirable ambiguity is
    enhanced, in our approach, by randomizing the transmit power level.

  10. ARQ Secrecy: From Theory to Practice.

    Authors: Yara Omar, Moustafa Youssef, Hesham El Gamal
    Subjects: Information Theory
    Abstract

    Inspired by our earlier work on Automatic Repeat reQuest (ARQ) secrecy, we
    propose a simple, yet efficient, security overlay protocol to existing 802.11
    networks. Our work targets networks secured by the Wired Equivalent Privacy
    (WEP) protocol because of its widespread use and vulnerability to a multitude
    of security threats. By exploiting the existing ARQ protocol in the 802.11
    standard, our proposed opportunistic secrecy scheme is shown to defend against
    all known passive WEP attacks.

Syndicate content