• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.652-659
• /
• 2006

The routing algorithm is one of the key research areas in ad hoc networks. The most of existing routing algorithms depends on current availability of wireless link when finding the feasible path. Dependence on current information may mislead to a fragile communication path. Some routing approaches that take statistical average on received signal power enhance the possibility to find the most stable path, but have limitation on considering only the average power level. In this paper, we propose routing algorithm based on link stability for ad hoc network. The proposed algorithm not only takes statistical average, but also traces the degree of variations in received signal power. The simulation result support that the proposed algorithm is more likely to find the most stable path under the severe communication environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2430-2434
• /
• 2003

This paper provides a new approach to analyze the stability of TCP Vegas, which is a kind of feedback-based congestion control algorithm. Whereas the conventional approaches use the approximately linearized model of the TCP Vegas along equilibrium points, this approach uses the exactly characterized dynamic model to get a new stability criterion via a piecewise and delay-dependent Lyapunov-Krasovskii function. Especially, the resulting stability criterion is formulated in terms of linear matrix inequalities (LMIs). Using the new criterion, this paper shows that the current TCP Vegas algorithm is stable in the sufficiently wide region of network delay and link capacity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2658-2681
• /
• 2023

In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.311-312
• /
• 2008

This paper try to show that the method for maintaining link stability by fast reporting the status PDU to RLC layer in MAC layer. The proposed method is implemented based on the mechanism of reordering processing in MAC-ehs entity in HSPA evolution system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.401-405
• /
• 1996

A new method of nonlinear robust controller synthesis is introduced which is an extension of linear mixed $H_2/H_{\infty}$ control. This method guarantees robust stability fur hard nonlinearity and uncertainty of the plant. The method is applied to the control of a flexible link of robot with Coulomb friction. Simulation shows good performances with respect to the response and the robustness.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.6
• /
• pp.9-19
• /
• 2002

An NAC(Natural Admittance Control) system design is presented for interaction controller that achieves high-performance and guarantees stability. The NAC can be classified as a particular flavor of impedance control similar to control schemes that have velocity compensator and force compensator. The NAC significantly improves the response characteristics when Coulomb friction is presented in One-link Robot System and guarantees stability when robot contacts with environment. Pragmatic rules for NAC synthesis are derived. It shows method to choose a target impedance for realizable force compensator. Important parameters are found experimentally. It is demonstrated, by the experimental result, that NAC algorithm is successful in rejecting Coulomb friction through velocity compensator and guarantees stability through force compensator. We implement an experimental set-up consisting of environment-generated one-link robot system and DSP system for controller development. We apply the natural admittance controller to the One-link robot system, and show the good performance on desired force control in case of contacting with arbitrary environment.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.7 s.178
• /
• pp.1689-1696
• /
• 2000

This paper proposes a new adaptive control scheme for flexible-link robots. A model-based nonlinear control scheme is designed based on a V-shape Lyapunov function, and then the nonlinear control i s extended to a model-based adaptive control to cope with parametric uncertainties in the dynamic model. The proposed control guarantees the global exponential or global asymptotic stability of the overall control system with all internal signals bounded. The effectiveness of the proposed control is shown by computer simulation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.76-86
• /
• 2003

We define a string stability heuristically and divide the board into group territory in computer Go. Elements of string stability are eye(E), eye-like(EL), special-eye(SE), extension-point(EX), liberty(L) and connection-point(CP). A string stability have 5 levels that are complete alive, alive, unsettled, danger and killed level. A group is made strings and link-points and have the territory. Territory division of a group is acquired by strings stability and link-points which are marym-mo, hankan, nalil-ja, and twokan between string and string. We compare our method with the result of evaluation of professional player. As a result, the mean error is 8.7.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.275-281
• /
• 2003

Random Early Detection (RED) [1] is an active queue management scheme which has been deployed extensively to reduce packet loss during congestion. Although RED can improve loss rates, its performance depends severely on the tuning of its operating parameters. The idea of adaptively varying RED parameters to suit the network conditions has been investigated in [2], where the maximum packet dropping probability $max_p$ has been varied. This paper focuses on adaptively varying the queue weight $\omega_q$ in conjunction with $max_p$ to improve the performance. We propose two algorithms viz., $\omega_q$-thresh and $\omega_q$-ewma to adaptively vary $\omega_q$. The performance is measured in terms of the packet loss percentage, link utilization and stability of the instantaneous queue length. We demonstrate that varying $\omega_q$ and $max_p$ together results in an overall improvement in loss percentage and queue stability, while maintaining the same link utilization. We also show that $max_p$ has a greater influence on loss percentage and queue stability as compared to $\omega_q$, and that varying $\omega_q$ has a positive influence on link utilization.