• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.189-197
• /
• 2016

Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6A
• /
• pp.445-454
• /
• 2005

To measure the performance of call quality, we have built the experiment environment and observed that the delay caused by encapsulation between internet and VoIP telephones is under 5ms at most. The major delay is assumed to be the time required to capsulate the packet for tunnelling of VPN. Because the difference of average delay time is under $4ms{\sim}5ms$, the difference of call quality between VoIP and VoIP telephone adopting VPN is negligible. We have concluded that the capsulation process between PAC and PNS is the major factor influencing the network load by changing the number of fames in a packet during communication Also, we have concluded that the most suitable frame numbers is tow or three by adding the frame numbers in a packet to obtain the suitable frames in a packet and setting up end-to-end delay under 150ms.

• Smart Media Journal
• /
• v.8 no.2
• /
• pp.21-28
• /
• 2019

Recent research on energy harvesting wireless sensor networks focuses on the development of techniques to solve the limited energy resource problem and to extend the whole network life efficiently. Energy harvesting technology can increase the lifetime of a network, but data transmission becomes unavailable when it harvests energy from radio frequency, resulting longer network delay with respect to the increased time in energy harvesting. Therefore, building energy harvesting wireless sensor network should consider the possible network delay as well as the network lifetime problem. In this paper, we propose a new MAC protocol that minimizes end-to-end network delay by adjusting the data transmission time for a packet based on estimating the energy for data transmission along with the amount of traffic flowing into the network and harvested energy. For this goal, it engineers an energy management mechanism that adjusts the sleep time of the network by measuring energy harvesting time. In addition, with simulation results it shows that the proposed MAC protocol improves the performance in terms of energy consumption and end-to-end delay, compared to the existing MAC protocols.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.121-124
• /
• 1999

In a packet-switched wireless cellular network, a packet destined to a mobile station is queued at a base station and then broadcast over the base station's cell. When an active mobile station leaves a cell, there re-main packets which are destined to the mobile and not yet delivered to it at the cell's base station. For application which are sensitive to packet losses, such back- logged packets must be forwarded to the new base station. Otherwise, an end-to-end retransmission may be required. However, an increase in packet delay is incurred by employing the packet forward scheme, since a packet may be forwarded many times before it is delivered to the destined mobile station. For an enhanced quality-of-service level, it is preferred to reduce tile packet delay time. In this paper, we develop an analytical approximation method for deriving mean packet delay times. Using the approximation and simulation methods, we investigate the effect of network parameters on the packet delay time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1141-1149
• /
• 2010

Next Generation Networks (NGN) is defined as IP-based networks with multi-services and with multi-access networks. A variety of services and access technologies are co-existed within NGN. Therefore there are numerous transport technologies such as Differentiated Services (DiffServ), Multi-protocol Label Switching (MPLS), and the combined transport technologies. In such an environment, flows are aggregated and de-aggregated multiple times in their end-to-end paths. In this research, a method for calculating end-to-end delay bound for such a flow, provided that the information exchanged among networks regarding flow aggregates, especially the maximum burst size of a flow aggregate entering a network. We suggest an admission control mechanism that can decide whether the requested performance for a flow can be met. We further verify the suggested calculation and admission algorithm with a few realistic scenarios.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2822-2831
• /
• 1997

A B-ISDN network based on ATM must support several kinds of transport services with different traffic characteristics and service requirements. There is neither link-by-link flow control nor error control in the ATM layer. For different services, different flow/error controls could be performed at the AAL layer or at a higher Iayer(e.g. transport layer). In traditional data networks, the window now control mechanism combined with error control was used prevalently. But, the window flow control mechanism might be useless in ATM networks because the propagation delay is too large compared with the transmission rate. In this paper, we propose a simple flow control mechanism, called RCT(Rate Control for end-to-end Transport), for end-to-end data transport. The RCT shows acceptable performance when the average overload period is bounded by a certain time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2002.11a
• /
• pp.130-136
• /
• 2002

Device makers want to make higher density chips as devices shrink, especially WSix poly stack down is one of the key issues. However, EPD (End Point Detection) time delay was happened in DPS+ poly chamber which is a barrier to achieve device shrink because EPD time delay killed test pattern and next generation device. To investigate the EPD time delay, a test was done with patterned wafers. This experimental was carried out combined with OES(Optical Emission Spectroscopy) and SEM (Scanning Electron Microscopy). OES was used to find corrected wavelength in WSix stack down gate etching. SEM was used to confirm WSix gate profile and gate oxide damage. Through the experiment, a new wavelength (252nm) line of plasma is selected for DPS+ chamber to call correct EPD in WSix stack down gate etching for current device and next generation device.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.593-594
• /
• 2015

In wireless sensor networks (WSNs), due to the very low data rate, the sleeping schedule is usually used to save consumed energy and prolong the lifetime of nodes. However, duty-cycled approach can cause a high end-to-end (E2E) delay. In this paper, we study a node scheduling algorithm in WSNs such that E2E delay meets bounded delay with a given probability. We have applied the probability theory to spot the relationship between E2E delay and node interval. Simulation result illustrates that we can create the network to achieve given delay with prior probability and high energy use efficient as well.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.63-68
• /
• 2019

Emerging applications such as Smart factory, in-car network, wide area power network require strict bounds on the end-to-end network delays. Flow-based scheduler in traditional Integrated Services (IntServ) architecture could be possible solution, yet its complexity prohibits practical implementation. Sub-optimal class-based scheduler cannot provide guaranteed delay since the burst increases rapidly as nodes are passed by. Therefore a leaky-bucket type regulator placed next to the scheduler is being considered widely. This paper proposes a simple server that achieves both fair scheduling and traffic regulation at the same time. The performance of the proposed server is investigated, and it is shown that a few msec delay bound can be achieved even in large scale networks.