• Structural Engineering and Mechanics
• /
• v.62 no.1
• /
• pp.11-20
• /
• 2017

The base force element method (BFEM) is a new finite element method. In this paper, a degenerated 4-mid-node plane element from concave polygonal element of BFEM was proposed. The performance of this quadrilateral element with 4 mid-edge nodes in the BFEM on complementary energy principle is studied. Four examples of linear elastic analysis for plane frame structure are presented. The influence of aspect ratio of the element is analyzed. The feasibility of the 4 mid-edge node element model of BFEM on complementary energy principles researched for plane frame problems. The results using the BFEM are compared with corresponding analytical solutions and those obtained from the standard displacement finite element method. It is revealed that the BFEM has better performance compared to the displacement model in the case of large aspect ratio.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.311-319
• /
• 2016

In this paper, we analyze the spectrum-sensing performance of a cooperative cognitive radio (CR) network consisting of a number of CR nodes and a fusion center (FC). We introduce the "log-average-SNR ratio" that relates the average SNR of the CR-node-FC link and that of the primary-user-CR-node link. Assuming that the FC utilizes the K-out-of-N rule as its decision rule, we derive exact expressions for the sensing gain and the coding gain - parameters used to characterize the CR network performance at the high SNR region. Based on these results, we determine ways to optimize the performance of the CR network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.66-71
• /
• 2012

The capacity criteria have been proposed in order to select a cooperative relay node in WSNs, under the environment where direct path has a poor link gain. This process may ensure the efficiency improvement of signal transfer between source and destination and reduction of energy consumption as well. Two criteria are incorporated to select a cooperative relay node. Firstly, calculate the energy gain ratio between the relay path and the direct path. These are defined as the ratio between the energy factors of 1/g and 1/B. Each stands for an inverse of direct path gain and relay path gain. Secondly, investigate the effects of relay node's usage in WSNs through the simulation in terms of energy consumption. In conclusion, using a selected cooperative relay node based on the selected criteria is effective in terms of both energy efficiency and capacity of WSNs especially when direct path gain is relatively low.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.234-244
• /
• 2003

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced block to the idel node on cache replacement in order to maintain the replaced block in the cache field. However the wrong approximate information deteriorates the performance, the concistency maintenance goes to great expense to exchange messeges and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintance cost for consistency and the management cost for cache Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.71-80
• /
• 2004

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced buffer to the idle node on buffers replacement in order to maintain the replaced cache in the cache field. However the wrong approximate information deteriorates the performance, the consistency maintenance goes to great expense to exchange messages and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintenance cost for consistency and the management cost for buffer Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.673-684
• /
• 2007

In this paper, we introduce an FARNS (Flooding algorithm with Adaptive Retransmission Nodes Selection). It is an efficient cross layer-based flooding technique to solve broadcast storm problem that is produced by simple flooding of nodes in wireless sensor network. FARNS can decrease waste of unnecessary energy by preventing retransmission action of whole network node by deciding retransmission candidate nodes that are selected by identification in MAC and distance with neighborhood node through received signal strength information in PHY. In simulation part, we show the results that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, number of redundancy packets and overhead. And FARNS can adjust of node ratio for retransmission operation, it can solve broadcast storm problem as well as meet the requirements of various network environments.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.69-77
• /
• 2015

MANET is composed of only the mobile nodes have a limited transmission range. The dynamic topology by the frequent movement of nodes makes routing difficult and is also cause exposed to security vulnerabilities. In this paper, we propose the security routing technique consisted of mechanism of two steps in order to respond effectively to attack by the modification of the routing information and transmit secure data. The hierarchical structure is used and the authentication node that issues the key of the nodes within each cluster is elected in this proposed method. The authentication node manages key issues and issued information for encrypting the routing information from the source node. The reliability value for each node is managed to routing trust table in order to secure data transmission. In the first step, the route discovery is performed using this after the routing information is encrypted using the key issued by the authentication node. In the second step, the average reliability value of the node in the found path is calculated. And the safety of the data transmission is improved after the average reliability value selects the highest path. The improved performance of the proposed method in this paper was confirmed through comparative experiments with CBSR and SEER. It was confirmed a better performance in the transmission delay, the amount of the control packet, and the packet transmission success ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5928-5947
• /
• 2019

Multicast Mesh based Mobile Ad-hoc NETworks (MANETs) provide efficient data transmission in energy restraint areas without a fixed infrastructure. In this paper, the authors present an improved version of protocol SLIMMER developed by them earlier, and name it SLIMMER-SN. Most mesh-based protocols suffer from redundancy; however, the proposed protocol controls redundancy through the concept of forwarding nodes. The proposed protocol uses remaining energy of a node to decide its energy efficiency. For measuring stability, a new metric called Stability of Node (SN) has been introduced which depends on transmission range, node density and node velocity. For data transfer, a weighted cost function selects the most energy efficient nodes / most stable nodes or a weighted combination of both. This makes the node selection criteria more dynamic. The protocol works in two steps: (1) calculating SN and (2) using SN value in the weighted cost function for selection of nodes. The study compared the proposed protocol, with other mesh-based protocols PUMA and SLIMMER, based on packet delivery ratio (PDR), throughput, end-to-end delay and average energy consumption under different simulation conditions. Results clearly demonstrate that SLIMMER-SN outperformed both PUMA and SLIMMER.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.945-950
• /
• 2002

In this paper the performance evaluations on Asynchronous Transfer Mode(ATM) access node are performed in the ATM access network which consists of access node and channel. The performance factors of access node are Cell Loss Ratio(CLR), buffer capacity and delay time. Both the ATM cell-scale queueing model and burst-scale queueing model are considered as the traffic model of access node for various traffic types such as Constant Bit Rate(CBR), Variable Bit Rate(VBR) and random traffic in the ATM access networks. Based on these situations, the relation of CLR, buffer capacity and delay time is analyzed in the ATM access node.

• 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.