• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.92-105
• /
• 2015

WBAN (Wireless Body Area Network) is a network which is to consistently monitor body signals with implanted or attached sensor nodes. Especially, nodes that are used in medical services have to operate with low power consumption since they are hard to replace, and have to guarantee high data rate and low transmission delay for consistent signal monitor. In this paper, we propose an algorithm that aims to reduce transmission delay and power consumption, and guarantees stable throughput, by assuming the number of active nodes, and followed by dynamically adjusting the random access period and transmission possibilities in a superframe. The assumed number of active nodes may be incorrect since it only relies on the channel status of a previous superframe. Therefore, we assume the number of active nodes and define a pattern. And revise the number of the active nodes with the defined pattern. To evaluate the performance of the proposed algorithm, we have implemented a WBAN environment with the MATLAB. The simulation results show that the proposed algorithm provides better throughput, low power consumption, and low transmission delay when compared to the slotted ALOHA of the IEEE 802.15.6.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.165-178
• /
• 2012

In most conventional video codecs, such as MPEG-2 and MPEG-4, inter coding is performed with the fixed motion vector resolution. When KTA software was developed, resolution for MVs can be selected in each slice. Although KTA codec uses a variety of resolutions for ME, the selected resolution is applied over the entire pixels in the slice and the statistical property of the local area is not considered. In this paper, we propose an adaptive decision scheme for motion vector resolution which depends on region, where MV search area is divided to multiple regions according to the distance from PMV. In each region, the assigned resolution is used to estimate MV. Each region supports different resolution for ME from other regions. The efficiency of the proposed scheme is affected from threshold values to divide the search area and the entropy coding method to encode the estimated MV. Simulation results with HM3.0 which is the reference software of HEVC show that the proposed scheme provides bit rate gains of 0.9%, 0.6%, and 2.9% in Random Access, Low Delay with B picture, and Low Delay with P picture structures, respectively.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.288-298
• /
• 2003

We consider a window-controlled selective-repeat ARQ scheme for error control between two adjacent nodes lying on a communication path. In this scheme, each packet to be transmitted is endowed with a serial number in a cyclic and sequential fashion. In turn, the transmitting node is not allowed to transmit a packet belonging to a window before every packet in the previous window is positively acknowledged. Such postponement of packet transmission incurs a degradation in throughput and delay performance. In this paper, aiming at improving packet delay performance, we employs a supplement scheme in which a serial number is duplicated within a frame. Classifying duplication rules into fixed, random and adaptive categories, we present candidate rules in each category and evaluate the packet delay performance induced by each duplication rule. From numerical examples, we observe that duplicating serial numbers, especially ADR-T2 effectively reduces mean packet delay for the forward channel characterized by a low packet error rate. We also reveal that such delay enhancement is achieved by a high probability of hitting local optimal window size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.998-1005
• /
• 2009

In the uplink of OFDMA (Orthogonal Frequency Division Multiple Access) based M-WiMAX(Mobile-Worldwide Interoperability for Microwave Access) system, linear phase shift is caused by signals transmitted from multiuser with different delay time and thus, MAI (Multiple Access Interference) occurs. MAI degrades the performance of ranging code detection and delay time estimation in the uplink. Therefore, in this paper, we propose ranging algorithm, applying SIC (Successive Interference Cancellation) to the conventional ranging algorithm, to minimize MAI and to improve ranging performance. The proposed ranging algorithm is verified through the Monte Carlo simulation, which shows the improved performance of ranging code detection and delay time estimation compared to the conventional algorithms. Through compared with random access of the 3GPP LTE, we can know limit of ranging performance.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.339-346
• /
• 1999

When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.600-609
• /
• 2009

The traditional carrier sense multiple access (CSMA) protocol like IEEE 802.11 Distributed Coordination Function (DCF) does not handle the constraints adequately, leading to degraded delay latency and throughput as the network scales are enlarged. We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is like the randomized CSMA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to severaansimes latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely using network simulation package,caS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to delay latency.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.189-198
• /
• 2009

Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.11
• /
• pp.69-76
• /
• 2008

Safety-related messages are propagated in form of broadcasting among vehicles in vehicle safety communication. There is the broadcast storm problem in high density vehicle environments. To solve this problem, a distance-based broadcast scheme has been proposed. It causes a serious problem such as retransmission delay in low density vehicle environments since it requires additional defer time to rebroadcast messages. This paper proposes a distance and random-based broadcast scheme. The proposed scheme selects a random time from zero to the defer time that estimated depending on the distance between sending and receiving vehicles. Simulation results show that the proposed scheme requires shorter defer time and less rebroadcasting message than existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1267-1275
• /
• 2007

An improved backoff algorithm for retransmission randomization for OFDMA/CDMA/slotted ALOHA used in the ranging subchannel of IEEE 802.16 network is proposed. Exploiting the fact that a base station coordinates channel access using UL-/DL-MAP in the IEEE 802.16 networks, we propose a minor modification of the existing IEEE 802.16 in order to increase throughput, decrease delay variation and achieve a graceful performance degradation in case of overload channel condition of the random access protocol. The algorithm basically estimates the number of backlogged users and arrival rate using which, the BS calculates retransmission probability for the subscriber stations involved in a collision. Computer simulation is performed to demonstrate the effectiveness of the proposed algorithm and to compare the performance with existing binary exponential backoff algorithm.