The Experts below are selected from a list of 1293 Experts worldwide ranked by ideXlab platform
Daehun Nyang - One of the best experts on this subject based on the ideXlab platform.
-
Catch Me If You Can: Rogue Access Point Detection Using Intentional Channel Interference
IEEE Transactions on Mobile Computing, 2020Co-Authors: Rhongho Jang, Jeonil Kang, Aziz Mohaisen, Daehun NyangAbstract:In this paper, we introduce a powerful hardware-based rogue access point (PrAP), which can relay back and forth traffic between a legitimate AP and a Wireless Station, and act as a man-in-the-middle attacker. Our PrAP is built of two dedicated Wireless routers interconnected physically, and can relay traffic rapidly between a Station and a legitimate AP. Through experiments, we demonstrate that the state-of-the-art time-based rogue AP (rAP) detectors cannot detect our PrAP, although perhaps effective against software-based rAP. In demonstrating that, we unveil new insight into fundamentals of time-based detectors for software-based rAPs and their operation: such techniques are only capable of detecting rAPs due to the speed of Wireless AP bridging. To address the threat of such PrAPs, we propose a new tool for network administrators, a PrAP-Hunter based on intentional channel interference. Our PrAP-Hunter is highly accurate, even under heavy traffic scenarios. Using a high-performance (desktop) and low-performance (mobile phone) experimental setups of our PrAP-Hunter in various deployment scenarios, we demonstrate close to 100 percent of detection rate, compared to 60 percent detection rate by the state-of-the-art. We show that our PrAP-Hunter is fast (takes 5-10 seconds), does not require any prior knowledge, and can be deployed in the wild by real-world experiments at 10 coffee shops.
-
WISEC - Highly-accurate rogue access point detection using intentional channel interference: poster
Proceedings of the 10th ACM Conference on Security and Privacy in Wireless and Mobile Networks, 2017Co-Authors: Rhongho Jang, Jeonil Kang, Aziz Mohaisen, Daehun NyangAbstract:In this work, we introduce a powerful hardware-based rogue access point (PrAP), which can relay traffic between a legitimate AP and a Wireless Station, and act as a man-in-the-middle attacker. To defend against PrAPs, we propose PrAP-Hunter based on intentional channel interference. We demonstrate close to 100% of detection rate, compared to 60% detection rate by the state-of-the-art.
-
Rogue Access Point Detector Using Characteristics of Channel Overlapping in 802.11n
2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), 2017Co-Authors: Rhongho Jang, Jeonil Kang, Aziz Mohaisen, Daehun NyangAbstract:In this work, we introduce a powerful hardware-based rogue access point (PrAP), which can relay traffic between a legitimate AP and a Wireless Station back and forth, and act as a man-in-the-middle attacker. Our PrAP is built of two dedicated Wireless routers interconnected physically, and can relay traffic rapidly between a Station and a legitimate AP. Through extensive experiments, we demonstrate that the state-of-the-art time-based rogue AP (rAP) detectors cannot detect our PrAP, although effective against software-based rAP. To defend against PrAPs, we propose PrAP-Hunter based on intentional channel interference. PrAP-Hunter is highly accurate, even under heavy traffic scenarios. Using a high-performance (desktop) and low-performance (mobile) experimental setups of our PrAP-Hunter in various deployment scenarios, we demonstrate close to 100% of detection rate, compared to 60% detection rate by the state-of-the-art. We show that PrAP-Hunter is fast (takes 5-10 sec), does not require any prior knowledge, and can be deployed in the wild by real world experiments at 10 coffee shops.
Hideki Tode - One of the best experts on this subject based on the ideXlab platform.
-
Cooperation Control Between Wireless and Base Stations in Wireless Access Network Consisting of Wireless Networks with Different Coverages
2019 IEEE 44th Conference on Local Computer Networks (LCN), 2019Co-Authors: Ryosuke Nagayoshi, Yosuke Tanigawa, Hideki TodeAbstract:Mobile terminal users prefer WLAN (Wireless LAN) to cellular network because of no connection fee. WLANs are available in some places where many people gather in urban areas, whereas public access network like WLAN should be deployed at a low cost for rural leisure venues and momentary events. In this paper, we propose a Wireless access network with larger coverage than WLAN by the cooperation between WLAN and another Wireless network with larger coverage. This achieves the wider deployment of such Wireless access networks with a smaller number (cost) of base Stations. Connection control that decides which Wireless network should be used for each Wireless Station is also proposed to increase the effective network capacity of the Wireless access network. Performance evaluations show that the proposal achieves larger effective network capacity compared with greedy connection that all the Wireless Stations inside the WLAN coverage use the WLAN and the other ones do the other network with larger coverage, respectively.
-
LCN - Cooperation Control Between Wireless and Base Stations in Wireless Access Network Consisting of Wireless Networks with Different Coverages
2019 IEEE 44th Conference on Local Computer Networks (LCN), 2019Co-Authors: Ryosuke Nagayoshi, Yosuke Tanigawa, Hideki TodeAbstract:Mobile terminal users prefer WLAN (Wireless LAN) to cellular network because of no connection fee. WLANs are available in some places where many people gather in urban areas, whereas public access network like WLAN should be deployed at a low cost for rural leisure venues and momentary events. In this paper, we propose a Wireless access network with larger coverage than WLAN by the cooperation between WLAN and another Wireless network with larger coverage. This achieves the wider deployment of such Wireless access networks with a smaller number (cost) of base Stations. Connection control that decides which Wireless network should be used for each Wireless Station is also proposed to increase the effective network capacity of the Wireless access network. Performance evaluations show that the proposal achieves larger effective network capacity compared with greedy connection that all the Wireless Stations inside the WLAN coverage use the WLAN and the other ones do the other network with larger coverage, respectively.
-
CCNC - Adaptive channel selection control equalizing sojourn time of sending packets inside Wireless Stations in Wireless access networks
2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC), 2015Co-Authors: Taku Teramura, Yosuke Tanigawa, Hideki TodeAbstract:In recent years, Wireless networks have been utilized in many situations. However, further increase in network capacity is essential in order to transfer large volume of traffic demanded by many and various clients and applications. By introducing multi-channel environment, network capacity is increased. However, in cases that packet generation rates from Wireless Stations to a base Station are different among Wireless Stations, all the communication bandwidth over multiple channels is not properly allocated to Wireless Stations with larger generation rates in particular, even though there is enough available network bandwidth in total. This issue becomes significantly serious in actual Wireless access networks where the distance between the base Station and each Wireless Station is different, that means different maximum transmission rate of each Station, under the fading condition. Therefore, in this paper, we adaptively allocate proper communication channel, and as a result, adaptive bandwidth to all Wireless Stations so that they transmit all generated packets by equalizing sojourn time in their sending buffers if there is enough total network bandwidth over all channels. Finally, we show the effectiveness of the proposed method by computer simulation.
-
Adaptive channel selection control equalizing sojourn time of sending packets inside Wireless Stations in Wireless access networks
2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC), 2015Co-Authors: Taku Teramura, Yosuke Tanigawa, Hideki TodeAbstract:In recent years, Wireless networks have been utilized in many situations. However, further increase in network capacity is essential in order to transfer large volume of traffic demanded by many and various clients and applications. By introducing multi-channel environment, network capacity is increased. However, in cases that packet generation rates from Wireless Stations to a base Station are different among Wireless Stations, all the communication bandwidth over multiple channels is not properly allocated to Wireless Stations with larger generation rates in particular, even though there is enough available network bandwidth in total. This issue becomes significantly serious in actual Wireless access networks where the distance between the base Station and each Wireless Station is different, that means different maximum transmission rate of each Station, under the fading condition. Therefore, in this paper, we adaptively allocate proper communication channel, and as a result, adaptive bandwidth to all Wireless Stations so that they transmit all generated packets by equalizing sojourn time in their sending buffers if there is enough total network bandwidth over all channels. Finally, we show the effectiveness of the proposed method by computer simulation.
-
LCN Workshops - Adaptive channel selection control saving its redundant usage based on hidden Stations in Wireless access networks
37th Annual IEEE Conference on Local Computer Networks -- Workshops, 2012Co-Authors: Yosuke Tanigawa, Shintaro Matsuda, Hideki TodeAbstract:Recently, Wireless networks are utilized in various situations. However, the characteristic of Wireless environment causes many problems like limited bandwidth, collisions and interferences among transferred frames. It is required to enhance bandwidth with efficient channel utilization. In this paper, in Wireless access networks where a base Station and Wireless Stations communicate directly, we achieve higher network bandwidth by introducing multi-channel environment and utilizing each channel efficiently. Though Wireless networking with multiple channels is well explored, the most of the related works focus on Wireless multihop networks. However, the topology of Wireless access networks we assume is completely different from multihop networks. Hence, a new multi-channel protocol, with different architecture and algorithm, is required to increase network bandwidth. In this paper, we propose a new protocol suited to the target environment. Specifically, the proposed method controls operation channel of each Wireless Station to minimize collisions and interferences caused by hidden Station problem, and to balance data transfer load on every channel. Moreover, the proposed method minimizes the number of utilized channels by suppressing redundant usage of channels according to total data transfer load. This alleviates channel interferences among neighboring Wireless access networks and restricts power consumption at base Station. Finally, we show the effectiveness of the proposed method by computer simulation.
K.g. Shin - One of the best experts on this subject based on the ideXlab platform.
-
Smart power-saving mode for IEEE 802.11 Wireless LANs
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005Co-Authors: D. Qiao, K.g. ShinAbstract:Static PSM (power-saving mode) schemes employed in the current IEEE 802.11 implementations could not provide any delay-performance guarantee because of their fixed wakeup intervals. In this paper, we propose a smart PSM (SPSM) scheme, which directs a Wireless Station to sleep/wake up according to an "optimal" sequence, such that the desired delay performance is guaranteed with minimum energy consumption. Instead of constructing the sequence directly, SPSM takes a unique two-step approach. First, it translates an arbitrary user-desired delay performance into a generic penalty function. Second, it provides a generic algorithm that takes the penalty function as the input and produces the optimal Station action sequence automatically. This way, the potentially-complicated energy-consumption-minimization problem subject to delay-performance constraints is simplified and solved systematically. Our simulation results show that, with a two-stair penalty function, SPSM achieves delay performance similar to the BSD (bounded slowdown) protocol under various scenarios, but always with less energy consumption, thanks to its capability to adapt to changes in the response-time distribution. Moreover, because of SPSM's two-step design feature, it is more flexible than BSD in the sense of being able to meet arbitrary user-desired delay requirement, e.g., providing soft delay-bound guarantees with power penalty functions.
-
Achieving efficient channel utilization and weighted fairness for data communications in IEEE 802.11 WLAN under the DCF
IEEE 2002 Tenth IEEE International Workshop on Quality of Service (Cat. No.02EX564), 2002Co-Authors: Daji Qiao, K.g. ShinAbstract:Fair allocation of bandwidth and maximization of channel utilization are two important issues when designing a contention-based Wireless medium access control (MAC) protocol. However, achieving both design goals at the same time is very difficult, and has not yet been addressed elsewhere. We study this challenging problem, particularly for data communications in IEEE 802.11 Wireless local area networks (WLANs). We propose a priority-based fair medium access control (P-MAC) protocol by modifying the distributed coordination function (DCF) of the IEEE 802.11 MAC. The key idea is that the contention window size for each Wireless Station is properly selected to reflect: (1) the relative weights among data traffic flows, so as to achieve the weighted fairness; (2) the number of Stations contending for the Wireless medium, so as to maximize the aggregate throughput. In P-MAC, our approximations to the optimal contention window sizes, which are based on a theoretical analysis, are evaluated numerically and shown to work well under different network configurations and traffic scenarios. Moreover, simulation results show that, with few changes to the original DCF, P-MAC performs significantly better in terms of both fairness and throughput.
-
Goodput analysis and link adaptation for IEEE 802.11a Wireless LANs
IEEE Transactions on Mobile Computing, 2002Co-Authors: Daji Qiao, Sunghyun Choi, K.g. ShinAbstract:Link adaptation to dynamically select the data transmission rate at a given time has been recognized as an effective way to improve the goodput performance of the IEEE 802.11 Wireless local-area networks (WLANs). Recently, with the introduction of the new high-speed 802.11a physical layer (PHY), it is even more important to have a well-designed link adaptation scheme work with the 802.11a PHY such that its multiple transmission rates can be exploited. In this paper, we first present a generic method to analyze the goodput performance of an 802.11a system under the distributed coordination function (DCF) and express the expected effective goodput as a closed-form function of the data payload length, the frame retry count, the Wireless channel condition, and the selected data transmission rate. Then, based on the theoretical analysis, we propose a novel MPDU (MAC protocol data unit)-based link adaptation scheme for the 802.11a systems. It is a simple table-driven approach and the basic idea is to preestablish a best PHY mode table by applying the dynamic programming technique. The best PHY mode table is indexed by the system status triplet that consists of the data payload length, the Wireless channel condition, and the frame retry count. At runtime, a Wireless Station determines the most appropriate PHY mode for the next transmission attempt by a simple table lookup, using the most up-to-date system status as the index. Our in-depth simulation shows that the proposed MPDU-based link adaptation scheme outperforms the single-mode schemes and the autorate fallback (ARF) scheme-which is used in Lucent Technologies' WaveLAN-II networking devices-significantly in terms of the average goodput, the frame drop rate, and the average number of transmission attempts per data frame delivery.
Rhongho Jang - One of the best experts on this subject based on the ideXlab platform.
-
Catch Me If You Can: Rogue Access Point Detection Using Intentional Channel Interference
IEEE Transactions on Mobile Computing, 2020Co-Authors: Rhongho Jang, Jeonil Kang, Aziz Mohaisen, Daehun NyangAbstract:In this paper, we introduce a powerful hardware-based rogue access point (PrAP), which can relay back and forth traffic between a legitimate AP and a Wireless Station, and act as a man-in-the-middle attacker. Our PrAP is built of two dedicated Wireless routers interconnected physically, and can relay traffic rapidly between a Station and a legitimate AP. Through experiments, we demonstrate that the state-of-the-art time-based rogue AP (rAP) detectors cannot detect our PrAP, although perhaps effective against software-based rAP. In demonstrating that, we unveil new insight into fundamentals of time-based detectors for software-based rAPs and their operation: such techniques are only capable of detecting rAPs due to the speed of Wireless AP bridging. To address the threat of such PrAPs, we propose a new tool for network administrators, a PrAP-Hunter based on intentional channel interference. Our PrAP-Hunter is highly accurate, even under heavy traffic scenarios. Using a high-performance (desktop) and low-performance (mobile phone) experimental setups of our PrAP-Hunter in various deployment scenarios, we demonstrate close to 100 percent of detection rate, compared to 60 percent detection rate by the state-of-the-art. We show that our PrAP-Hunter is fast (takes 5-10 seconds), does not require any prior knowledge, and can be deployed in the wild by real-world experiments at 10 coffee shops.
-
WISEC - Highly-accurate rogue access point detection using intentional channel interference: poster
Proceedings of the 10th ACM Conference on Security and Privacy in Wireless and Mobile Networks, 2017Co-Authors: Rhongho Jang, Jeonil Kang, Aziz Mohaisen, Daehun NyangAbstract:In this work, we introduce a powerful hardware-based rogue access point (PrAP), which can relay traffic between a legitimate AP and a Wireless Station, and act as a man-in-the-middle attacker. To defend against PrAPs, we propose PrAP-Hunter based on intentional channel interference. We demonstrate close to 100% of detection rate, compared to 60% detection rate by the state-of-the-art.
-
Rogue Access Point Detector Using Characteristics of Channel Overlapping in 802.11n
2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), 2017Co-Authors: Rhongho Jang, Jeonil Kang, Aziz Mohaisen, Daehun NyangAbstract:In this work, we introduce a powerful hardware-based rogue access point (PrAP), which can relay traffic between a legitimate AP and a Wireless Station back and forth, and act as a man-in-the-middle attacker. Our PrAP is built of two dedicated Wireless routers interconnected physically, and can relay traffic rapidly between a Station and a legitimate AP. Through extensive experiments, we demonstrate that the state-of-the-art time-based rogue AP (rAP) detectors cannot detect our PrAP, although effective against software-based rAP. To defend against PrAPs, we propose PrAP-Hunter based on intentional channel interference. PrAP-Hunter is highly accurate, even under heavy traffic scenarios. Using a high-performance (desktop) and low-performance (mobile) experimental setups of our PrAP-Hunter in various deployment scenarios, we demonstrate close to 100% of detection rate, compared to 60% detection rate by the state-of-the-art. We show that PrAP-Hunter is fast (takes 5-10 sec), does not require any prior knowledge, and can be deployed in the wild by real world experiments at 10 coffee shops.
Lunchakorn Wuttisittikulkij - One of the best experts on this subject based on the ideXlab platform.
-
On Improving WLAN Medium Access Control via Uniform Transmission Cycle and Performance Analysis
22nd International Conference on Advanced Information Networking and Applications (aina 2008), 2008Co-Authors: Warakorn Srichavengsup, Siwaruk Siwamogsatham, Suvit Nakpeerayuth, Lunchakorn WuttisittikulkijAbstract:In this paper, we propose a modified backoff mechanism that can be used in conjunction with the existing backoff algorithms for medium access sharing among Wireless Stations via the CSMA protocol. With a proper design, the resulting scheme can achieve better short-term throughput fairness performance without degradation in the average throughput performance. The main idea of the proposed scheme is to virtually create a transmission cycle for each Wireless Station. After getting a turn to access the medium, each Wireless Station is not allowed to start the backoff procedure for its next transmission until it has waited for some additional number of backoff slots. Moreover, the average throughput performance of the proposed scheme is analytically evaluated in this work via the Markov chain approach. The simulation results show that the performance analysis model derived here for the proposed scheme is valid and accurate. In addition, the proposed scheme noticeably improves the short-term throughput fairness performance of the conventional backoff scheme.
-
AINA - On Improving WLAN Medium Access Control via Uniform Transmission Cycle and Performance Analysis
22nd International Conference on Advanced Information Networking and Applications (aina 2008), 2008Co-Authors: Warakorn Srichavengsup, Siwaruk Siwamogsatham, Suvit Nakpeerayuth, Lunchakorn WuttisittikulkijAbstract:In this paper, we propose a modified backoff mechanism that can be used in conjunction with the existing backoff algorithms for medium access sharing among Wireless Stations via the CSMA protocol. With a proper design, the resulting scheme can achieve better short-term throughput fairness performance without degradation in the average throughput performance. The main idea of the proposed scheme is to virtually create a transmission cycle for each Wireless Station. After getting a turn to access the medium, each Wireless Station is not allowed to start the backoff procedure for its next transmission until it has waited for some additional number of backoff slots. Moreover, the average throughput performance of the proposed scheme is analytically evaluated in this work via the Markov chain approach. The simulation results show that the performance analysis model derived here for the proposed scheme is valid and accurate. In addition, the proposed scheme noticeably improves the short-term throughput fairness performance of the conventional backoff scheme.
