• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2769-2774
• /
• 2013

The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.7
• /
• pp.3176-3183
• /
• 2011

Traffic and congestion control in the wireless sensor network is an important parameter that decides the throughput and QoS (Quality of Service). This paper proposes a transmission rate priority-based traffic control scheme to serve digital contents streaming in wireless sensor networks. In this paper, priority for transmission rate decides on the real-time traffic and non-real-time with burst time and length. This transmission rate-based priority creates low latency and high reliability so that traffic can be efficiently controlled when needed. Traffic control in this paper performs the service differentiation via traffic detection process, traffic notification process and traffic adjustment. The simulation results show that the proposed scheme achieves improved performance in delay rate, packet loss rate and throughput compared with those of other existing CCF and WCA.

• The KIPS Transactions:PartC
• /
• v.19C no.1
• /
• pp.71-82
• /
• 2012

In Next Generation Wireless Networks (NGWN), lots of information, such as voice and video data, will be used in All-IP networks. It is important note that seamless service for users and handoff between heterogeneous networks must be taken into account in such environments. Therefore, in this paper, we propose a SePH(Seamless Proxy based Handoff) using PMIPv6-based proxy model which is enable to improve the performance of handoff in NGWN. The SePH can efficiently support seamless and IP-based mobility by reducing the search process. The performance results show that our proposed scheme outperforms in terms of QoS (Quality of Service) such as throughput, handoff latency, packet loss, and signaling overhead comparing to the existing schemes.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.647-654
• /
• 2002

Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other supporting communication facilities (such as base stations, etc.). Therefore, the topology of an Ad-hoc network frequently changes due to the movement of mobile host, which nay lead to sudden packet loss. Recently, the large amount of research has focused on the routing protocols needed in such an environment. In this paper, TCP Reno, Sack, and Tahoe versions are analysed using DSR protocol which is the representative On-Demand routing protocol in Ad-hoc wireless network. As the result of this simulation, we know that TCP Reno relatively has higher throughput than that of Sack and Tahoe, and TCP Reno has more stable performance than that of TCP Tahoe and Sack, regardless of the speed of mobile node and the size of topology.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.31-43
• /
• 2004

Voice over Internet Protocol (VoIP) is currently a popular research topic as a real time voice packet transmission method. But current Internet environment do not guarantee the quality of voice when we take a side view of delay, jitter and loss. Up to now, many voice based evaluation algorithms have been used to measure speech quality of VoIP systems. However, these algorithms have the defects that their results are different according to voice samples and some algorithms can not take network environment for speech transmission path. The E-model can be used to solve the problems of these algorithms. In this paper. we introduce VoIP planning guidelines through the various analysis of E-model which can model impairments of network quality as well as VoIP equipment quality systematically, We, also, show the evaluation method and results of speech transmission quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.277-284
• /
• 2009

With significant development in wireless communication technologies, the needs to handover from one network to another have grown dramatically. Recently IETF developed MIPv6 and FMIPv6 which are used to handover between different access networks. These handover mechanisms have some known weaknesses. MIPv6 can not serve time-critical application because it causes long handover latency and packet loss. By these reasons, MIPv6 does not guarantee session continuity. FMIPv6 uses handover preparation phase to reduce DAD latency. However FMIPv66 still suffers from long handover latency, because it must perform binding update at the end of handover procedure. In this paper we propose new handover mechanism FMIPv6-PBU which eliminates binding update latency. The proposed mechanism has compatability with lagacy FMIPv6. In this paper propose FMIPv6-PBU handover procedure and explain its procedures and evaluate it with MIPv6 and FMIPv6.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.478-484
• /
• 2008

When a mobile node moves, MIPv6 operates an authentication process for the new connection. These kinds of frequent binding update and authentication processes cause much traffic and delay the service. To solve this problem, PMIPv6 provides a network-based mobility protocol in order to lessen the load on a mobile node. However, when it is moved from a domain to a domain or in a domain, there still lies a need fDr a new address, so MIPv6's demerit still exists. In IPsec, too, a new negotiation should be made when it is moved to WAN(Wide Area Network). This causes load to the mobile node. In this paper suggests MBB(Make Before Break) system to eliminate disconnections or delays resulted from the address change or renegotiation for security. When the mobile node receives a CoA address, IPsec negotiation gets operated. Its identity is authenticated by sending the identifier used for the prior negotiation to CN(Correspondent Node) through the BID message suggested. After that, negotiation Bets simplified that disconnections can be eliminated, and in the IPsec negotiation, the load on the mobile node can be lessened as well; moreover, two addresses are used for the communication simultaneously, so the probability of packet loss can be reduced.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.784-788
• /
• 2009

In recent years, the driver needs the convenience of their vehicles and that there is an increasing requirement. Many researches have been mainly focused on MOST Networks to provide quality of multimedia service. The MOST network to support different bandwidth(MOST 25, MOST 50, MOST 150) should consist of a heterogeneous network. So the networks to used different protocols required gateway for receive and transmit information. The method to used gateway has problems occured loss of a packet by a lot of delay. Therefore in this paper, we propose a MOST GATEWAY system for organically connected to the network MOST150 and MOST 25. After analyzing the performance of the existing scheduling algorithm, we will present an improvement scheme of the efficiency and scalability.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.313-316
• /
• 2009

A novel approach for electrocardiogram (ECG) analysis within a functional sensor node has been developed and evaluated. The main aim is to reduce data collision, traffic over loads and power consumption in healthcare applications of wireless sensor networks (WSN). The sensor node attached on the patient's bodysurface around the heart can perform ECG analysis based on a QRS detection algorithm to detect abnormal condition of the patient. Data transfer is activated only after detected abnormality in the ECG. This system can reduce packet loss during transmission by reducing traffic overload. In addition, it saves power supply energy leading to more reliable, cheap and user-friendly operation in the WSN based ubiquitous health monitoring.