• 한국인터넷방송통신학회논문지
• /
• 제12권3호
• /
• pp.1-7
• /
• 2012

무선 통신 시스템의 새로운 패러다임인 중의 하나인 무선 인지 시스템에서 다양한 종류의 멀티미디어 트래픽 지원이 예상된다. 2차 사용자들이 요구하는 서비스 품질을 만족하기 위하여, 패킷 우선권 기반의 정적 자원할당 기법이 고려될 수 있다. 하지만, 이 기법은 높은 우선권을 갖는 응용 서비스의 서비스 품질을 쉽게 만족시킬 수 있으나, 낮은 우선권을 갖는 응용 서비스의 서비스 품질은 저하될 수 있다. 이에 본 논문에서는 퍼지 이론 기반의 동적 패킷 스케줄링 알고리즘을 제안한다. 제안된 기법에서는 동적 패킷 스케줄러가 각 패킷의 우선권과 지연 마감 시간(delay deadline)을 입력으로 갖는 퍼지 규칙에 따라, 각 패킷의 우선권을 동적으로 변경하여 패킷 손실율을 최소화하는 관점에서 기 사용자 채널을 통해 다음 가용한 time slot에 어떤 2차 사용자가 데이터를 전송할 지를 결정한다. 시뮬레이션을 통해 제안된 알고리즘이 우선권 기반의 정적 자원할당기법 보다 패킷 손실율을 더 향상 시킬 수 있음을 보였다.

• Journal of Communications and Networks
• /
• 제14권2호
• /
• pp.179-187
• /
• 2012

Power saving is one of the most important features that extends the lifetime of portable devices in mobile wireless networks. The IEEE 802.16e mobile broadband wireless access system adopts a power saving mechanism with a binary truncated exponent algorithm for determining sleep intervals. When using this standard power saving scheme, there is often a delay before data packets are received at the mobile subscriber station (MSS). In order to extend the lifetime of a MSS, the battery energy must be used efficiently. This paper presents a dynamically alternating sleep interval scheduling algorithm as a solution to deal with the power consumption problem. We take into account different traffic classes and schedule a proper sequence of power saving classes. The window size of the sleep interval is calculated dynamically according to the packet arrival rate. We make a tradeoff between the power consumption and packet delay. The method achieves the goal of efficiently reducing the listening window size, which leads to increased power saving. The performance of our proposed scheme is compared to that of the standard power saving scheme. Simulation results demonstrate the superior performance of our power saving scheme and its ability to strike the appropriate performance balance between power saving and packet delay for a MSS in an IEEE 802.16e mobile broadband wireless access system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.4642-4660
• /
• 2016

One major concern of applying Multipath TCP (MPTCP) to data delivery in heterogeneous wireless networks is that the utilization of asymmetric paths with diverse networking-related parameters may cause severe packet reordering and receive buffer blocking (RB²LOC). Although many efforts are devoting to addressing MPTCP's packet reordering problems, their sender-controlled solutions do not consider balancing overhead between an MPTCP sender and receiver, and their fully MPTCP mode cannot make MPTCP achieve a desired performance. This paper proposes a novel receiver-centric buffer blocking-aware data scheduling strategy for MPTCP (dubbed MPTCP-rec) necessitating the following aims: (1) alleviating MPTCP's packet reordering and RB²LOC problems, (2) improving the MPTCP performance, and (3) balancing load between the MPTCP sender and receiver. Simulation results show that the proposed MPTCP-rec solution outperforms the existing MPTCP solutions in terms of data delivery performance in heterogeneous wireless networks.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.221-231
• /
• 2011

A joint multipath routing algorithm and channel allocation and scheduling for wireless multihop and multichannel systems is discussed. In packet transmission, distribution of packets to multiroutes makes it possible to reduce the transmission cost of the channels. Cross-layer cooperation of routing, channel allocation, and scheduling is an effective method of packet distribution. As a framework for the cooperation, we propose a multiroute distance vector routing (MDVR) scheme. In the MDVR scheme, the routing table is logically placed in between the routing and link layers, and the table plays the role of a service access point between these two layers. To evaluate the performance of MDVR, simulation is performed in a multichannel, multihop environment. The simulation results show that the MDVR framework can be efficiently implemented in the form of a distributed routing algorithm. It is also shown that in MDVR, the system-wise channel efficiency is almost 25% higher than that in a conventional single-route routing approach.

• 한국콘텐츠학회논문지
• /
• 제10권9호
• /
• pp.45-56
• /
• 2010

본 연구에서는 불필요한 에너지 소모와 지연을 야기하는 혼잡을 탐지할 수 있는 알고리즘을 제시하고 이에 따라 혼잡 제어를 수행할 수 있는 기법을 제시한다. 기존의 혼잡 탐지는 큐 점유율만을 사용하거나 MAC 계층에서 패킷 도착율만을 가지고 혼잡을 결정하였으나 본 연구에서는 이들 두 가지를 모두 고려하여 더 정밀한 혼잡 탐지를 가능하게 하였다. 또한 혼잡도에 따라 미리 혼잡 회피를 수행하고 혼잡이 발생한 경우 패킷의 우선순위에 따라 지연에 민감한 패킷들을 먼저 스케줄링할 수 있는 방법을 제시하였다. 시뮬레이션 결과 본 논문에서 제안한 혼잡 탐지와 제어 기법은 기존의 혼잡 제어 방법들에 비해 우수한 성능을 보임을 알 수 있었다.

• 전기학회논문지P
• /
• 제61권4호
• /
• pp.239-244
• /
• 2012

In this paper, we first introduce our own binary CDMA technology. Then we propose a wireless distribution automation system using the binary CDMA technology. The major research items are the binary CDMA distribution automation system, piconet configuration for remote control and monitoring, scheduling for the transmission and reception of data, and ways of applying encryption to protect wireless packet. To verify the possibility of applying wireless transmission to the distribution automation system, we experiment the implemented system in terms of the transmission rate by applying it to a real-world environment.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권5호
• /
• pp.236-239
• /
• 2006

A wireless MAC scheduler that provides a high level of quality-of-service (QoS) for video-on-demand (VOD) applications while achieving a reasonable level of system throughput is proposed. The proposed scheduler considers both channel qualities of mobiles and the urgency of real-time packets coming from VOD applications in a cross-layer approach between application and MAC layers.

• 한국통신학회논문지
• /
• 제33권2A호
• /
• pp.191-197
• /
• 2008

시변 무선채널에서 버스트한 패킷을 효율적으로 전송하기 위해서는 다중사용자 다이버시티 이득을 극대화할 수 있는 opportunistic 스케줄링 기법이 중요한 기술적 요소가 되고 있다. 본 논문에서는 무선 LAN 네트워크에 적용 가능한 분산화된 opportunistic 스케줄링기법을 제안하였다. Opportunistic 스케줄링방식의 하나인 비례공정 알고리즘은 중앙집중형 네트워크에 적용되었으나 본 논문에서는 확률적 방식을 이용하여 분산화된 방식의 비례공정 스케줄링 (DPFS: Distributed Proportional Fair Scheduling) 방식과 매체 접근제어 방식을 설계하였다. 제안한 DPFS방식에서는 각각의 수신기들은 채널상태를 파악한 후 독립적으로 자신의 우선순위를 확률적 방법으로 계산하기 때문에 모든 수신기의 채널 정보를 수집하는데 필요한 오버헤드를 크게 줄일 수 있다. 성능분석을 위하여 시뮬레이션을 수행하였으며 제안된 스케줄링 방식이 기존의 분산 스케줄링방식에 비하여 전송률 성능에서 우수함을 보이고 있으며 관련 파라미터를 조절함으로써 공평성과 전송률성능에 대한 제어가 가능함을 보이고 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권12호
• /
• pp.3152-3165
• /
• 2012

Wireless sensor networks (WSN) often employ asynchronous MAC scheduling, which allows each sensor node to wake up independently without synchronizing with its neighbor nodes. However, this asynchronous scheduling may not deal with collisions due to hidden terminals effectively. Although most of the existing asynchronous protocols exploit a random back-off technique to resolve collisions, the random back-off cannot secure a receiver from potentially repetitive collisions and may lead to a substantial increase in the packet latency. In this paper, we propose a new collision resolution algorithm called Transient Coordinator (TC) for asynchronous WSN MAC protocols. TC resolves a collision on demand by ordering senders' transmissions when a receiver detects a collision. To coordinate the transmission sequence both the receiver and the collided senders perform handshaking to collect the information and to derive a collision-free transmission sequence, which enables each sender to exclusively access the channel. According to the simulation results, our scheme can improve the average per-node throughput by up to 19.4% while it also reduces unnecessary energy consumption due to repetitive collisions by as much as 91.1% compared to the conventional asynchronous MAC protocols. This demonstrates that TC is more efficient in terms of performance, resource utilization, and energy compared to the random back-off scheme in dealing with collisions for asynchronous WSN MAC scheduling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.79-95
• /
• 2016

In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.