The Experts below are selected from a list of 189 Experts worldwide ranked by ideXlab platform
David Starobinski - One of the best experts on this subject based on the ideXlab platform.
-
Jamming-resistant rate adaptation in Wi-Fi networks
Performance Evaluation, 2014Co-Authors: Cankut Orakcal, David StarobinskiAbstract:We introduce a theoretical framework to formally analyze the vulnerability of IEEE 802.11 rate adaptation algorithms (RAAs) to selective jamming attacks, and to develop countermeasures providing provable performance guarantees. Thus, we propose a new metric called Rate of Jamming (RoJ), wherein a low RoJ implies that an RAA is highly vulnerable to jamming attacks, while a high RoJ implies that the RAA is resilient. We prove that several state-of-the-art RAAs, such as ARF and Samplerate, have a low RoJ (i.e., 10% or lower). Next, we propose a robust RAA, called Randomized ARF (RARF). Using tools from renewal theory, we derive a closed-form lower bound on the RoJ of RARF. We validate our theoretical analysis using ns-3 simulations and show that the minimum jamming rate required against RARF is about 33% (i.e., at least three times higher than the RoJ of other RAAs).
-
Jamming-Resistant Rate Control in Wi-Fi Networks
2013Co-Authors: Cankut Orakcal, David StarobinskiAbstract:Abstract—Recent experimental studies reveal that several wellknown and widely deployed rate adaptation algorithms (RAAs) in 802.11 WLANs are vulnerable to selective jamming attacks. However, previous work resorts to complex jamming strategies that are hard to implement and does not provide applicable solutions to this problem. In this work, we analyze the vulnerabilities of existing RAAs to simple jamming attacks and propose judicious use of randomization to address this problem. We introduce a theoretical framework based on a bursty periodic jamming model to analyze the vulnerabilities of popular RAAs, such as ARF and Samplerate. Our parameterized analysis shows that a jamming rate of 10 % or below is sufficient to bring the throughput of these algorithms below the base rate of 1 Mb/s. Thereafter, we propose Randomized ARF (RARF), which has higher resistance to jamming attacks. We derive a closed-form lower bound on the minimum jamming rate required to keep the RARF throughput below the base rate. Finally, we conduct ns-3 simulations implementing various RAAs and jamming strategies for an IEEE 802.11g WLAN. Our simulations validate jamming strategies under different channel models and show that the minimum jamming rate required against RARF is about 33%. I
-
GLOBECOM - Jamming-resistant rate control in Wi-Fi networks
2012 IEEE Global Communications Conference (GLOBECOM), 2012Co-Authors: Cankut Orakcal, David StarobinskiAbstract:Recent experimental studies reveal that several well-known and widely deployed rate adaptation algorithms (RAAs) in 802.11 WLANs are vulnerable to selective jamming attacks. However, previous work resorts to complex jamming strategies that are hard to implement and does not provide applicable solutions to this problem. In this work, we analyze the vulnerabilities of existing RAAs to simple jamming attacks and propose judicious use of randomization to address this problem. We introduce a theoretical framework based on a bursty periodic jamming model to analyze the vulnerabilities of popular RAAs, such as ARF and Samplerate. Our parameterized analysis shows that a jamming rate of 10% or below is sufficient to bring the throughput of these algorithms below the base rate of 1 Mb/s. Thereafter, we propose Randomized ARF (RARF), which has higher resistance to jamming attacks. We derive a closed-form lower bound on the minimum jamming rate required to keep the RARF throughput below the base rate. Finally, we conduct ns-3 simulations implementing various RAAs and jamming strategies for an IEEE 802.11g WLAN. Our simulations validate jamming strategies under different channel models and show that the minimum jamming rate required against RARF is about 33%.
Hao Yang - One of the best experts on this subject based on the ideXlab platform.
-
MobiCom - MIMO rate adaptation in 802.11n wireless networks
Proceedings of the sixteenth annual international conference on Mobile computing and networking - MobiCom '10, 2010Co-Authors: Ioannis Pefkianakis, Starsky H.y. Wong, Hao YangAbstract:This paper studies MIMO based rate adaptation (RA) in 802.11n wireless networks. Our case study shows that existing RA algorithms offer much lower throughput than even a fixed-rate scheme. The fundamental problem is that, all such algorithms are MIMO oblivious; they do not consider the characteristics of diversity-oriented, single-stream mode and the spatial multiplexing driven, double-stream mode. We propose MiRA, a novel MIMO RA scheme that zigzags between intra- and inter-mode rate options. Our experiments show that MiRA consistently outperforms three representative RA algorithms, Samplerate, RRAA and Atheros MIMO RA, in static, mobility and collision settings.
-
Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking - MobiCom '06, 2006Co-Authors: Starsky H.y. Wong, Songwu Lu, Hao Yang, Vaduvur BharghavanAbstract:Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploit- ing themulti-rate capability at the physical layer. In this pa- per, we conduct a systematic and experimental study on rate adaptation over 802.11 wireless networks. Our main contri- butions are two-fold. First, we critique five design guidelines adopted bymost existing algorithms. Our study reveals that these seemingly correct guidelines can bemisleading in prac- tice, thus incur significant performance penalty in certain scenarios. The fundamental challenge is that rate adapta- tion must accurately estimate the channel condition despite the presence of various dynamics caused by fading, mobility and hidden terminals. Second, we design and implement a new Robust Rate Adaptation Algorithm (RRAA) that ad- dresses the above challenge. RRAA uses short-term loss ra- tio to opportunistically guide its rate change decisions, and an adaptive RTS filter to prevent collision losses from trig- gering rate decrease. Our extensive experiments have shown that RRAA outperforms three well-known rate adaptation solutions (ARF, AARF, and Samplerate) in all tested sce- narios, with throughput improvement up to 143%.
-
MobiCom - Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking - MobiCom '06, 2006Co-Authors: Starsky H.y. Wong, Hao Yang, Vaduvur BharghavanAbstract:Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploiting the multi-rate capability at the physical layer.I n this paper, we conduct a systematic and experimental study on rate adaptation over 802.11 wireless networks. Our main contributions are two-fold. First, we critique five design guidelines adopted by most existing algorithms. Our study reveals that these seemingly correct guidelines can be misleading in practice, thus incur significant performance penalty in certain scenarios. The fundamental challenge is that rate adaptation must accurately estimate the channel condition despite the presence of various dynamics caused by fading, mobility and hidden terminals. Second, we design and implement a new Robust Rate Adaptation Algorithm (RRAA)that addresses the above challenge. RRAA uses short-term loss ratio to opportunistically guide its rate change decisions, and an adaptive RTS filter to prevent collision losses from triggering rate decrease. Our extensive experiments have shown that RRAA outperforms three well-known rate adaptation solutions (ARF, AARF, and Samplerate) in all tested scenarios, with throughput improvement up to 143%.
Ioannis Pefkianakis - One of the best experts on this subject based on the ideXlab platform.
-
ISCC - History-aware rate adaptation in 802.11 wireless networks
2011 IEEE Symposium on Computers and Communications (ISCC), 2011Co-Authors: Ioannis PefkianakisAbstract:Rate adaptation (RA) is a mechanism unspecified by the 802.11 standards, yet critical to the system performance. Although many different design directions have been studied the past years [1]–[14], there are still little insights learned of how short-term channel's past performance can be utilized to limit transmissions at low throughput rates. In this paper, we conduct a systematic experimental study to expose the importance of history aware rate adaptation and explore new techniques to address this space. To this end, we design and implement HA-RRAA, a new robust RA algorithm which uses short-term loss ratio to opportunistically guide its rate selection, a cost-effective, adaptive RTS filter to prevent collision losses from triggering rate decrease and an adaptive probe time window to limit excessive probing at high lossy rates. Our experimental results show gains up to 63% of HA-RRAA over RRAA, RRAA+, Samplerate and ARF, in realistic field trials.
-
MobiCom - MIMO rate adaptation in 802.11n wireless networks
Proceedings of the sixteenth annual international conference on Mobile computing and networking - MobiCom '10, 2010Co-Authors: Ioannis Pefkianakis, Starsky H.y. Wong, Hao YangAbstract:This paper studies MIMO based rate adaptation (RA) in 802.11n wireless networks. Our case study shows that existing RA algorithms offer much lower throughput than even a fixed-rate scheme. The fundamental problem is that, all such algorithms are MIMO oblivious; they do not consider the characteristics of diversity-oriented, single-stream mode and the spatial multiplexing driven, double-stream mode. We propose MiRA, a novel MIMO RA scheme that zigzags between intra- and inter-mode rate options. Our experiments show that MiRA consistently outperforms three representative RA algorithms, Samplerate, RRAA and Atheros MIMO RA, in static, mobility and collision settings.
Cankut Orakcal - One of the best experts on this subject based on the ideXlab platform.
-
Jamming-resistant rate adaptation in Wi-Fi networks
Performance Evaluation, 2014Co-Authors: Cankut Orakcal, David StarobinskiAbstract:We introduce a theoretical framework to formally analyze the vulnerability of IEEE 802.11 rate adaptation algorithms (RAAs) to selective jamming attacks, and to develop countermeasures providing provable performance guarantees. Thus, we propose a new metric called Rate of Jamming (RoJ), wherein a low RoJ implies that an RAA is highly vulnerable to jamming attacks, while a high RoJ implies that the RAA is resilient. We prove that several state-of-the-art RAAs, such as ARF and Samplerate, have a low RoJ (i.e., 10% or lower). Next, we propose a robust RAA, called Randomized ARF (RARF). Using tools from renewal theory, we derive a closed-form lower bound on the RoJ of RARF. We validate our theoretical analysis using ns-3 simulations and show that the minimum jamming rate required against RARF is about 33% (i.e., at least three times higher than the RoJ of other RAAs).
-
Jamming-Resistant Rate Control in Wi-Fi Networks
2013Co-Authors: Cankut Orakcal, David StarobinskiAbstract:Abstract—Recent experimental studies reveal that several wellknown and widely deployed rate adaptation algorithms (RAAs) in 802.11 WLANs are vulnerable to selective jamming attacks. However, previous work resorts to complex jamming strategies that are hard to implement and does not provide applicable solutions to this problem. In this work, we analyze the vulnerabilities of existing RAAs to simple jamming attacks and propose judicious use of randomization to address this problem. We introduce a theoretical framework based on a bursty periodic jamming model to analyze the vulnerabilities of popular RAAs, such as ARF and Samplerate. Our parameterized analysis shows that a jamming rate of 10 % or below is sufficient to bring the throughput of these algorithms below the base rate of 1 Mb/s. Thereafter, we propose Randomized ARF (RARF), which has higher resistance to jamming attacks. We derive a closed-form lower bound on the minimum jamming rate required to keep the RARF throughput below the base rate. Finally, we conduct ns-3 simulations implementing various RAAs and jamming strategies for an IEEE 802.11g WLAN. Our simulations validate jamming strategies under different channel models and show that the minimum jamming rate required against RARF is about 33%. I
-
GLOBECOM - Jamming-resistant rate control in Wi-Fi networks
2012 IEEE Global Communications Conference (GLOBECOM), 2012Co-Authors: Cankut Orakcal, David StarobinskiAbstract:Recent experimental studies reveal that several well-known and widely deployed rate adaptation algorithms (RAAs) in 802.11 WLANs are vulnerable to selective jamming attacks. However, previous work resorts to complex jamming strategies that are hard to implement and does not provide applicable solutions to this problem. In this work, we analyze the vulnerabilities of existing RAAs to simple jamming attacks and propose judicious use of randomization to address this problem. We introduce a theoretical framework based on a bursty periodic jamming model to analyze the vulnerabilities of popular RAAs, such as ARF and Samplerate. Our parameterized analysis shows that a jamming rate of 10% or below is sufficient to bring the throughput of these algorithms below the base rate of 1 Mb/s. Thereafter, we propose Randomized ARF (RARF), which has higher resistance to jamming attacks. We derive a closed-form lower bound on the minimum jamming rate required to keep the RARF throughput below the base rate. Finally, we conduct ns-3 simulations implementing various RAAs and jamming strategies for an IEEE 802.11g WLAN. Our simulations validate jamming strategies under different channel models and show that the minimum jamming rate required against RARF is about 33%.
Starsky H.y. Wong - One of the best experts on this subject based on the ideXlab platform.
-
MobiCom - MIMO rate adaptation in 802.11n wireless networks
Proceedings of the sixteenth annual international conference on Mobile computing and networking - MobiCom '10, 2010Co-Authors: Ioannis Pefkianakis, Starsky H.y. Wong, Hao YangAbstract:This paper studies MIMO based rate adaptation (RA) in 802.11n wireless networks. Our case study shows that existing RA algorithms offer much lower throughput than even a fixed-rate scheme. The fundamental problem is that, all such algorithms are MIMO oblivious; they do not consider the characteristics of diversity-oriented, single-stream mode and the spatial multiplexing driven, double-stream mode. We propose MiRA, a novel MIMO RA scheme that zigzags between intra- and inter-mode rate options. Our experiments show that MiRA consistently outperforms three representative RA algorithms, Samplerate, RRAA and Atheros MIMO RA, in static, mobility and collision settings.
-
Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking - MobiCom '06, 2006Co-Authors: Starsky H.y. Wong, Songwu Lu, Hao Yang, Vaduvur BharghavanAbstract:Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploit- ing themulti-rate capability at the physical layer. In this pa- per, we conduct a systematic and experimental study on rate adaptation over 802.11 wireless networks. Our main contri- butions are two-fold. First, we critique five design guidelines adopted bymost existing algorithms. Our study reveals that these seemingly correct guidelines can bemisleading in prac- tice, thus incur significant performance penalty in certain scenarios. The fundamental challenge is that rate adapta- tion must accurately estimate the channel condition despite the presence of various dynamics caused by fading, mobility and hidden terminals. Second, we design and implement a new Robust Rate Adaptation Algorithm (RRAA) that ad- dresses the above challenge. RRAA uses short-term loss ra- tio to opportunistically guide its rate change decisions, and an adaptive RTS filter to prevent collision losses from trig- gering rate decrease. Our extensive experiments have shown that RRAA outperforms three well-known rate adaptation solutions (ARF, AARF, and Samplerate) in all tested sce- narios, with throughput improvement up to 143%.
-
MobiCom - Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking - MobiCom '06, 2006Co-Authors: Starsky H.y. Wong, Hao Yang, Vaduvur BharghavanAbstract:Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploiting the multi-rate capability at the physical layer.I n this paper, we conduct a systematic and experimental study on rate adaptation over 802.11 wireless networks. Our main contributions are two-fold. First, we critique five design guidelines adopted by most existing algorithms. Our study reveals that these seemingly correct guidelines can be misleading in practice, thus incur significant performance penalty in certain scenarios. The fundamental challenge is that rate adaptation must accurately estimate the channel condition despite the presence of various dynamics caused by fading, mobility and hidden terminals. Second, we design and implement a new Robust Rate Adaptation Algorithm (RRAA)that addresses the above challenge. RRAA uses short-term loss ratio to opportunistically guide its rate change decisions, and an adaptive RTS filter to prevent collision losses from triggering rate decrease. Our extensive experiments have shown that RRAA outperforms three well-known rate adaptation solutions (ARF, AARF, and Samplerate) in all tested scenarios, with throughput improvement up to 143%.
