• Journal of Integrative Natural Science
• /
• v.1 no.3
• /
• pp.210-215
• /
• 2008

Ad hoc network는 무선 노드들의 집합으로서 어떤 인프라스트럭처 도움 없이 그들 서로가 multi-hop 경로를 통해 통신한다. 본 논문에서는 ad hoc network에서 사용되는 proactive 라우팅 프로토콜과 on-demand 라우팅 프로토콜의 혼합인 hybrid 라우팅 프로토콜에 대해 제안하였다. 본 논문에서는 기존의 hybrid 라우팅 프로토콜인 ZRP와는 달리 Ad hoc network를 구성하는 노드들 중에 네트워크 서비스를 제공해주는 특별한 노드를 설정하여 라우팅 하는 방법을 제안한다. 이러한 역할을 해주는 특별한 노드를 본 논문에서는 C-Node라 부른다. C-Node를 이용한 라우팅으로 기존의 라우팅 프로토콜보다 경로 설정 시간과 flooding 시간을 줄이므로서 효율적인 라우팅을 수행할 수 있게된다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.5
• /
• pp.1-15
• /
• 1993

In DQDB networks, the bandwidth can be increased considerably be using the EN(Erasure Node) algorithms and DR(Destination Release) algorithms. However, the important issue in implementing them is using method of extra capacity fairly. To improve it, this paper proposes AEN(Adaptive Erasure Node) algorithm which erasure function is activated by network traffic load. Its functional architecture consists of SESM, RCSM, LMSM in addition to the basic DQDB state machines (DQSM, RQM). The SESM and RCSM state machines are placed in front of the DQSM and RQM state machines in order for the node to take advantage of the newly cleared slots. This paper also presents some simulation results showing the effect of AEN algorithm on access delay, throughput and segment erasing ratio in the single and multiple priority networks. The results show that the AEN algorithm offer the better performance characteristics than existing algorithms under overload conditions.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.193-198
• /
• 2004

This paper describes an automatic finite element (FE) mesh generation for three-dimensional structures consisting of tree-form surfaces. This mesh generation process consists of three subprocesses: (a) definition of geometric model, (b) generation of nodes, and (c) generation of elements. One of commercial solid modelers is employed for three-dimensional solid structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Voronoi diagram method is introduced as a basic tool for element generation. Automatic generation of FE meshes for three-dimensional solid structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for three-dimensional complex geometry.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.343-348
• /
• 2005

This paper describes an automatic finite element (FE) mesh generation for three-dimensional structures consisting of free-form surfaces. This mesh generation process consists of three subprocesses: (a) definition of geometric model, i.e. analysis model, (b) generation of nodes, and (c) generation of elements. One of commercial solid modelers is employed for three-dimensional solid structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay method is introduced as a basic tool for element generation. Automatic generation of FE meshes for three-dimensional solid structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for three-dimensional complex geometry.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.139-142
• /
• 2005

This paper describes an automatic finite element (FE) mesh generation for three-dimensional structures consisting of free-form surfaces. This mesh generation process consists of three subprocesses: (a) definition of geometric model, i.e. analysis model, (b) generation of nodes, and (c) generation of elements. One of commercial sol id modelers is employed for three-dimensional sol id structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well control led by the fuzzy knowledge processing. The Delaunay method is introduced as a basic tool for element generation. Automatic generation of FE meshes for three-dimensional sol id structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for three-dimensional complex geometry.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.1
• /
• pp.58-63
• /
• 2006

This paper describes a novel automated analysis system for bellows of piping system. An automatic finite element (FE) mesh generation technique, which is based on the fuzzy theory and computational geometry technique, is incorporated into the system, together with one of commercial FE analysis codes and one of commercial solid modelers. In this system, a geometric model, i.e. an analysis model, is first defined using a commercial solid modelers for 3-D shell structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation technique is introduced as a basic tool for element generation. The triangular elements are converted to quadrilateral elements. Practical performances of the present system are demonstrated through several analysis for bellows of piping system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3041-3063
• /
• 2018

Community search aims at finding a meaningful community that contains the query node and also maximizes (minimizes) a goodness metric. This problem has recently drawn intense research interest. However, most metric-based algorithms tend to include irrelevant subgraphs in the identified community. Apart from the user-defined metric algorithm, how can we search the natural community that the query node belongs to? In this paper, we propose a novel community search algorithm based on the concept of the k-hop and local distance dynamics model, which can naturally capture a community that contains the query node. The basic idea is to envision the nodes that k-hop away from the query node as an adaptive local dynamical system, where each node only interacts with its local topological structure. Relying on a proposed local distance dynamics model, the distances among nodes change over time, where the nodes sharing the same community with the query node tend to gradually move together, while other nodes stay far away from each other. Such interplay eventually leads to a steady distribution of distances, and a meaningful community is naturally found. Extensive experiments show that our community search algorithm has good performance relative to several state-of-the-art algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4971-4987
• /
• 2019

Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.169-178
• /
• 2023

Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.