• Journal of Information Processing Systems
• /
• 제5권3호
• /
• pp.135-144
• /
• 2009

Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.

• International Journal of Control, Automation, and Systems
• /
• 제6권1호
• /
• pp.119-125
• /
• 2008

This paper examines the use of a wireless Fieldbus based on IEEE 802.15.4 MAC protocol. The superframe of IEEE 802.15.4 is applied to a transmission scheme of real-time mixed data. The transmission and bandwidth allocation scheme are proposed for real-time communication using a superframe. The proposed wireless Fieldbus protocol is able to transmit three types of data (periodic data, sporadic data, and non real-time messages), and guarantee realtime transmission simultaneously within a limited timeframe.

• 한국경영과학회지
• /
• 제28권2호
• /
• pp.75-89
• /
• 2003

Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

• Journal of information and communication convergence engineering
• /
• 제10권1호
• /
• pp.21-26
• /
• 2012

As the new requirements for wireless sensor networks are emerging, real-time communications is becoming a major research challenge because resource-constrained sensor nodes are not powerful enough to accommodate the complexity of the protocol. In addition, an efficient energy management scheme has naturally been a concern in wireless sensor networks for a long time. However, the existing schemes are limited to meeting one of these two requirements. To address the two factors together, we propose real-time communications with two approaches, a protocol for satisfied conditions and one for unsatisfied. Under the satisfied requirement, existing real-time protocol is employed. On the other hand, for the unsatisfied requirement, the newly developed scheme replaces the existing scheme by adjusting the transmission range of some surplus nodes. By expanding the transmission range, the end-to-end delay is shortened because the number of intermediate nodes decreases. These nodes conserve their energy for real-time communications by avoiding other activities such as sensing, forwarding, and computing. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic environments.

• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.244-250
• /
• 2011

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.237-239
• /
• 2004

Wireless LAN Voice over IP(VoIP) equipment needs Quality-of-Service(QoS) with priority for processing real-time traffic. This paper shows transmit function implementation of wireless LAN(WLANs) media access control(MAC) support VoIP, and it has an advantage of guarantee of QoS and is adaptable to VoIP or mobile wireless equipment. The IEEE 802.11e standard in progress has four queues according to four access categories(AC) for transmit and the MAC transmits the data based on EDCA. The value of AC is from AC0 to AC3 and AC3 has the highest priority. The transmit method implemented at this paper ensure QoS using one transmit FIFO in hardware since real-time traffic data and non real-time traffic data has the different priority. The device driver classifies real-time data and non real-time data and transmit data to hardware with information about data type. The hardware conducts shorter backoff and selects faster AIFS slot for real-time data than it for non real-time data. Therefor It make give the real-time traffic data faster channel access chance than non real-time data and enhances QoS.

• Journal of information and communication convergence engineering
• /
• 제10권2호
• /
• pp.129-134
• /
• 2012

As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

• 한국멀티미디어학회논문지
• /
• 제7권2호
• /
• pp.187-193
• /
• 2004

오늘날 무선 네트워크는 통신에서 매우 중요한 역할을 하고 있다. 예를 들어, 오늘날의 무선 네트워크는 이메일, FTP와 같은 기본 서비스로부터 웹 서비스 같은 멀티미디어 응용 서비스를 제공하고 있다. 무선 네트워크에서의 이와 같은 다양한 응용들의 서비스 질에 대한 요구는 유선 네트워크에서와 마찬가지로 무선 네트워크에서도 계속 이어질 것이 확실하다. 최근에 인터넷에서 서비스의 차별화를 지원하려는 많은 연구가 이루어지고 있다. 그러나 무선 환경에서는 제한된 대역폭과 채널 상태의 변화로 인하여 이러한 차별화서비스 지원이 더욱 어렵다. 본 논문에서는 실시간 트래픽 서비스와 비실시간 트래픽 서비스가 공존하는 인터넷 환경에서 실시간 트래픽 서비스의 질을 지원하는 수정된 무선 토큰링 프로토콜을 제안하고 있다. 제안된 알고리즘에서는 실시간 트래픽 서비스 노드가 비실시간 트래픽 서비스 노드보다 토큰 수신에 있어서 우선권을 가진다. 따라서 제안된 알고리즘은 실시간 트래픽 서비스 노드의 빠른 전송을 지원하며, 또한 기존의 토큰 전송 방식에 약간의 수정만을 통하여 QoS를 지원하는 장점을 가진다. 또한 본 논문에서는 손실된 토큰 회복 메커니즘에 대한 고찰이 이루어진다.

• 디지털콘텐츠학회 논문지
• /
• 제3권1호
• /
• pp.47-57
• /
• 2002

최근, 정보 통신 기술의 발전에 따라 무선 통신망에서 음성, 데이터, 정지화면, 동영상 및 다양한 멀티미디어 데이터를 추구하고 있다. 효율적인 실시간 멀티미디어 데이터 전송을 위해서는 실시간 데이터의 지연 한계를 보장하고 비실시간 멀티미디어 데이터의 데이터 손실을 최소화해야 한다. 무선 ATM은 유선 ATM을 기본으로 하고 있지만 무선 환경에서의 다양한 서비스에 대한 힘든 전송률과 품질에 따른 문제점들이 수반된다. 그 결과, 무선 통신 환경에서 각각의 트래픽 종류에 따른 품질 서비스(QoS)를 보장하는 방법을 찾는 것이 중요하다. 이 논문에서는 무선 ATM망에서 실시간 멀티미디어 데이터 서비스 전송을 위한 스케줄링 방법으로 개선된 TCRM 스케줄링 알고리즘을 제시한다. 무선 환경에 따라 Uplink와 Downlink시 각각 다른 방법으로 실시간 멀티미디어 데이터 전송 스케줄링 정책을 적용하며 실시간 데이터와 비실시간 데이터의 QoS의 요구사항을 보장하고 불충분한 무선 자원을 공유분배를 위한 공평성 문제를 다룬다. 또한 VC(Virtual Control)를 BS(Base Station)에 두어 예약버퍼와 임의의 전송속도 pk를 사용하여 TCRM의 단점인 비실시간 데이터에 대한 비효율성 문제를 해결한다.

• 한국콘텐츠학회논문지
• /
• 제5권1호
• /
• pp.73-79
• /
• 2005

최근 무선 기술의 발전으로 무선랜 분야에서 실시간 서비스의 채용 및 서비스를 위한 기술 채용이 가속화 되고 있다. IEEE 802.11 무선랜 표준은 음성이나 화상과 같은 실시간 트래픽을 제공하기 위하여 PCF 폴링 기법을 정의하고 있다. 폴링 서비스는 무선랜에서 실시간 트래픽을 서비스하기 위한 주요 개념이다. 본 논문에서는 IEEE 802.11 PCF 모드에서 무효 폴 발생시 전송 지연을 줄임으로써 최대 통화 수를 증가시키는 멀티캐스트 폴링기법을 제안한다. 여기서 제안한 기법이 전송지연 및 패킷 폐기율에서 PCF의 성능을 개선시킬 수 있음을 시뮬레이션으로 확인하였다.