• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.241-260
• /
• 2011

In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.1
• /
• pp.39-52
• /
• 2022

We introduce Clifford-valued neural networks with leakage delays. Furthermore, we study the uniqueness and existence of Clifford-valued Hopfield artificial neural networks having the Stepanov weighted pseudo almost periodic forcing terms on leakage delay terms. However the noncommutativity of the Clifford numbers' multiplication made our investigation diffcult, so our results are obtained by decomposing Clifford-valued neural networks into real-valued neural networks. Our analysis is based on the differential inequality techniques and the Banach contraction mapping principle.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3496-3514
• /
• 2015

One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.471-476
• /
• 1995

This paper focues on development and implementation of a perfomance management algorithm for IEEE802.4 token bus networks to serve large-scale integrated manufacturing systems. Such factory automation networks have to satisfy delay constraints imposed on time-critical messages while maintaining as much network capacity as possible for non-time-critical messages. This paper presents the structure of a network performance manager that possesses the knowledge about perfomance management in a set of fuzzy rules and deriving its action through fuzzy inference mechanism. The efficacy of the performance management has been demonstrated by a series of simulation experiments.

• The Journal of Information Systems
• /
• v.8 no.1
• /
• pp.93-108
• /
• 1999

The switching system is designed and developed to satisfy the performance design objectives recommended by ITU for call processing capacity and quality of service(QOS), etc. When the results by actual measurement at the system testing phase do not satisfy the performance design objectives, however, an effort is required to improve the performance. This paper presents a method for improving QOS by modifying the application programs for the switching system. In the proposed method, the sequence chart related to a delay time for call connection is modelled using PERT(Program Evaluation and Review Technique) network. Then, the criticality index of a message is calculated using Monte Carlo simulation to evaluate which message's processing time to decrease in order to decrease the delay time and thus to improve QOS. The criticality index of a block is also calculated to identify those software blocks that significantly contribute to the delay time.

• The KIPS Transactions:PartA
• /
• v.19A no.4
• /
• pp.181-186
• /
• 2012

The distributed measurement and control system require technology to solve complex synchronization problem among distributed devices. It can be solved by using IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems to synchronize real-time clocks incorporated within each component of the system. In this paper, we implemented the IEEE 1588v2 PTP emulator on BlueScope BL6000A using a delay request-response mechanism to measure clock synchronization.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.962-964
• /
• 1987

In this paper a virtual route pacing control mechanism is introduced to the flow control of M-hop virtual route in the packet data network. The results described in this paper show us a comparison of the relationship between the throughput and the time-delay with the variation of the parameter, the normalized applied load. for the fixed window size.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.477-480
• /
• 2004

최근 생산 현장에 최종 제품의 성능 보장을 위해 사용될 소재의 특성을 검사하는 장비가 도입.운영되고 있다. 이들 장치 중 Rheotruder는 폴리머 소재의 품질 평가기준이 되는 점도를 측정하기 위해 제작되었으며 이는 지연시간 및 비선형적 특성을 갖게 되어 시스템의 분석이 용이하지 않다는 문제점을 갖는다. 본 연구에서는 비선형 특성을 갖는 측정 장치의 성능 평가를 용이하게 하기 위해 동적 시스템 모델링이 가능한 TDNN(Time Delay Neural Network)을 도입하여 실제 Rheotruder에 적용하여 봄으로써 그 유용성을 확인하고자 한다.

• Proceedings of the KIPE Conference
• /
• 2005.07a
• /
• pp.618-620
• /
• 2005

An $H_2$ tracking controller is proposed for networked control systems. The network induced delay is assumed to be time varying and vary in the known range. The proposed controller guarantees stability and $H_2$ performance for all time varying delay in the known range. The proposed controller is verified using a simple networked motor control system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9A
• /
• pp.685-696
• /
• 2009

The requirements of the NGA are to provide broader bandwidth, higher splitting ratio, and longer reach than those of the current FTTH. In the TDMA PON accounting for large percentage in the total FTTH, the increase in distance between the OLT and the ONU leads to the increase in propagation delay and in packet delay three times more than the propagation delay. It is because a packet arrived in the ONU is handled through bandwidth request, grant, and transmission. To reduce the increased packet delay, the OLT have to reduce the cycle time. However, it will cause increased overhead and reduced link efficiency. In this paper, we investigate several problems in TDMA PON when the subscriber access network extended to 60 or 100 Km reach as a NGA goal and provide a method that determines an optimal cycle time to satisfy QoS for delay sensitive traffics. In particular, we suggest a variable equalized round trip delay method and a variable cycle time method. It is shown that the former reduces the packet delay and the latter increase the link efficiency.