• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.2
• /
• pp.99-105
• /
• 1999

This paper presents a fuzzy H$\infty$ filtering problem for a class of uncertain nonlinear systems with time-varying delayed states and unknown inital state on the basis of Takagi-Sugeno(T-S) fuzzy model. The nonlinear systems are represented by T-S fuzzy models, and the fuzzy control systems utilize the concept of the so-called parallel distributed compensation. Using a single quadraic Lyapunov function, the stability and L2 gain performance from the noise signals to the estimation error are discussed. Sufficient conditions for the existence of fuzzy H$\infty$ filters are given in terms of linear matrix inequalities (LMIs). The filtering gains can also be directly obtained from the solutions of LMIs.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.227-230
• /
• 1998

In this paper, we propose the design method of fuzzy robust H$\infty$ controller for the uncertain nonlinear discete-time systems with time delay. First, we represent a nonlinear plant with a modified T-S(Takagi-Sugeno) fuzzy model. Then design method utilizing the concept of PDC (parallel distributed compensation) is employed. For the modified T-S fuzzy model with uncertainty and delay, the sufficient condition of the quadratic stabilization with an H$\infty$ norm bound is presented in terms of Lyapunov stability theory and fuzzy robust H$\infty$ controller design method is given by LMI(linear matrix inequality) approach. Also an illustrative example is given to demonstrate the result of the proposed method.

• Journal of Information Technology and Architecture
• /
• v.10 no.2
• /
• pp.159-167
• /
• 2013

Web Services offer many benefits over other types of middleware in distributed computing. However, usage of Web Services results in large network bandwidth since Web Services use XML-based protocol which is heavier than binary protocols. Even though there have been many researches to minimize the network traffic and bandwidth usages of Web Services messages, none of them are solving problem clearly yet. In this paper, we propose a transparent proxy with cache to avoid transfer of repeated SOAP data, sent by Web Service to an application. To maintain the cache consistency, we introduce publish/subscribe paradigm using WS-Eventing between the proxy and Web Service. The implemented system based on our proposed architecture will not compromise the standards of Web Service. The evaluation of our system shows that caching SOAP messages not only reduces the network traffic but also decreases the request delays.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.436-446
• /
• 2014

The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.

• Journal of Auto-vehicle Safety Association
• /
• v.5 no.1
• /
• pp.50-55
• /
• 2013

When it comes to commercial vehicles, their unique characteristics - center of gravity, size, weight distribution - make them particularly vulnerable to rollover. On top of that, conventional heavy vehicle brake exhibits longer actuation delays caused in part by long air lines from brake pedal to tires. This paper describes rollover prevention algorithm that copes with the characteristics of commercial vehicles. In regard of compensating for high actuating delay, predicted rollover index with short preview time has been designed. Moreover, predicted rollover index with longer preview time has been calculated by using road curvature information based on environment information. When rollover index becomes larger than specific threshold value, desired braking force is calculated in order to decrease the index. At the same time, braking force is distributed to each tire to make yaw rate track desired value.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.139-146
• /
• 2022

Wireless access technologies are emerging to enable high data rates for mobile users and novel applications that encompass both human and machine-type interactions. An essential approach to meet the rising demands on network capacity and offer high coverage for wireless users on upcoming fifth generation (5G) networks is heterogeneous networks (HetNets), which are generated by combining the installation of macro cells with a large number of densely distributed small cells Deployment in 5G architecture has several issues because to the rising complexity of network topology in 5G HetNets with many distinct base station types. Aside from the numerous benefits that dense small cell deployment delivers, it also introduces key mobility management issues such as frequent handover (HO), failures, delays and pingpong HO. This article investigates 5G HetNet mobility management in terms of radio resource control. This article also discusses the key challenges for 5G mobility management.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1639-1649
• /
• 1998

For mobile multimedia services, wireless ATM(Asynchronous transfer Mode) network is studied actively. In wireless ATM network, the existing signaling protocols generate heavy traffics for HLR due to the centralized structure that all signaling loads mush be handled in HLR(Home Location Register). Also, centralized structure causes critical connection setup delays. Thus, it is important that wireless ATM reduces the connection setup delays occurred due to high traffic loads of signaling based on distributed processing. In this thesis, we propose a cache strategy for call delivery as well as the cache updates of registration based on ATM multicasting and compares the cost of cache scheme with that of conventional scheme. Our study shows that cache scheme has better performance than the conventional methods in the case that the portable mobility is low and traffic density is large.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.429-437
• /
• 2013

Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.75-84
• /
• 2014

In order to solve the problems such as overload, single point of failure, non-optimized data path, and network scalability in conventional central mobility management protocols, distributed mobility management schemes have been continually studied in and around the IETF. In this paper, a network-based partially-distributed mobility management mechanism, pDMMv6, is suggested and the performance comparison with traditional protocols such as PMIPv6 and MIPv6 is made through simulation under the various user traffic environment. The simulation results include UDP packet delivery ratio, end-to-end packet delay, binding delay for registration signaling, CPU utilization in each node, and response delays in several server-client TCP applications such as web browsing, e-mail, telnet remote login, FTP file up/down-load, and database access.