• Structural Engineering and Mechanics
• /
• v.50 no.5
• /
• pp.665-677
• /
• 2014

A numerical method, using a special mixed finite element associated with the virtual crack extension technique, has been developed to evaluate the energy release rate for kinking cracks. The element is two dimensional 7-node mixed finite element with 5 displacement nodes and 2 stress nodes. The mixed finite element ensures the continuity of stress and displacement vectors on the coherent part and the free edge effect. This element has been formulated starting from a parent element in a natural plane with the aim to model different types of cracks with various orientations. Example problems with kinking cracks in a homogeneous material and bimaterial are presented to assess the computational accuracies.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.706-709
• /
• 2008

With the increasing popularity of P2P file sharing and advancement of mobile technologies, mobile P2P has revealed its attraction. Anonymity has become an increasing requirement in mobile networks. To reduce receiving garbage files, file validation and filtering are other requirements in the mobile P2P environment. If there are effective file filtering and validation mechanism, nodes' battery duration will be saved. In this paper, we do an analysis of security and anonymity in P2P file sharing and exchange system in mobile ad hoc environment, and propose a new efficient anonymous protocol, which can provide anonymity by broadcasting with a probabilistic algorithm and hiding real hop count information, the file validation by the file's special hash value and file filtering mechanism through the collaboration of middle nodes.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.7
• /
• pp.217-224
• /
• 2022

Today, with the development of technology and industry, fire accidents in special buildings are increasing as special buildings increase. However, despite the rapid development of information and communication technology, human casualties are steadily occurring due to the underdeveloped and ineffective indoor fire alarm system. In this study, we confirmed that the existing indoor fire alarm system using acoustic alarm could not deliver a sufficiently large alarm to the in-room personnel. To improve this, we designed and implemented a fire alarm system using edge computing and beacons. The proposed improved fire alarm system consists of terminal sensor nodes, edge nodes, a user application, and a server. The terminal sensor nodes collect indoor environment data and send it to the edge node, and the edge node monitors whether a fire occurs through the transmitted sensor value. In addition, the edge node continuously generate beacon signals to collect information of smart devices with user applications installed within the signal range, store them in a server database, and send application push-type fire alarms to all in-room personnel based on the collected user information. As a result of conducting a signal valid range measurement experiment in a university building with dense lecture rooms, it was confirmed that device information was normally collected within the beacon signal range of the edge node and a fire alarm was quickly sent to specific users. Through this, it was confirmed that the "blind spot problem of the alarm" was solved by flexibly collecting information of visitors that changes time to time and sending the alarm to a smart device very adjacent to the people. In addition, through the analysis of the experimental results, a plan to effectively apply the proposed fire alarm system according to the characteristics of the indoor space was proposed.

• Journal of information and communication convergence engineering
• /
• v.10 no.2
• /
• pp.129-134
• /
• 2012

As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.740-745
• /
• 2003

The so-called boundary node method (or NDIF method) that was developed by the authors has been extended for free vibration analysis of arbitrarily shaped plates with free edges. Since the proposed method is based on the collocation method, no integration procedure is needed on boundary edges of the plates and only a small amount of numerical calculation is required. A special coordinate transformation has been devised to consider the complicated free boundary conditions at boundary nodes. By the use of the special coordinate transformation, the radius of curvature involved in the free boundary conditions can be successfully dealt with. Finally, verification examples show that natural frequencies obtained by the present method agree well with those given by exact method and other analytical methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3738-3750
• /
• 2015

Sybil attack is a special kind of attack which is difficult to be detected in Wireless Sensor Network (WSN). So a lightweight detection mechanism based on LEACH-RSSI-ID (LRD) is proposed in this paper. Due to the characteristic of Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, none of nodes can be the cluster head forever.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.331-340
• /
• 2008

In order to make load balancing, workload information of nodes should be informed to the network. In a load balancing algorithm[13] based on the SBIBD(Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with O (${\upsilon}{\sqrt{\upsilon}}$) traffic overhead, where ${\upsilon}$ is the number of nodes. It is very efficient but works well only when ${\upsilon}=p^2+p+1$ for a prime number p. In this paper, we generate a special incidence structure in order for the algorithm works well for an arbitrary number of nodes. In the experiment with w,($5{\leq}w{\leq}5,000$), nodes and more than 80% of receiving workload information, traffic overhead was less than O ($w{\sqrt{w}})$ and the result for standard deviation of traffic overhead showed that each node has largely balanced amount of traffic overhead.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.621-628
• /
• 2009

Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the networks that have a huge number of nodes. This paper first proposes a distributed algorithm called DBND (Distributed Bottleneck Node detection) that can reduce the time for location information collection, lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions of how to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.8
• /
• pp.750-757
• /
• 2011

Wireless Sensor Network is composed of a lot of sensor nodes that are densely deployed in a field. So generally this sensor nodes are spreaded using Helicopter or Fixed wing. Each node delivers own location and acquired information to user when it detects specific events. In this paper, we propose localization algorithm without range information in wireless sensor network using helicopter. Helicopter broadcasts periodically beacon signal for sensor nodes. Sensor nodes stored own memory this beacon signal until to find another beacon point(satisfied special condition). This paper develops a localization mechanism using the geometry conjecture(perpendicular bisector of a chord) to know own location. And the simulation results demonstrate that our localization scheme outperforms Centroid, APIT in terms of a higher location accuracy.