• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2908-2914
• /
• 1998

This paper presents an intelligent signal for controling the traffic lights on traffic junction network with dynamic traffic flow, When a junction is connected to adjacent junctions on four sides. Prior researches have been done on the single traffic junction. However, it is dificult to apply single junction controller to real traffic situation. In this paper, we develop a fuzzy taffic network controller which adjusts the extension time of current green phase by using teh fuzzy input variables such as the number of entering cars at the green light, the number of waiting cars during the red light, and the traffic volume. The proposed method was compared to the existing junction signal control methods on controllers in terms of average delay time of cars and the cost function defined in this paper.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.248-251
• /
• 1992

In this paper, the RedMAP, i.e. a redundant Mini-MAP system for high reliability is proposed. Redundancy is implemented for LLC, MAC, and Physical layer of ISL-Mini -MAP. The detection of error of the network, the broadcasting of the error event, and the network change sequence are three major functions for the dualized Mini-MAP system. The abnormal operation of the network is mainly detected indirectly with the function of the TBC( token bus controller). The time delay to be required for the change of the networks must be minimized. With the RedMAP, we can achieve successful transmission only with short additional recovery time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.3
• /
• pp.270-274
• /
• 2002

This paper presents a teleoperation system that combines computer network and an autonomous mobile robot. We control remotely an autonomous mobile robot with vision over the Internet to guide it under unknown environments in the real time. The main feature of this system is that local operators need a web browser and a computer connected to the communication network and so they can command the robot in a remote location through the home page. The hardware architecture of this system consists of an autonomous mobile robot, workstation, and local computers. The software architecture of this system includes the client part for the user interface and robot control as well as the server part for communication between users and robot. The server and client systems are developed using Java language which is suitable to internet application and supports multi-platform. Furthermore. this system offers an image compression method using JPEG concept which reduces large time delay that occurs in network during image transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.550-556
• /
• 2008

Swam intelligence refers that a large group of simple and unsophisticated entities work together to achieve complex and significant tasks. Researches using such swarm intelligence has been performed in the network routing area. Expecially, it has been well known that routing in mobile ad-hoc networks whose features are dynamic topology and routing based on the local information is one of the applications of swarm intelligence. In this paper, we propose an ant-based routing method for MANET. The proposed method sets its goals to reduce overheads by managing ants efficiently, and to reduce route set up time. The results obtained from simulations proved that the proposed method provides shorter path set-up time and end-to-end delay and less overhead while providing comparable packet delivery ratio.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.729-731
• /
• 2016

The efficiency of genetic algorithm may be improved, as genetic generation increases. However, a number of algorithms are needed until desired results are obtained. In addition, if Hoc unit increases when linked to a network, there may be a need to compare with all the cases, which would result in many algorithms at a time, and if a single process deals with such algorithms, the efficiency will decrease. Therefore, efficiency of overall network will be decreased in the end. Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.107-119
• /
• 2013

This paper reinforced security under the network evaluation of wire wireless integration of NEMO (NEwork MObility) supporting mobility and network-based PMIPv6 (Proxy Mobile IPv6). It also proposes $SK-L^2AS$ (Symmetric Key-Based Local-Lighted Authentication Scheme) based on simple key which reduces code calculation and authentication delay costs. Moreover, fast handover technique was also adopted to reduce handover delay time in PMIPv6 and X-FPMIPv6 (eXtension of Fast Handover for PMIPv6) was used to support global mobility. In addition, AX-FPMIPv6 (Authentication eXtension of Fast Handover for PMIPv6) is proposed which integrated $SK-L^2AS$ and X-FPMIPv6 by applying Piggybacks method to reduce the overhead of authentication and signaling. The AX-FPMIPv6 technique suggested in this paper shows that this technique is better than the existing schemes in authentication and handover delay according to the performance analysis.

• Journal of the Korean Society for Railway
• /
• v.17 no.6
• /
• pp.402-409
• /
• 2014

Wireless local area network (WLAN) is a widely used wireless access method due to its easy usability and excellent performance. However, its performance degrades significantly as the number of users increases. In busy train stations, where the number of WLAN users are large and, more importantly the number of simultaneous packet transmission attempts is extremely large due to the time synchronization upon train arrival, the packet transmission delay problem is very severe and almost impossible for WLAN stations to initiate communication with WLAN networks. In this paper, a novel distributed WLAN access scheme for efficient WLAN communication in busy train stations is proposed. Using the proposed scheme, WLAN access delay can be significantly reduced under highly congested traffic environments. Therefore, a significant performance enhancement for the WLAN performance used in the Communication Based Train Control (CBTC) can be achieved.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.148-156
• /
• 2000

This paper proposed that an MPLS-based VPN using next-generation If switches and appropriate set of traffic engineering algorithms is the best way to implement QoS-capable IP VPNs. While ATM-based solution would not rely scalable the number of connections becomes too large, MPLS-based VPNs’ efficiency could be confirmed network delay time through performance evaluation. And we evaluated the performance about the If VPN based on proposed MPLS, at the result of evaluation. We figured out that delay increased more slowly in case of VPN based on MPLS comparing with the VPN based on ATM which has rapid delay increasement. Therefore we confirm that the VPN based on MPLS has high speed of packet processing and high degree of network efficiency through the performance evaluation.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

• Journal of Digital Contents Society
• /
• v.3 no.1
• /
• pp.47-57
• /
• 2002

Recently, wireless networks have been pursuing multimedia data service as voice, data, image, video and various form of data according to development of information communication technology. It guarantees cell delivery delay of real time data in efficient real time multimedia data transfer. Also, it minimizes cell loss rate of non-real time multimedia data. In the wireless ATM, there are based on Asynchronous Transfer Mode(ATM). It implies that there are various service with difficult transmission rates and qualities in the wireless communication network. As a result, it is important to find out the ways to guarantee the Quality of Service(QoS) for each kind of traffic in wireless network. In this thesis, we propose an improved TCRM scheduling algorithms for transmission real-time multimedia data service in wireless ATM Networks. We appear real time multimedia scheduling policy that apply each different method to uplink and downlik to wireless ATM network. It can guarantee QoS requirements for each real time data and non-real time data. It also deals the fairness problem for sharing the scarce wireless resources. We solve fault of TCRM as inefficient problem of non-real data by using arbitrary transmission speed and RB(Reservation Buffer) through VC(Virtual Control) and BS(Base Station).