Imad Aad
Research Subjects
Imad Aad has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Joerg Widmer
IMDEA Networks Institute, Madrid, Spain
2 shared publications - Christian Hartmann
Chair of Teaching and Learning with Digital Media, Technical University of Munich, Munich, Germany
1 shared publication - Claude Castelluccia
INRIA France
1 shared publication - Farhan Riaz
DOCOMO Euro-Labs
1 shared publication - Jean-Pierre Hubaux
EPFL, Lausanne, Switzerland
1 shared publication - Luis Loyola
DOCOMO Euro-Labs
1 shared publication
Latest Publications
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 1-10
E-MAC: Self-Organizing 802.11-Compatible MAC with Elastic Real-time Scheduling
To overcome the lack of strict QoS guarantees in existing hotspots, in this paper we present a system for realtime traffic support in 802.11 networks that works in either infrastructure or ad-hoc mode. The proposed mechanism, called elastic MAC (E-MAC) protocol, helps stations with real-time traffic to organize and establish a transmission schedule in a distributed manner, while coexisting with standard 802.11 stations. This distributed scheduling guarantees very short delays and a minimum reserved data rate for real-time stations, while protecting best-effort 802.11 traffic from starvation. Another feature of our mechanism is time-slot reuse, which improves the network efficiency by allowing other real-time stations to take over unused slots (e.g., in case of using voice codecs with silence suppression). We evaluate the performance of our system using a testbed implementation, ns-2 simulations and a mathematical model, and show how it outperforms other QoS schemes (e.g., 802.11e) in terms of throughput, delay, and jitter.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 1-10
E-MAC: Self-Organizing 802.11-Compatible MAC with Elastic Real-time Scheduling
To overcome the lack of strict QoS guarantees in existing hotspots, in this paper we present a system for realtime traffic support in 802.11 networks that works in either infrastructure or ad-hoc mode. The proposed mechanism, called elastic MAC (E-MAC) protocol, helps stations with real-time traffic to organize and establish a transmission schedule in a distributed manner, while coexisting with standard 802.11 stations. This distributed scheduling guarantees very short delays and a minimum reserved data rate for real-time stations, while protecting best-effort 802.11 traffic from starvation. Another feature of our mechanism is time-slot reuse, which improves the network efficiency by allowing other real-time stations to take over unused slots (e.g., in case of using voice codecs with silence suppression). We evaluate the performance of our system using a testbed implementation, ns-2 simulations and a mathematical model, and show how it outperforms other QoS schemes (e.g., 802.11e) in terms of throughput, delay, and jitter.
- 1 January 2007
- Published by Springer Nature
- p. 81-96
Interferer Nulling Based on Neighborhood Communication Patterns
- 1 January 2007
- Published by Springer Nature
- p. 81-96
Interferer Nulling Based on Neighborhood Communication Patterns
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Packet Coding for Strong Anonymity in Ad Hoc Networks
Several techniques to improve anonymity have been proposed in the literature. They rely basically on multicast or on onion routing to thwart global attackers or local attackers respectively. None of the techniques provide a combined solution due to the incompatibility between the two components, as we show in this paper. We propose novel packet coding techniques that make the combination possible, thus integrating the advantages in a more complete and robust solution
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Packet Coding for Strong Anonymity in Ad Hoc Networks
Several techniques to improve anonymity have been proposed in the literature. They rely basically on multicast or on onion routing to thwart global attackers or local attackers respectively. None of the techniques provide a combined solution due to the incompatibility between the two components, as we show in this paper. We propose novel packet coding techniques that make the combination possible, thus integrating the advantages in a more complete and robust solution