• Journal of Drive and Control
• /
• v.20 no.4
• /
• pp.9-16
• /
• 2023

This paper analyzed a drainage tower used to drain water in flooded areas. Multi-body dynamics simulation was used to analyze the dynamic behavior of the drainage tower. Structural analysis, flexible-body dynamic analysis, and rigid body dynamic analysis were done to study the maximum Von-Mises stress of the drainage tower. The results showed that the maximum Von-Mises stress occurs at the turn table, and it decreases when the angle of the boom is increased. Also, the rate of the change of angle affects the maximum stress so that the maximum stress changes more when the angular velocity of the boom increases. Based on the rigid body dynamic analysis and the theoretical analysis results, the centrifugal force from the angular velocity makes the difference in the maximum stress at the turn table because of the difference in their direction. Consequently, it was concluded that the centrifugal force should be considered when designing construction machinerythat can rotate.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.4
• /
• pp.82-88
• /
• 2012

A VANET (Vehicular Ad Hoc Network), a subclass of MANET (Mobile Ad Hoc Network), is an ad hoc network using wireless communication between vehicles without fixed infrastructure such as base station. VANET suffers a frequent link breakage and network topology change because of the rapid movement of vehicles and the density change of vehicles. From these characteristics of VANET, geographical routing protocols such as GPSR (Greedy Perimeter Stateless Routing) using only the information of neighbor nodes are more suitable rather than AODV and DSR that are used in existing MANETs. However, GPSR may have a transmission delay and packet loss by frequent link disconnection and continual local maxima under the low vehicle density conditions. Therefore, in this paper, we propose a DTVR (Delay Tolerant Vehicular Routing) algorithm that perform a DTN-based routing scheme if there is no 2-hop neighbor nodes for efficient routing under the low vehicle densities in VANETs. Simulation results using ns-2 reveal that the proposed DTVR protocol performs much better performance than the existing routing protocols.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.131-138
• /
• 2008

Mobile Ad hoc NETworks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad hoc networks. In this paper, an enhanced routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance named as LRC (Local Route Change) is presented. If the node movement is detected, the routing agent switches path to its neighbor node in LRC. Simulation results show that the performance of the proposed routing scheme is superior to previous AODY protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1167-1176
• /
• 2014

In this paper, a relay communication scheme for enhancing the WiMedia network performance by device's mobility is proposed. WiMedia protocol is suitable for the application that supports the real-time multimedia service in Ship Area Network since it supports high speed data transfer. However, the device's mobility is caused the dramatic change of link state and network topology, and is occurred the degradation of network performance. Therefore, a relay communication scheme for WiMedia network is proposed in this paper. The proposed technique can intelligently treat the change of link state, and solve the degradation of network performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1159-1166
• /
• 2014

In this paper, a resource management scheme for enhancing the network connectivity and reliability in wireless USB system is proposed. Wireless USB protocol is suitable for the application that supports the real-time multimedia service in Ship Area Network since it supports high speed data transfer. However, the device's mobility is caused the dramatic change of link state and network topology, and is occurred the degradation of network performance. Therefore, a resource management scheme for wireless USB system is proposed in this paper. The proposed technique can intelligently treat the change of link state, and solve the degradation of network performance. The simulation results show that proposed protocol can enhance the throughput and delay performance by selecting relay device with better link state.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.131-136
• /
• 2007

Ad hoc networks enable efficient resource aggregation in decentralized manner, and are inherently scalable and fault-tolerant since they do not depend on any centralized authority. However, lack of a centralized authority prompts many security-related challenges. Moreover, the dynamic topology change in which network nodes frequently join and leave adds a further complication in designing effective and efficient security mechanism. Security services for ad hoc networks need to be provided in a scalable and fault-tolerant manner while allowing for membership change of network nodes. In this paper, we investigate distributed certification mechanisms using a threshold cryptography in a way that the functions of a CA(Certification Authority) are distributed into the network nodes themselves and certain number of nodes jointly issue public key certificates to future joining nodes. In the process, we summarize one interesting report [5] in which the recently proposed RSA-based ad hoc signature scheme, called URSA, contains unfortunate yet serious security flaws. We then propose new scheme by fixing their security flaws.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.40 no.3
• /
• pp.227-237
• /
• 2022

The most critical factors for detecting changes in very high-resolution satellite images are building positional inconsistencies and relief displacements caused by satellite side-view. To resolve the above problems, additional processing using a digital elevation model and deep learning approach have been proposed. Unfortunately, these approaches are not sufficiently effective in solving these problems. This study proposed a change detection method that considers both positional and topology information of buildings. Mask R-CNN (Region-based Convolutional Neural Network) was trained on a SpaceNet building detection v2 dataset, and the central points of each building were extracted as building nodes. Then, triangulated irregular network graphs were created on building nodes from temporal images. To extract the area, where there is a structural difference between two graphs, a change index reflecting the similarity of the graphs and differences in the location of building nodes was proposed. Finally, newly changed or deleted buildings were detected by comparing the two graphs. Three pairs of test sites were selected to evaluate the proposed method's effectiveness, and the results showed that changed buildings were detected in the case of side-view satellite images with building positional inconsistencies.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.147-154
• /
• 2007

Network topology in ad hoc networks keeps changing because of node mobility and no limitation in number of nodes. Therefore, the scalability of routing protocol is of great importance, However, table driven protocols such as DSDV have been known to be suitable for relatively small number of nodes and low node mobility, Various protocols like FSR, OLSR, and PCDV have been proposed to resolve scalability problem but vet remain to be proven for their comparative superiority for scalability, In this paper, we compare and amine them by employing various network deployment scenarios as follows: network dimension increase's while keeping node density constant node density increases while keeping network dimension fixed, and the number of sessions increase with the network dimension and the number of nodes fixed. the DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, The FSR's performance decreased according to the increase of overhead corresponding to increasing number of nodes, The OLSR with the shortest convergence time among them shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.53-61
• /
• 2008

Consider a typical wireless sensor network in which stem nodes form the backbone network of mesh topology while each stem node together with leaf nodes in its vicinity forms a subnetwork of star topology. In such a wireless sensor network, we must heed the following when we design a MAC scheme supporting the packet delivery from a leaf node to a stem node. First, leaf nodes are usually battery-powered and it is difficult to change or recharge their batteries. Secondly, a wireless sensor network is often deployed to collect and update data periodically. Late delivery of a data segment by a sensor node causes the sink node to defer data processing and the data segment itself to be obsolete. Thirdly, extensive signaling is extremely limited and complex computation is hardly supported. Taking account of these facts, a MAC scheme must be able to save energy and support timeliness in packet delivery while being simple and robust as well. In this paper, we propose a version of ALOHA as a MAC scheme for a wireless sensor network. While conserving the simplicity and robustness of the original version of ALOHA, the proposed version of ALOHA possesses a distinctive feature that a sensor node decides between stop and continuation prior to each delivery attempt for a packet. Such a decision needs a stopping rule and we suggest a Bayes stopping rule. Note that a Bayes stopping rule minimizes the Bayes risk which reflects the energy, timeliness and throughput losses. Also, a Bayes stopping rule is practical since a sensor node makes a decision only using its own history of delivery attempt results and the prior information about the failure in delivery attempt. Numerical examples confirm that the proposed version of ALOHA employing a Bayes stopping rule is a useful MAC scheme in the severe environment of wireless sensor network.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.8
• /
• pp.191-200
• /
• 2019

In an Ad-hoc network, a method of time synchronizing all the nodes in a network centering on one reference node can be used. A representative algorithm based on a reference node is Flooding Time Synchronization Protocol (FTSP). In the process of sending and receiving messages, predictable and unpredictable delays occur, which should be removed because it hinders accurate time synchronization. In multi-hop communications, hop delays occur when a packet traverses a number of hops. These hop delays significantly degrade the synchronization performance among nodes. Therefore, we need to find a method to reduce these hop delays and increase synchronization performance. In the FTSP scheme, hop delays can be greatly increased depending on the position of a reference node. In addition, in FTSP, a node with the smallest node ID is elected as a reference node, hence, the position of a reference node is actually arbitrarily determined. In this paper, we propose an optimal reference node election algorithm to reduce hop delays, and compare the performance of the proposed scheme with FTSP using the network simulator OPNET. In addition, we verify that the proposed scheme has an improved synchronization performance, which is robust to topology changes.