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

Wireless Body Area Network(WBAN) is a network standard around a human body which connects various medical sensor and devices It has to satisfy various demands such as data transmission rate, priority, and delay time. In this paper, considering a data priority and transmission delay time, is proposed to improve efficiency of WBAN service depending on congestion status of network. The proposed algorithm operates with adapted data removal probability according to data priority when the hub buffer is congested than before. And in the case of lower congestion within the hub buffer data is served considering data delay time. Through the comparison with other existing scheduling algorithms, it is confirmed that quality of WBAN service is improved due to lower data loss rate of medical data and less delay time in the proposed algorithm.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.299-306
• /
• 2010

IPTV and VoIP services are considered as killer applications over Mobile WiMAX network, which provideshigh mobility and data rate. Among those which affect the quality of voice in those services, the jitter buffer or playout buffer can compensate the poor voice quality caused by the packet drop due to frequent route change or differences among routes between service endpoints. In this paper, we analyze the correlation between the sleep interval length and jitter buffer size in order to guarantee a predefined level of voice quality. For this purpose, we present an end-to-end delay model considering additional delay incurred by the WiMAX PSC-II sleep mode and a VoIP service quality requirement based on the delay constraints. Through extensive simulation experiments, we also show that the increase of jitter buffer size may degrade the voice quality since it can introduce additional packet drop in the jitter buffer under WiMAX power saving mode.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.694-699
• /
• 2014

In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.6
• /
• pp.255-260
• /
• 2017

The limitation of real-time video conferencing system is that the delay of network and buffering and the transmission of user information are not efficiently performed between systems, so real - time performance is not guaranteed completely. In order to overcome this problem, the study on the extension of the network infrastructure and the jitter delay is actively carried out, but the study on the buffering delay is insufficient. In this paper, we propose a frame-rate control buffer management (FRCB) scheme to solve the problem caused by buffering delay. The FRCB is used to prevent overflow and underflow of the buffer by adopting the two-stage buffer threshold of Fast-play THreshold (FTH) and Slow-play THreshold (STH). Therefore, it showed better performance than jitter buffer even under high CPU load, and showed that it is suitable for high quality real time video conferencing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1194-1201
• /
• 2003

Measurements of network traffic have shown that self-similarity is a ubiquitous phenomenon spanning across diverse network environments. We have advance the framework of multiple time scale congestion control and show its effectiveness at enhancing performance for fast TCP prototype control. In this paper, we extend the fast TCP prototype control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of fast TCP prototype is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. We explicate out methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under self-similar traffic conditions. We discuss issues arising in comparative performance evaluation under heavy-tailed workload. workload.

• Journal of Advanced Navigation Technology
• /
• v.18 no.1
• /
• pp.29-34
• /
• 2014

Data fusion techniques combine data from multiple radars and related information to achieve more accurate estimations than could be achieved by a single, independent radar. In this paper, we analyze delay and loss of packets to be processed by multiple radar and minimize data processing interval from centralized data processing operation as fusing multiple radar data. Therefore, we model radar network about central data fusion, and analyze delay and loss of packets inside queues on assuming queues respectively as the M/M/1/K using NS-2. We confirmed average delay time, processing fused multiple radar data, through the analysis data. And then, this delay time can be used as a reference time for radar data latency in fusion center.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.17-25
• /
• 2007

In this paper, an algorithm that provisions proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features an adaptive scheme that adjusts the target delay every time slot to compensate the deviation from the target delay which is caused by the prediction error on the traffic to be arrived in the next time slot. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential rate traffic. It is demonstrated through simulations that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA and the performance is verified under the test board based on the XPC860P CPU.

• Journal of the Korea Society for Simulation
• /
• v.20 no.1
• /
• pp.19-28
• /
• 2011

The safety applications based on the IEEE 802.11p, periodically transmit the safety-related information to all surrounding vehicles with high reliability and a strict timeline. However, due to the high vehicle mobility, dynamic network topology and limited network resource, the fixed beacon scheduling scheme excess delay and packet loss due to the channel contention and network congestion. With this motivation, we propose a novel beacon scheduling algorithm referred to as spatial-aware(SA) beacon scheduling based on the spatial context information, dynamically rescheduling the beaconing rate like a TDMA channel access scheme. The proposed SA beacon scheduling algorithm was evaluated using different highway traffic scenarios with both a realistic channel model and 802.11p model in our simulation. The simulation results showed that the performance of our proposed algorithm was better than the fixed scheduling in terms of throughput, channel access delay, and channel load. Also, our proposed algorithm is satisfy the requirements of vehicular safety application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.774-782
• /
• 2003

Generally, in the Mobile IP technologies, the use of RSVP(Resource ReSerVation Protocol) is recommended in order to provide a mobile node real-time service. However, the handoff of a mobile node increases the registration delay, RSVP reservation delay and signalling overhead in the Mobile IP and RSVP interworking. Specially, the resource reservation on the path between a mobile node and a correspondent node is the duplicated reservation and then causes unnecessary creation of the signalling overhead and waste of the resource, since the majority of the path before handoff and after handoff is same. If the radius of a cell providing a wireless interface to a mobile node is small, the number of handoff will increase and also signalling overhead and duplicated resource reservation will increase. In this paper, we proposed the integration model of Cellular IP and RSVP with RSVP proxy scheme. Here, Cellular IP protocol minimizes registration delay, transfer delay, and loss by handoff in micro cell network, the RS VP proxy that minimizes the duplication of resource reservation prevents the path for RSVP session from change using the address for reservation of a mobile node. Proposed scheme was evaluated in comparison with the existing Mobile IP and RSVP interworking scheme using the probability of resource reservation fail to the radius of a cell and the handoff rate.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.49-58
• /
• 2006

When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.