• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3219-3236
• /
• 2012

A tree routing structure is often adopted for many-to-one data gathering and aggregation in sensor networks. For real-time scenarios, considering lossy wireless links, it is an important issue how to construct a maximum-lifetime data gathering tree with delay constraint. In this work, we study the problem of lifetime-preserving and delay-constrained tree construction in unreliable sensor networks. We prove that the problem is NP-complete. A greedy approximation algorithm is proposed. We use expected transmissions count (ETX) as the link quality indicator, as well as a measure of delay. Our algorithm starts from an arbitrary least ETX tree, and iteratively adjusts the hierarchy of the tree to reduce the load on bottleneck nodes by pruning and grafting its sub-tree. The complexity of the proposed algorithm is $O(N^4)$. Finally, extensive simulations are carried out to verify our approach. Simulation results show that our algorithm provides longer lifetime in various situations compared to existing data gathering schemes.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.263-268
• /
• 2004

The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.77-84
• /
• 2010

This paper aims to implement RAN(Radio Access Network) transmission system that can reduce the transmission cost by installing between mobile base station and base station controller. This system can reduce the number of transmission links by sharing the transmission link that the mobile communication stations of various generation use separately. This also can classify the traffics non-sensitive to delay time, and then transfer them through Ethernet/IP network.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.11
• /
• pp.930-935
• /
• 2005

In this paper, position tracking control of an autonomous helicopter is presented. Combining an LQR method and a proportional control forms a simple PD control. Since LQR control gains are set for the velocity control of the helicopter, a position tracking error occurs. To minimize a position tracking error, neural network is introduced. Specially, in the frame of the reference compensation technique for teaming neural network compensator, a position tracking error of an autonomous helicopter can be compensated by neural network installed in the remotely located ground station. Considering time delay between an auto-helicopter and the ground station, simulation studies have been conducted. Simulation results show that the LQR with neural network performs better than that of LQR itself.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.245-250
• /
• 2008

Recently, mobile devices have supported wireless LAN as well as bluetooth, where the services such as heterogeneous network access and seamless mobility connection are important. Even though the mobility and physical network might be varied, an efficient communication mechanism for the network access and a robust mobility management of mobile devices are needed. In this paper, we design and implement a Bluetooth system with mobile LAN access capability. The proposed system has the following features; 1) IP connection is enabled by BENP in the link layer, 2) The networks devices of heterogeneous mobile devices are integrated into a single virtual network interface, 3) IP mobility between the bluetooth and wireless LAN is supported by mobile IP. The experimented results show that the packet loss and delay time during the handover duration is reduced by predicting the handover among different networks followed by the setup of any required parameters in advance.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.406-415
• /
• 2009

In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.603-611
• /
• 2013

In this paper, we propose a new frame structure and the underlying dynamic resource control mechanism to support an integrated service, including a real-time (RT) service that requires to serve the end-to-end delay performance, as well as non-real-time (NRT) service, using Self-Organizing Time Division Multiple Access (SO-TDMA)-based MAC protocol in a multi-hop ad-hoc maritime communication network. The underlying frame structure is dynamically configured by resource allocation to guarantee the average target outage performance of the real-time service. Toward this end, we analyze the average outage probability and its performance is verified for the proposed frame structure by simulation.

• Journal of Broadcast Engineering
• /
• v.1 no.2
• /
• pp.133-141
• /
• 1996

In this paper, a VOD(Video -on-Demand) system is implemented using LAN(Local Area Network). The use of LAN causes the time-delay problem due to its narrow channel limitation, as a result, the service using the conventional LAN used not to be popular. In this paper, to solve these problems, we develop the modified topology, the selection methodology of the network equipment, and the dedicated(improved) protocol. Consequently, we can serve at most 3 or 4 clients at the same time, and we conclude it is necessary to optimize the network buffer size depending on the size of video data.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.183-187
• /
• 2002

This paper proposes a remote control system that combines computer network and an autonomous mobile robot. We control remotely an autonomous mobile robot with vision via the internet to guide it under unknown environments in the real time. The main feature of this system is that local operators need a World Wide Web browser and a computer connected to the internet communication network and so they can command the robot in a remote location through our Home Page. This system offers an image compression method using motion H.263 concept which reduces large time delay that occurs in network during image transmission.