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

A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.537-538
• /
• 2009

IPv6 is newly introduced to solve limitations and problems of IPv4 and in IPv6 network, nodes use Neighbor Discovery protocol to discover the subnet prefix and configure its own address. However, Neighbor Discovery is vulnerable to various attacks as it does not have secure mechanism to protect itself. Thus, the Secure Neighbor Discovery has introduced and the main mechanism used in Secure Neighbor Discovery is Cryptographically Generated Address. In this paper, we provide a brief of Cryptographically Generated Address and its limitation in a case where a mobile node moves from one network to another frequently. The proposed scheme resolves this limitation by using the fixed interface identifier.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.541-542
• /
• 2021

In this paper, we consider the straggled network treatment in multiple sensor groups. During the moving or the implement of mission, the departed network should be handled. The loss of network group affects the mission implement of overall sensor networks, and it also requests the immediate treatment. In urgent mission environments, the network management of mobile sink should be considered to the group damage.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.487-489
• /
• 2016

In this paper, quad copter provides a method for preventing the possibility of accident in the air during a formation flight. The existing studies had a few studies upon the falls because quad copter formation flight was generally implemented indoors. Therefore, in this paper, we provide a self-diagnosis system to prevent a secondary accident for mismatching the Proportional-Integral-Derivative(PID) and detecting an abnormal communication modules each others in formation flying system. Scheme to be proposed, a system is that when one of the node meets a problem, the header node is sending the information of the current state to the server in the first and making a diagnosis itself in order to avoid the problems caused by dropping from the air. Therefore, if the difference between PID value of header node and slave node is greater than specified values or if it detects a defective sensors and communication modules, the proposed system is set to provide for moving toward a safe place. As a result, we expect that this proposed system is possible to minimize additional incidents by self adjusting the height through a self-diagnosis discovering flawed the acceleration sensor, gyro sensor and various attached sensors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.33-43
• /
• 2010

Recently, users want to use real-time multimedia services, such as internet, VoIP, etc., using their IEEE 802.11 wireless lan mobile stations. In order to provide such services, a handoff among access points is essential to support the mobility of a node, in such an wide area. However, the legacy handoff methods of IEEE 802.11 technology are easy to lose connections. Also, the recognition of a disconnection and channel re-searching time make the major delay of the next AP to connect. In addition, because IEEE 802.11 decides the selection of an AP depending only on received signal strength, regardless of a node direction, position, etc., it cannot guarantee a stable bandwidth for communication. Therefore, in order to provide a real-time multimedia service, a node must reduce the disconnection time and needs an appropriate algorithm to support a sufficient communication bandwidth. In this paper, we suggest an algorithm which predicts a handoff point of a moving node by using GPS location information, and guarantees a high transmission bandwidth according to the signal strength and the distance. We implemented the suggested algorithm, and confirmed the superiority of our algorithm by reducing around 3.7ms of the layer-2 disconnection time, and guaranteed 24.8% of the communication bandwidth.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.75-89
• /
• 2006

LBS (Location-Based Service) systems have become a serious subject for research and development since recent rapid advances in wireless communication technologies and position measurement technologies such as global positioning system. The architecture named the GALIS (Gracefully Aging Location Information System) has been suggested which is a cluster-based distributed computing system architecture to overcome performance losses and to efficiently handle a large volume of data, at least millions. The GALIS consists of SLDS and LLDS. The SLDS manages current location information of moving objects and the LLDS manages past location information of moving objects. In this thesis, we implement a monitoring technique for the GALIS prototype, to allow dynamic load balancing among multiple computing nodes by keeping track of the load of each node in real-time during the location data management and spatio-temporal query processing. We also propose a buffering technique which efficiently manages the query results having overlapped query regions to improve query processing performance of the GALIS. The proposed scheme reduces query processing time by eliminating unnecessary query execution on the overlapped regions with the previous queries.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3672-3679
• /
• 2012

Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

• Journal of the Korean Magnetics Society
• /
• v.21 no.6
• /
• pp.219-224
• /
• 2011

The motion features of sanals inside of the primo vascular system (PVS), that is so-called the Kyungrak system, are investigated under a low static magnetic field by using the anatomy technology and optical microscope. The sanals with a size of about 1 selected and separated from the primo vessel and node of the real PVS inside of the surface of the internal organs are observed from rabbits' abdominal wall and dipped with PBS liquid inside of petri dish. The sanal's moving velocity along the direction of magnetic field (xdirection) and perpendicular to the direction of magnetic field (y-direction) under the low magnetic field of 0 Oe, 20 Oe, 40 Oe, 60 Oe, and 80 Oe, respectively, is observed below a internal temperature of $38^{\circ}C$. Ten sanals' moving velocities versus magnetic field are shown two differently dominant tendencies with an average velocity of 0.9 pixel/s and a random velocity according to the x-direction and y-direction, respectively. This experimental results imply that the rotating motion of sanal with nuclei DNA composed of many inorganic magnetic materials of Mn and Co is monotonically weakened by the increase of applied magnetic field.