• Title/Summary/Keyword: Centralized WLAN

Search Result 9, Processing Time 0.026 seconds

A Secure and Efficient Roaming Mechanism for Centralized WLAN Environment (중앙집중식 WLAN 환경에서의 안전하고 효율적인 로밍 메커니즘)

  • Park, Chang-Seop;Woo, Byung-Duk;Lim, Jeong-Mi
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.1
    • /
    • pp.81-92
    • /
    • 2009
  • Recently, there is a drastic increase in users interested in real-time multimedia services in the WLAN environment, as the demand of IEEE 802.11 WLAN-based services increases. However, the handoff delay based on 802.11i security policy is not acceptable for the seamless real-time multimedia services provided to MS frequently moving in the WLAN environment, and there is a possibility of DoS attacks against session key derivation process and handoff mechanism. In this paper, a secure and efficient handoff mechanism in the centralized WLAN environment is introduced to solve the security problems. The 4-way Handshake for both mutual authentication and session key derivation is replaced by the 2-way Reassociation process.

DIAMETER Strong Security Extension using Kerberos v5 in WLAN (WLAN에서 Kerberos v5를 이용하여 안전성을 강화한 DIAMETER의 확장)

  • Wiroon, Sriborrirux;Kim, Tai-Yun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11b
    • /
    • pp.1023-1026
    • /
    • 2002
  • The demand for Wireless LAN (WLAN) access to use their network and the Internet is surged dramatically over the past year. Since WLAN provides users' access from anywhere in the workplace without having to plug in, it therefore leads the WLAN market to grow steadily. Unfortunately, the first WLAN implementation designed primarily for home networking did little to address these security issues. Moreover, although the 802.11b standard published by IEEE in 1999 improved WLAN connections LAN-equivalent speed and security from the 802.11 standard. However, there still are several flaws such as the weaknesses in the Authentication and WEP encryption schemes in the IEEE 802.11 WLAN standard. In this paper, we propose WLAN architecture for providing the strong centralized authentication, encryption, and dynamic key distribution on a WLAN. Additionally, this proposed architecture is able to support roaming users and is flexible and extensible to future developments in the network security.

  • PDF

A Ticket-based Authentication mechanism Suitable for Efficient Handoff in the Centralized WLAN Environment (중앙집중식 무선랜 환경에서의 효율적인 핸드오프를 지원하는 티켓 기반의 인증 메커니즘)

  • Woo, Byung-Duk;Park, Chang-Seop
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.683-684
    • /
    • 2009
  • 최근 IEEE 802.11n 표준의 상용화와 함께 무선랜 환경에서 실시간 멀티미디어 서비스를 이용하려는 수요가 증가하고 있다. 그러나 IEEE 802.11i 보안표준에서 정의한 IEEE 802.1x 인증과정은 끊김 없는 실시간 멀티미디어 서비스를 제공하기에는 핸드오프 지연시간이 너무 길다. 본 논문은 Ticket이라는 새로운 인증 기법을 도입하여 고속의 로밍을 지원하는 핸드오프 메커니즘을 소개한다.

Priority Polling and Dual Token Bucket based HCCA Algorithm for IEEE 802.11e WLAN (IEEE 802.11e WLAN을 위한 우선순위 폴링 및 이중 토큰 버킷 기반의 HCCA 알고리즘)

  • Lee, Dong-Yul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.31-41
    • /
    • 2009
  • IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

Dynamic Rate Adaptation of Centralized AP for WLAN Performance Enhancement (무선랜 성능향상을 위한 AP의 동적 전송속도 할당 기법)

  • Park, Byoung-Chang;Woo, Hee-Kyoung;Kim, Chong-Kwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.391-393
    • /
    • 2005
  • 최근 유비쿼터스 네트워크 환경을 구축하기 위해 많은 무선 통신 기술들이 등장하였다. 그 중 무선랜 기술은 쉬운 설치와 저렴한 비용 덕에 폭발적인 보급이 이루어 겼다. IEEE 802.11 표준을 기반으로 만들어진 무선랜은 여러 개의 전송속도를 지원한다. 대표적으로 802.11b는 1, 2, 5.5, 11MbPs의 4가지 전송속도를 지원한다. 낮은 전송속도로 전송을 하면 패킷 전송시간은 증가하지만 비트 에러율은 감소된다. 각각의 전송속도에 따라 다른 패킷 전송 성공률을 갖게 된다. 한 무선랜 AP에 연결된 노드들은 각자 자신의 처리율을 최대화할 수 있는 전송속도를 결정하여 사용하게 된다. 이러한 상황은 전체 시스템 성능에는 문제를 발생시킬 수 있다. 본 논문에서는 각자의 전송속도를 각자가 결정하는 것이 전체 시스템 성능에 문제를 발생시키는 경우를 보이고, 그것을 해결하기 위해 AP가 각 노드의 전송속도를 결정하는 기법을 제안한다. 나아가 무선랜에서의 문제점인 Performance Anomaly 현상을 해결하고, [3]에서 언급된 Inefficient Equilibria 현상도 막아본다.

  • PDF

A New Green Clustering Algorithm for Energy Efficiency in High-Density WLANs

  • Lu, Yang;Tan, Xuezhi;Mo, Yun;Ma, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.326-354
    • /
    • 2014
  • In this paper, a new green clustering algorithm is proposed to be as a first approach in the framework of an energy efficient strategy for centralized enterprise high-density WLANs. Traditionally, in order to maintain the network coverage, all the APs within the WLAN have to be powered-on. Nevertheless, the new algorithm can power-off a large proportion of APs while the coverage is maintained as its always-on counterpart. The two main components of the new approach are the faster procedure based on K-means and the more accurate procedure based on Evolutionary Algorithm (EA), respectively. The two procedures are processes in parallel for different designed requirements and there is information interaction in between. In order to implement the new algorithm, EA is applied to handle the optimization of multiple objectives. Moreover, we adapt the method for selection and recombination, and then introduce a new operator for mutation. This paper also presents simulations in scenarios modeled with ray-tracing method and FDTD technique, and the results show that about 67% to 90% of energy consumption can be saved while it is able to maintain the original network coverage during periods when few users are online or the traffic load is low.

Dynamic Rate & TXOP Adaptation of Centralized AP for WLAN Performance Enhancement (무선랜 성능향상을 위한 AP 의 전송속도 및 전송시간 동적 할당 기법)

  • Park, Byoung-Chang;Woo, Hee-Kyoung;Kim, Chong-Kwon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.11a
    • /
    • pp.1125-1128
    • /
    • 2005
  • 최근 유비쿼터스 네트워크 환경을 구축하기 위해 많은 무선 통신 기술들이 등장하였다. 그 중 무선랜 기술은 쉬운 설치와 저렴한 비용 덕에 폭발적인 보급이 이루어 졌다. IEEE 802.11 표준을 기반으로 만들어진 무선랜은 여러 개의 전송속도를 지원한다. 대표적으로 802.11b 는 1, 2, 5.5, 11Mbps 의 4 가지 전송속도를 지원한다. 낮은 전송속도로 전송을 하면 패킷 전송시간은 증가하지만 비트 에러율은 감소된다. 각각의 전송속도에 따라 다른 패킷 전송 성공률을 갖게 된다. 한 무선랜 AP 에 연결된 노드들은 각자 자신의 처리율을 최대화할 수 있는 전송속도를 결정하여 사용하게 된다. 이러한 상황은 전체 시스템 성능에는 문제를 발생시킬 수 있다. 본 논문에서는 각자의 전송속도를 각자가 결정하는 것이 전체 시스템 성능에 문제를 발생시키는 경우를 보이고, 그것을 해결하기 위해 AP 가 각 노드의 전송속도 및 전송시간을 결정하는 기법을 제안한다. 나아가 무선랜에서의 문제점인 Performance Anomaly 현상을 해결하고, [3]에서 언급된 Inefficient Equilibria 현상도 막아본다.

  • PDF

Dual Token Bucket based HCCA Scheduler for IEEE 802.11e (IEEE 802.11e WLAN 위한 이중 리키 버킷 기반 HCCA 스케줄러)

  • Lee, Dong-Yul;Lee, Chae-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1178-1190
    • /
    • 2009
  • IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To efficiently assign resource for VBR traffic, in this paper, we propose TXOP algorithm based on dual leaky bucket using average resource allocation and peak resource allocation. The minimum TXOP of each station is obtained by using statistical approach to maximize number of stations of which performance satisfy QoS target. Simulation results show that the proposed algorithm has much higher performance compared with reference scheduler in terms of throughput and delay.

Opportunistic Packet Scheduling and Media Access Control for Wireless LANs (무선 LAN을 위한 opportunistic 패킷 스케줄링 및 매체접근제어)

  • Park, Hyung-Kun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2A
    • /
    • pp.191-197
    • /
    • 2008
  • For the efficient transmission of burst data in the time varying wireless channel, opportunistic scheduling is one of the important techniques to maximize multiuser diversity gain. In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN network. A proportional fair scheduling, which is one of the opportunistic scheduling schemes, is used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS) scheme and medium access control with distributed manner. In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains higher network throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.