• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.595-604
• /
• 2009

The HCCA reserves the channel resources based on the mean data rate in IEEE 802.11e. It may cause either the waste of channel resource or the increase of transmission delay at MAC layer if the frame size is rapidly varied when a compressed mode video codec such as MPEG video is used. To solve these problems, it is developed that the packet scheduler allocates the wireless resource adaptation by according to the packet size. However, it is difficult to perform the admission control because of the difficulty with calculating the available resources. In this paper, we propose a CAC mechanism to solve the problem that may not satisfy the QoS by increasing traffic load in case of using EDCA. Especially, the proposed CAC mechanism calculates the EB of TSs using the traffic information transmitted by the application layer and the number of average transmission according to the wireless channel environment, and then determines the admission of the TS based on the EB. According to the simulation results of the proposed CAC mechanism, it admitted the TSs under the loads which are satisfied within the delay bound. Therefore, the proposed mechanism guarantees QoS of streaming services effectively.

• Electronics and Telecommunications Trends
• /
• v.24 no.3
• /
• pp.91-102
• /
• 2009

FCC(Federal Communications Commission 미국 연방통신위원회)는 2008년 11월 스펙트럼 사용 효율을 높이고 새로운 서비스 도입을 용이하게 하기 위해 TV White Spaces를 대상으로 주파수 공유 기술인 Cognitive Radio 기술을 적용하기로 하고 관련 규정을 개정하였다. FCC는 TV White Spaces에서 고정 서비스와 개인/휴대서비스기기 사용을 허용하기로 방침을 정하고 2009년 5월 12일 DTV 전환 완료 이후 관련 기기 사용을 허용하기로 하였다. 본 논문에서는 FCC의 법규 개정 현황과 함께 이를 기술적으로 뒷받침하기 위한 IEEE 802.22, TV White Spaces ECSG, ECMA에서의 표준화 동향을 설명하고, 핵심 기술로서 스펙트럼 센싱 기술, 무선자원관리 기술, PHY/MAC 관련 기술 개발 동향에 대해 요약 기술하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.115-117
• /
• 2006

IEEE 802.11 표준은 채널 상태에 따라 다양한 전송 속도를 지원하며, 무선랜 환경에서 이러한 특성을 활용하는 연구들이 진행되어 왔다. 그러나, 모바일 애드 혹 네트워크 환경에서 다중전송속도를 활용하는 연구는 거의 이루어지지 않았다. 본 논문은 모바일 애드 혹 네트워크에서 동적으로 다중전송속도를 활용하여 채널 효율을 높이는 알고리즘을 제안한다. 제안 기법은 MAC 계층과 네트워크 계층 중간에 위치하며 각 계층에 독립적으로 동작한다. 라우팅 프로토콜에서 결정한 다음 홉에 더불어, 제안 기법은 더 빠른 전송 속도를 갖는 중계 경로를 탐색한다. 또한, 패킷의 크기에 따라 경쟁 부하를 고려하여 선택적으로 전송 경로를 변경한다. 모의 실험을 통한 성능 평가는 제안 기법의 우수한 성능을 입증한다.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.289-292
• /
• 2005

IEEE802.11 DCF에서는 hidden node문제를 해결하기 위하여 RTS/CTS 교환을 사용한다. 그러나 실제로는 전송에 필요한 파워보다 간섭을 일으킬 수 있는 파워가 작다. 따라서 RTS나 CTS를 받지 않은 노드에서 전송을 시작할 경우에도 간섭에 의해 충돌이 발생할 수 있다. 멀티홉 애드혹 환경에서는 이 현상이 더 큰 성능 저하를 불러 일으킬 수 있다. 본 논문에서는 기존의 RTS/CTS 교환에서 CTS를 받은 노드들이 STS 패킷을 보내고 STS를 받은 노드가 자신이 전송을 시작할 경우 데이터를 받는 노드에서의 간섭 효과를 계산해 간섭 효과가 클 경우 전송을 지연시키는 과정을 추가하였다. 따라서 간섭에 의한 충돌이 발생하지 않도록 하였다. 또한 시뮬레이션 결과를 통하여 이 방식이 멀티홉 애드혹 환경에서 성능을 향상 시켰음을 보였다.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.615-625
• /
• 2009

Worldwide inter-operability for microwave access (WiMAX) is a promising technology that provides high data throughput with low delays for various user types and modes of operation. While much research had been conducted on physical and MAC layers, little attention has been paid to a comprehensive and efficient security solution for WiMAX. We propose a hybrid security solution combining identity-based cryptography (IBC) and certificate based approaches. We provide detailed message exchange steps in order to achieve a complete security that addresses the various kind of threats identified in previous research. While attaining this goal, efficient fusion of both techniques resulted in a 53% bandwidth improvement compared to the standard's approach, PKMv2. Also, in this hybrid approach, we have clarified the key revocation procedures and key lifetimes. Consequently, to the best of knowledge our approach is the first work that unites the advantages of both techniques for improved security while maintaining the low overhead forWiMAX.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.352-361
• /
• 2013

Combining multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) with a massive number of transmit antennas (massive MIMO-OFDM) is an attractive way of increasing the spectrum efficiency or reducing the transmission energy per bit. The effectiveness of Massive MIMO-OFDM is strongly affected by the channel state information (CSI) estimation method used. The overheads of training frame transmission and CSI feedback decrease multiple access channel (MAC) efficiency and increase the CSI estimation cost at a user station (STA). This paper proposes a CSI estimation scheme that reduces the training frame length by using a novel pilot design and a novel unitary matrix feedback method. The proposed pilot design and unitary matrix feedback enable the access point (AP) to estimate the CSI of the signal space of all transmit antennas using a small number of training frames. Simulations in an IEEE 802.11n channel verify the attractive transmission performance of the proposed methods.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.435-445
• /
• 2007

Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem: it cannot perform local retransmission efficiently under the bursty-error prone wireless link. To solve this problem, SACK-Aware-Snoop and SNACK mechanism have been proposed. These approaches improve the performance by using SACK option field between base station and mobile host. However in the wireless channel with high packet loss rate, SACK-Aware-Snoop and SNACK mechanism do not work well because of two reason: (a) end-to-end performance is degraded because duplicate ACKs themself can be lost in the presence of bursty error, (b) energy of mobile device and bandwidth utilization in the wireless link are wasted unnecessarily because of SACK option field in the wireless link. In this paper, we propose a new local retransmission scheme based on Cross-layer approach, called Cross-layer Snoop(C-Snoop) protocol, to solve the limitation of previous localized link layer schemes. C-Snoop protocol includes caching lost TCP data and performing local retransmission based on a few policies dealing with MAC-layer's timeout and local retransmission timeout. From the simulation result, we could see more improved TCP throughput and energy efficiency than previous mechanisms.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.11
• /
• pp.1004-1013
• /
• 2012

The legacy voice broadcast systems are used to broadcast the voice over an entire space or a specific zone. these broadcast systems generate unnecessary noise and waste of resources. In this paper, we propose a ubiquitous voice message broadcast system called uPaging, by combining the technique of location-awareness and the voice message delivery service in ubiquitous sensor network environment. In uPaging system, the wire/wireless hybrid network is used to implement the network system. Also, in order to actualize the location-awareness service, we use the Bidirectional Location ID-Exchange protocol was suggested by our previous research. the uPaging system can deliver the voice to a selected user or the location in which the user is present by this location awareness.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.