• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.529-537
• /
• 2008

AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.659-663
• /
• 1997

In this paper, a simplified vibration analysis model for bellows was presented to avoid excessive effort required for shell model. To reduce degree of freedom, bellows was modelled using one dimensional beam element. The equivalent mass and stiffness matrices were obtained based upon Guyan reduction process. The results were compared with the confirmed results, which were in good agreement.

• Journal of Korean Association for Spatial Structures
• /
• v.4 no.4 s.14
• /
• pp.85-89
• /
• 2004

A frame element embedded normal to a shear wall or slab (shell element) is common in the structural systems. In that case there is a need for a membrane or shell element to have a normal rotation degree of freedom at each node in order to have a good result of stresses. Even if Many other people studied this area, All man, Cook and Sabir are representative investigators in this area. In this research paper, Sabir's methods of vertex rotation stiffness matrix in a membrane element are studied. New stiffness of vertex rotation are proposed by taking advantage of beam stiffness theory. Rectangular elements stiffness with rotational degree of freedom are compared in accuracy ratio each other.

• Journal of Ocean Engineering and Technology
• /
• v.12 no.2 s.28
• /
• pp.1-21
• /
• 1998

In this paper, a non-conforming 3-D 8-node solid element(MQM10) has beets applied to the analyses of static and dynamic bending problems of laminated composite plates The QM10 element exhibits stiffer bending stiffness which is caused by the reduction of degree of freedom from Q11 element. As an effective way to correct the relative stiffness stiffening phenomenon the modification of Gauss sampling points for composite plates is proposed. The quantity of modification is a function of material properties. Also, another two modified equations are obtained, one is modification for stress, and the other is modification of coefficient of shear modulus in free vibration. It is noted that MQM10 element can analyse the static and free vibration problems of various 3-dimensional composite plates composed of unidirectional laminae, woven laminae or braided laminae. The results of MQM10 element are in good agreement with those of 20-node element.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2627-2647
• /
• 2022

The easy scalability and low cost of range-free localization algorithms have led to their wide attention and application in node localization of wireless sensor networks. However, the existing range-free localization algorithms still have problems, such as large cumulative errors and poor localization performance. To solve these problems, an incremental strategy-based residual regression network is proposed for node localization in wireless sensor networks. The algorithm predicts the coordinates of the nodes to be solved by building a deep learning model and fine-tunes the prediction results by regression based on the intersection of the communication range between the predicted and real coordinates and the loss function, which improves the localization performance of the algorithm. Moreover, a correction scheme is proposed to correct the augmented data in the incremental strategy, which reduces the cumulative error generated during the algorithm localization. The analysis through simulation experiments demonstrates that our proposed algorithm has strong robustness and has obvious advantages in localization performance compared with other algorithms.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.81-91
• /
• 2014

This paper proposes hidden-node aware grouping (HAG) algorithm to enhance the performance of institute of electrical and electronics engineers (IEEE) 802.15.4 networks when they undergo either severe collisions or frequent interferences by hidden nodes. According to the degree of measured collisions and interferences, HAG algorithm dynamically transforms IEEE 802.15.4 protocol between a contention algorithm and a contention-limited one. As a way to reduce the degree of contentions, it organizes nodes into some number of groups and assigns each group an exclusive per-group time slot during which only its member nodes compete to grab the channel. To eliminate harmful disruptions by hidden nodes, especially, it identifies hidden nodes by analyzing the received signal powers that each node reports and then places them into distinct groups. For load balancing, finally it flexibly adapts each per-group time according to the periodic average collision rate of each group. This paper also extends a conventional Markov chain model of IEEE 802.15.4 by including the deferment technique and a traffic source to more accurately evaluate the throughput of HAG algorithm under both saturated and unsaturated environments. This mathematical model and corresponding simulations predict with 6%discrepancy that HAG algorithm can improve the performance of the legacy IEEE 802.15.4 protocol, for example, even by 95% in a network that contains two hidden nodes, resulting in creation of three groups.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1696-1702
• /
• 2008

A MANET(Mobile Ad-hoc Network) is a multi-hop routing protocol formed by a collection without the intervention of infrastructure. So the MANET also depended on the property as like variable energy, high degree of mobility, location environments of nodes etc. Generally the various clustering technique and routing algorithm would have proposed for improving the energy efficiency. One of the popular approach methods is a cluster-based routing algorithm using in MANET. In this paper, we propose an algorithm techniques which is TICC (Time Interval Clustering Control) based on energy value in property of each node for solving cluster problem. It provides improving cluster energy efficiency how can being node manage to order each node's energy level. TICC could be able to manage the clustering, re-configuration, maintenance and detection of Node in MANET. Furthermore, the results of modeling shown that Node's energy efficiency and lifetime are improved in MANET.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.27 no.2
• /
• pp.38-46
• /
• 1985

The reinforced concrete farm silos on the elastic foundatin are widely used in agricultural engineering because of their superior structural performance, economy and attractive appearance. Various methods for the analysis and design of farm silo, such as the analytical method, the finite difference method, and the finite element methods, can be used. But the analytical procedure can not be applied for the intricate conditions in practice. Therefore lately the finite element method has been become in the structural mechanics. In this paper, a method of finite element analysis for the cylindrical farm silo on ffness matrix for the elastic foundation governed by winkler's assumption. A complete computer programs have been developed in this paper can be applicable not only to the shell structures on elastic foundation but also to the arbitrary three dimensional structures. Assuming the small deflection theory, the membrane and plate bending behaviours of flat plate element can be assumed mutually uncoupled. In this case, the element has 5 degrees of freedom per node when defined in the local coordinate system. However, when the element properties are transformed to the global coordinates for assembly, the 6th degree of freedom should be considered. A problem arises in this procedure the resultant stiffness in the 6th degree of freedom at this node will be zero. But this singularity of the stiffness matrix can be eliminated easily by merely replacing the zero diagonal by dummy stiffness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.