• Title/Summary/Keyword: 무선LAN

Search Result 1,039, Processing Time 0.025 seconds

File Sharing System Between Heterogeneous System Using Mobile Server (모바일 서버를 이용한 이기종간의 파일 공유 시스템)

  • Park, Sung-hyun;Kim, A-Yong;HE, YILUN;CHU, XUN;Jung, Hoe-kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.1041-1043
    • /
    • 2013
  • As the mobile device supply is increasing currently, the era of N mobile devices per person has opened. Types of mobile devices and OS are increasing continuously. Samsung and Intel are developing TIZEN, the OS mobilized by UBUNTU of Linux is going to be released as well as the market share of Google's Android and Apple's IOS remains above 90%. However, it is a reality that there are not specific technologies or systems which can share files between different OS. Despite of technologies such as Bluetooth and WiFi Direct, constraints are shown in device compatibility and file formats. In this paper, we have studied how to share files between OS as well as mobile devices, and to share files in a wireless LAN environment of heterogeneous variety. Future research includes the mobile phone integration server system that provides services such as introduction, management, maintenance, and repair in one-touch Mobile Server that spread and building are easy.

  • PDF

A Study on Capture Phenomena in Random Multiple Access Communication Systems (랜덤 다중접속 통신 시스템에 있어서 신호 점유현상 연구)

  • 곽경섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.2
    • /
    • pp.99-113
    • /
    • 1992
  • In general, TDMA and FDMA have been used for multiple access communication methods. Recently. However, ALOHA and CSMA protocols came to exist as new schemes for VSAT data networks and LANs, respectively. These schemes are proven to be effective for packet switched communication systems that has bursty traffic but packet collisions. In this paper we analyze capture statistics arising from fading channels in packet radio communication systems in the context of ALOHA protocol. We derive general results of the exact form of capture probabilities and present numerical data for wide range of fading parameters. Since the capture probabilities are found to approach zero when the number of transmitted signals become larger, we are able to determine the achievable channel throughput by a least squares fitting of an exponential-type function to the probabilities.

  • PDF

A study on the design of an Dual Inverted-F Internal Antenna for the WLAN`s Band (WLAN대역의 듀얼 역-F형 내부 안테나 설계에 관한 연구)

  • Kang, Jeong-Jin;Kang, Seo;Jeung, Seung-Il;Kim, Wan-Sik;Lee, Jong-Arc
    • Journal of IKEEE
    • /
    • v.7 no.2 s.13
    • /
    • pp.223-229
    • /
    • 2003
  • In this thesis, the characteristics of an inverted-F antenna for the 2.4GHz and 5.8GHz zwirless local area network(WLAN) have been analysed in terms of the variation of design parameters. The antenna can be integrated on WLAN for notebook printed circuit board, and the characteristics in terms of the variation of the gap between feed line and shorting stub, gap between antenna's leg and ground plane, antenna leg's width, substrate's height and dielectric constant are analysed. By using these characterization plot of design parameter, the tuning techniques are proposed to design optimum antenna. The designed antenna has 170MHz, 500MHz frequency bandwidth ,VSWR is 1.6, 1.14 and 3.5dBi gain.

  • PDF

Efficient FFT Algorithm and Hardware Implementation for High Speed Multimedia Communication Systems (고속 멀티미디어 통신시스템을 위한 효율적인 FFT 알고리즘 및 하드웨어 구현)

  • 정윤호;김재석
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.3
    • /
    • pp.55-64
    • /
    • 2004
  • In this paper, we propose an efficient FFT algorithm for high speed multimedia communication systems, and present its pipeline implementation results. Since the proposed algorithm is based on the radix-4 butterfly unit, the processing rate can be twice as fast as that based on the radix-2$^3$ algorithm. Also, its implementation is more area-efficient than the implementation from conventional radix-4 algorithm due to reduced number of nontrivial multipliers like using the radix-23 algorithm. In order to compare the proposed algorithm with the conventional radix-4 algorithm, the 64-point MDC pipelined FFT processor based on the proposed algorithm was implemented. After the logic synthesis using 0.6${\mu}{\textrm}{m}$ technology, the logic gate count for the processor with the proposed algorithm is only about 70% of that for the processor with the conventional radix-4 algorithm. Since the proposed algorithm can be achieve higher processing rate and better efficiency than the conventional algorithm, it is very suitable for the high speed multimedia communication systems such as WLAN, DAB, DVB, and ADSL/VDSL systems.

IEEE 802.11a Interference Suppression Method Using by SVD Algorithm in LR-UWB Systems (LR-UWB 시스템에서 특이값 분해를 이용한 IEEE 802.11a 간섭억압기법)

  • Kim, Dong-Hee;Kim, Tae-Hun;Jang, Hong-Mo;Park, Ho-Hwan;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.74-84
    • /
    • 2008
  • UWB radio systems have drawn attention during the last few years. These systems are the core technique for ubiquitous home and enable to co-exist with other narrow band systems over the same frequency without interfering them. But UWB signals have a very low power per pulse, so they are affected by strong narrow band interferences. Specially, IEEE 802.11a systems which operate around 5GHz overlap the band of UWB signals and they will interfere with UWB systems significantly. In this paper, we propose a novel narrow band interference suppression method based on singular value decomposition(SVD) algorithm for DS-UWB in IEEE 802.15.4a channel model. The proposed method is very effective and robust for both a single user DS-UWB system and a multiuser DS-UWB system to reduce the narrow band interference.

VLIS Design of OCB-AES Cryptographic Processor (OCB-AES 암호 프로세서의 VLSI 설계)

  • Choi Byeong-Yoon;Lee Jong-Hyoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1741-1748
    • /
    • 2005
  • In this paper, we describe VLSI design and performance evaluation of OCB-AES crytographic algorithm that simulataneously provides privacy and authenticity. The OCB-AES crytographic algorithm sovles the problems such as long operation time and large hardware of conventional crytographic system, because the conventional system must implement the privancy and authenticity sequentially with seqarated algorithms and hardware. The OCB-AES processor with area-efficient modular offset generator and tag generator is designed using IDEC Samsung 0.35um standard cell library and consists of about 55,700 gates. Its cipher rate is about 930Mbps and the number of clock cycles needed to generate the 128-bit tags for authenticity and integrity is (m+2)${\times}$(Nr+1), where m and Nr represent the number of block for message and number of rounds for AES encryption, respectively. The OCB-AES processor can be applicable to soft cryptographic IP of IEEE 802.11i wireless LAN and Mobile SoC.

Real-Time Face Recognition System using PDA (PDA를 이용한 실시간 얼굴인식 시스템 구현)

  • Kwon Man-Jun;Yang Dong-Hwa;Go Hyoun-Joo;Kim Jin-Whan;Chun Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.5
    • /
    • pp.649-654
    • /
    • 2005
  • In this paper, we describe an implementation of real-time face recognition system under ubiquitous computing environments. First, face image is captured by PDA with CMOS camera and then this image with user n and name is transmitted via WLAN(Wireless LAN) to the server and finally PDA receives verification result from the server The proposed system consists of server and client parts. Server uses PCA and LDA algorithm which calculates eigenvector and eigenvalue matrices using the face images from the PDA at enrollment process. And then, it sends recognition result using Euclidean distance at verification process. Here, captured image is first compressed by the wave- let transform and sent as JPG format for real-time processing. Implemented system makes an improvement of the speed and performance by comparing Euclidean distance with previously calculated eigenvector and eignevalue matrices in the learning process.

A variable-length FFT/IFFT processor design using single-memory architecture (단일메모리 구조의 가변길이 FFT/IFFT 프로세서 설계)

  • Yeem, Chang-Wan;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.393-396
    • /
    • 2009
  • This paper describes a design of variable-length FFT/IFFT processor for OFDM-based communication systems. The designed FFT/IFFT processor adopts the in-place single-memory architecture, and uses a hybrid structure of radix-4 and radix-2 DIF algorithms to accommodate FFT lengths of $N=64{\times}2^k$ ($0{\leq}k{\leq}7$). To achieve both memory size reduction and the improved SQNR, a two-step conditional scaling technique is devised, which conditionally scales the intermediate results of each computational stage. The performance analysis results show that the average SQNR's of 64~8,192-point FFT's are over 60-dB. The processor synthesized with a $0.35-{\mu}m$ CMOS cell library can operate with 75-MHz@3.3-V clock, and 64-point and 8,192-point FFT's can be computed in $2.55-{\mu}s$ and $762.7-{\mu}s$, respectively, thus it satisfies the specifications of wireless LAN, DMB, and DVB systems.

  • PDF

Outdoor Experiments on video streaming over a Raspberry Pi-based MANETs (Raspberry Pi 기반 MANETs 환경에서 야외 Video Streaming 실험)

  • Lee, Yeong-mi;Kim, Byeong-jeong;Song, Seong-Ho;Park, Seop Hyeong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.147-151
    • /
    • 2014
  • With the advent of tiny and inexpensive computer systems like Raspberry Pi, it has become possible to construct an experimental environment of MANETs (Mobile Ad hoc Networks) at a relatively low cost. In this paper, we implement a node of MANETs with a Raspberry Pi equipped with two 802.11 wireless LAN cards and dynamic routing software running on it. In an outdoor MANETs environment with moving mobile nodes automatically rebuilding broken routes, we conducted a real-time video streaming experiment over the MANET. The video stream is transmitted from a node with a video camera installed on it to another node through the route established dynamically. Each node is equipped with a display device, with which the current status of the node can be checked out. We also implemented software that automatically collects data stored in each node and analyzes the performance of the MANETs. Through this experiment, we could evaluate the performance of realistic video streaming service in a MANETs environment.

  • PDF

A Group Key based Authentication Protocol Providing Fast Handoff in IEEE 802.11 (IEEE 802.11 환경에서 빠른 핸드오프를 제공하는 그룹키 기반의 인증 프로토콜)

  • Lee, Chang-Yong;Kim, Sang-Jin;Oh, Hee-Kuck;Park, Choon-Sik
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.5
    • /
    • pp.103-113
    • /
    • 2008
  • Reducing handoff latency is essential in providing seamless multimedia service in Wireless LAN based on the IEEE 802.11 standard. Reducing authentication delay is critical in reducing handoff latency. To this end, several authentication protocols for fBst handoff have been proposed. Mishra et al. used proactive key distribution to improve the authentication delay incurred in the current standard and Park et al. proposed a new authentication protocol based on Blom's key pre-distribution scheme. In this paper, we propose an enhanced authentication protocol based on Bresson et al.'s group key protocol. If a mobile node has previously access the network, our proposed protocol only requires simple hash operations in providing mutual authentication between a mobile node and access points. Our protocol is more efficient than Park et al.'s and Mishra et al.'s technique can be used in our protocol to further enhance our protocol.