• International Journal of Computer Science & Network Security
• /
• 제22권12호
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제23권2호
• /
• pp.156-164
• /
• 2019

In this paper, we propose an efficient dynamic slot re-assignment scheme for swarming drone networks in which networks members merged and split frequently. The leader drone of each network recognizes the slot allocation information of neighbor networks by periodic information exchange among between the drones. Using the information, the leader drone makes a decision how to reallocate the slots between members in case of network merge. The non-competitive method in the proposed scheme can re-assign the slots without any slot collision and shows always superior performance than competitive scheme. The competitive method in the proposed scheme reduces the number of slots that should be re-assigned in case of network merge. The experimental performance analysis shows that the proposed scheme performs better or at least equal to the performance of the competitive scheme in a swarming drone network.

• The KIPS Transactions:PartC
• /
• 제9C권1호
• /
• pp.65-72
• /
• 2002

In this paper, we implement a high-speed swatch tilth the function for label integration to enhance the expansion of networks using the label space of routers efficiently on MPLS over ATM networks. We propose an appropriate hardware structure to support the VC-merge function and differentiated services simultaneously. In this paper, we use the adaptive congestion control method such as EPD algorithm in carte that there is a possibility of network congestion in output buffers of each core LSR. In addition, we justify the validity of the proposed VC-merge method through simulation and comparison to conventional Non VC-merge methods. The proposed VC-merge capable switch is modeled in VHDL. synthesized, and fabricated using the SAMSUNG 0.5um SOG process.

• Korean Journal of Computational Design and Engineering
• /
• 제7권2호
• /
• pp.89-95
• /
• 2002

VRML data, which is mainly structural element, is frequently used for modeling and visualizing 3D objects. Although there can be variations, it is a usual practice to represent 3D shapes in VRML format. Ever since the advent of Internet, there have been strong needs to transfer shape data through Internet. Because of this need, it is necessary to transform a data file in VRML or similar format into a more convenient form to transfer through the network. In a VRML file, a model is sometimes divided into a set of triangle meshes due to several practical reasons. However, this causes various demerits for the fast transmission. Therefore, it is more efficient to merge the mesh sets into one mesh set for the transmission. In this paper, we present the problems in the merge process and the techniques to handle the situation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제38권12호
• /
• pp.29-38
• /
• 2001

Recently, as Internet and its services grow rapidly, IETF(Internet Engineering Task Force) introduced a new switching mechanism, MPLS(Multi-Protocol Label Switching), to solve the problem of the scalability in Internet backbone. In this paper, we implemented the LSR loaded with VC-merging function, which causes LSR's management cost to be significantly reduced. We propose a new VC-merge function which supports differentiated services. In case of network congestion in the output buffer of each core LSR, appling link polices to the output modules of the LSR using the EPD algorithm can prevent the buffer from being overflowed. Simulation was performed for Diffserv by using multiple traffic models and investigated the impact of VC-merge method compared to non VC-merge method. The proposed switch is modeled in VHDL and fabricated using the SAMSUNG $0.5{\mu}m$ SOG process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.1014-1034
• /
• 2015

Location information of sensor nodes plays a critical role in many wireless sensor network (WSN) applications and protocols. Although many localization algorithms have been proposed in recent years, they usually target at dense networks and perform poorly in sparse networks. In this paper, we propose two component-based localization algorithms that can localize many more nodes in sparse networks than the state-of-the-art solution. We first develop the Basic Common nodes-based Localization Algorithm, namely BCLA, which uses both common nodes and measured distances between adjacent components to merge components. BCLA outperforms CALL, the state-of-the-art component-based localization algorithm that uses only distance measurements to merge components. In order to further improve the performance of BCLA, we further exploit the angular information among nodes to merge components, and propose the Component-based Localization with Angle and Distance information algorithm, namely CLAD. We prove the merging conditions for BCLA and CLAD, and evaluate their performance through extensive simulations. Simulations results show that, CLAD can locate more than 90 percent of nodes in a sparse network with average node degree 7.5, while CALL can locate only 78 percent of nodes in the same scenario.

• The Transactions of the Korea Information Processing Society
• /
• 제1권1호
• /
• pp.92-98
• /
• 1994

The hypercube-like interconncetion network,X-hypercubes,has the same number of nodes and edges as conventional hypercubes.By slightly changing the interconneton way between nodes,however,X-hypercubes reduces the diameter by almost half.Thus the communication delay in X-hypercubes can be expected to be much lower than that in hypercubes. This paper gives a new definition of X-hypercubes establishing clear-cut condition of connection between two nodes.As appliction examples of the new definition,this paper presents simple embeddings of hypercubes in X-hypercubes and vice versa.This means that any programs written for hypercubes can be transported onto X-hypercubes and vice versa with minimal overhead.This paper also present bitonic merge sort for X-hypercubes by simulation that for hypercubes.

• Journal of Internet Computing and Services
• /
• 제10권5호
• /
• pp.27-32
• /
• 2009

Colored thread algorithm, suggested to be used for the label switching network, needs to be modified for the packet switching network. In this paper, it is recommended to add a merged state, besides the 3 states - null, colored and transparent - which are resulted from the behaviors of extend, rewind, stall, withdraw and merge events. The original colored thread algorithm is designed to generate a new thread and extend it to the downstream direction with unknown hop count when the thread has revisited the node that was visited. It also suggested rewinding the thread to the downstream direction by the source node, instead of rewinding it upstream direction by the revisited node. If a node received multiple threads which had a same forward equivalent class, then it checks first whether the hop counts are ascending or not. If it is in ascending order, then threads are merged. Otherwise the later thread is stalled until the former thread's color is to be changed to transparent or it is removed. This idea removes the effort of generating a new thread with unknown hop count.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제37권8B호
• /
• pp.647-656
• /
• 2012

TDMA MAC protocol in MANET requires precise network synchronization between nodes though network topology changes continuously due to node mobility and the effect of propagation environment. In this paper we propose in-band cross-layer network synchronization architecture for TDMA-based MANETs. In the proposed architecture TDMA MAC protocol and proactive routing protocol cooperate closely to rapidly detect network partition and merge caused by node mobility and to precisely maintain network synchronization. We also implement the proposed synchronization architecture in OPNET simulator and evaluate the performance of it in various simulation scenarios. Simulation results show that our architecture stably maintains network time synchronization in both network partition and merge situations.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1171-1174
• /
• 1993

A promising approach to get the benefits of neural networks and fuzzy logic is to combine them into an integrated system to merge the computational power of neural networks and the representation and reasoning properties of fuzzy logic. In this context, this paper presents a fuzzy neural network which is able to code fuzzy knowledge in the form of it-then rules in its structure. The network also provides an efficient structure not only to code knowledge, but also to support fuzzy reasoning and information processing. A learning scheme is also derived for a class of membership functions.