• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.15-23
• /
• 2004

This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia sever and inefficient use of network resources, The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests sevice are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos In order to reduce end-to-end delay.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.6
• /
• pp.689-694
• /
• 2014

DDoS attacks on MANET makes disable any node which support network function, cause critical results as a stopping of entire network service or separation to some parts. Packet aggregation, which gather some pieces of short length into a certain length of data, improves transmission performances on MANETs. In this paper, some effects on transmission performance of packet aggregation transmission be caused by DDoS Attacks are measured and analyzed in point of end-to-end level. MANET simulator, based on NS-2, is used for measurement end-to-end performances. MOS, connection rate, delay and packet loss rate is used as performance parameters. VoIP traffic is used for object service measurement. Finally, it is suggested that number of packet aggregation is more then 4 for keeping the transmission quality over MANETs under DDoS attacks.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.178-185
• /
• 2009

A signal processing algorithm is proposed for end point detection which is used commonly in accelerometers-based pattern recognition problem. In the conventional method, end points are detected by manual manipulation with an additive button or algorithm based on statistical computation and highpass filtering to cause critical time delay and difficulty for parameters optimization. As an solution, we propose a focused Time Lagged Feedforward Network(TLFN) with respect to a differential signal of acceleration, which is widely applied for time series forecasting. The simple experiment is conducted with handwriting and the detection performance and response characteristic of the proposed algorithm is tested and analyzed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.49-54
• /
• 2011

In this paper, End-to-End VoIP(Voice over Internet Protocol) performance over large scale MANET(Mobile Ad-hoc Networks) is evaluated. VoIP implementation model, which can be used for large scale MANET, is suggested through this evaluation. VoIP simulator based on NS-2 network simulator is used for performance measurement. Call connection ratio as a connection performance, MOS and network delay as a transmission performance, packet loss rate as other performance is measured with this simulation. Finally, maximum $10{\sim}15km^2$ as a single MANET, 500 nodes and 100 call connections is suggested for VoIP implementation and operation conditions over large scale MANETs.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.58-66
• /
• 2015

Aeronautical communication networks (ACN) is an emerging concept in which aeronautical stations (AS) are considered as a part of multi-tier network for the future wireless communication system. An AS could be a commercial plane, helicopter, or any other low orbit station, i.e., Unmanned air vehicle, high altitude platform. The goal of ACN is to provide high throughput and cost effective communication network for aeronautical applications (i.e., Air traffic control (ATC), air traffic management (ATM) communications, and commercial in-flight Internet activities), and terrestrial networks by using aeronautical platforms as a backbone. In this paper, we investigate the issues about connectivity, throughput, and delay in ACN. First, topology of ACN is presented as a simple mobile ad hoc network and connectivity analysis is provided. Then, by using information obtained from connectivity analysis, we investigate two communication models, i.e., single-hop and two-hop, in which each source AS is communicating with its destination AS with or without the help of intermediate relay AS, respectively. In our throughput analysis, we use the method of finding the maximum number of concurrent successful transmissions to derive ACN throughput upper bounds for the two communication models. We conclude that the two-hop model achieves greater throughput scaling than the single-hop model for ACN and multi-hop models cannot achieve better throughput scaling than two-hop model. Furthermore, since delay issue is more salient in two-hop communication, we characterize the delay performance and derive the closed-form average end-to-end delay for the two-hop model. Finally, computer simulations are performed and it is shown that ACN is robust in terms of throughput and delay performances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.5
• /
• pp.435-446
• /
• 2014

Even if it is important to transmit high rate multimedia information without any transmission errors for surveillance systems, it is difficult to achieve error-free transmission due to infra-less adhoc networks. In order to reduce the transmission errors furthermore, additional signal overheads or retransmission of signals should be required, but they may lead to transmission delay. This paper represents a study on low delay and adaptive video transmission for the unmanned surveillance systems by developing system protocols. In addition, we introduce an efficient and adaptive control algorithm using system parameters for exploiting unmanned surveillance system properly over multi-channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.4099-4113
• /
• 2022

In this paper, we propose improved maximum access delay time, noise variance, and power delay profile (PDP) estimation schemes for orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. To this end, we adopt the approximate maximum likelihood (ML) estimation strategy. For the first step, the log-likelihood function (LLF) of the received OFDM symbols is derived by utilizing only the cyclic redundancy induced by cyclic prefix (CP) without additional information. Then, the set of the initial path powers is sub-optimally obtained to maximize the derived LLF. In the second step, we can select a subset of the initial path power set, i.e. the maximum access delay time, so as to maximize the modified LLF. Through numerical simulations, the benefit of the proposed method is verified by comparison with the existing methods in terms of normalized mean square error, erroneous detection, and good detection probabilities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.923-928
• /
• 2003

This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth：Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms：it's not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.

• KIISE Transactions on Computing Practices
• /
• v.20 no.11
• /
• pp.598-603
• /
• 2014

In wireless sensor networks, two methods have been generally used to track continuously moving object: a user query-based method and a periodic report-based method. Although the former method generates more overhead as a result of the user queries, the former one is also an energy-efficient method that does not transfer unnecessary information. For the user query-based method, a virtual tree that consist of sensor nodes is used to perform the user query and the sensor reporting. The tree stores the information of the mobile objects, and the stored information triggers a report b the user query. However, in case of a fast-moving object, the tracking accuracy decreases as a result of the time delay of the end-to-end repeated query. In order to solve this problem, we propose a query-relay method that reduces the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to adjacent nodes according to the movement of mobile object that is tracked. When the query messages are relayed. The end-to-end querying time delay is reduced. and a simulation shows that our method is superior to existing ones in terms of tracking accuracy.