• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.4
• /
• pp.9-17
• /
• 2020

When IoT sensor nodes are deployed in areas where data collection is challenging, sensors must be relocated if sensing holes occur due to improper placement of sensors or energy depletion, and data collection is impossible. The sensing hole's cluster header transmits a request message for sensor relocation to an adjacent cluster header through a specific relay node. However, since a specific relay node is frequently used, a member sensor located in a specific cluster area adjacent to the sensing hole can continuously receive the movement message. In this paper, we propose a method that avoids the situation in which the sensing hole cluster header monopolizes a specific relay node and allows the cluster header to use multiple relay nodes fairly. Unlike the existing method in which the relay node immediately responds to the request of the header, the method proposed in this paper solves a ping-pong problem and a problem that the request message is concentrated on a specific relay node by applying a method of responding to the request of the header using a timer. OMNeT++ simulator was used to analyze the performance of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2111-2131
• /
• 2015

Tiered wireless sensor network is a network model of flexibility and robustness, which consists of the traditional resource-limited sensor nodes and the resource-abundant storage nodes. In such architecture, collected data from the sensor nodes are periodically submitted to the nearby storage nodes for archive purpose. When a query is requested, storage nodes also process the query and return qualified data as the result to the base station. The role of the storage nodes leads to an attack prone situation and leaves them more vulnerable in a hostile environment. If any of them is compromised, fake data may be injected into and/or qualified data may be discarded. And the base station would receive incorrect answers incurring malfunction to applications. In this paper, an efficient verifiable top-k query processing scheme called EVTQ is proposed, which is capable of verifying the authentication and completeness of the results. Collected data items with the embedded information of ordering and adjacent relationship through a hashed message authentication coding function, which serves as a validation code, are submitted from the sensor nodes to the storage nodes. Any injected or incomplete data in the returned result from a corresponded storage node is detected by the validation code at the base station. For saving communication cost, two optimized solutions that fuse and compress validation codes are presented. Experiments on communication cost show the proposed method is more efficiency than previous works.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1224-1248
• /
• 2022

In various sensor network applications, such as climate observation organizations, sensor nodes need to collect information from time to time and pass it on to the recipient of information through multiple bounces. According to field tests, this information corresponds to most of the energy use of the sensor hub. Decreasing the measurement of information transmission in sensor networks becomes an important issue.Compression sensing (CS) can reduce the amount of information delivered to the network and reduce traffic load. However, the total number of classification of information delivered using pure CS is still enormous. The hybrid technique for utilizing CS was proposed to diminish the quantity of transmissions in sensor networks.Further the energy productivity is a test task for the sensor nodes. However, in previous studies, a clustering approach using hybrid CS for a sensor network and an explanatory model was used to investigate the relationship between beam size and number of transmissions of hybrid CS technology. It uses efficient data integration techniques for large networks, but leads to clone attacks or attacks. Here, a new algorithm called SBEA (Snowball Endurance Algorithm) was proposed and tested with a bow. Thus, you can extend the battery life of your WSN by running effective copy detection. Often, multiple nodes, called observers, are selected to verify the reliability of the nodes within the network. Personal data from the source centre (e.g. personality and geographical data) is provided to the observer at the optional witness stage. The trust and reputation system is used to find the reliability of data aggregation across the cluster head and cluster nodes. It is also possible to obtain a mechanism to perform sleep and standby procedures to improve the life of the sensor node. The sniffers have been implemented to monitor the energy of the sensor nodes periodically in the sink. The proposed algorithm SBEA (Snowball Endurance Algorithm) is a combination of ERCD protocol and a combined mobility and routing algorithm that can identify the cluster head and adjacent cluster head nodes.This algorithm is used to yield the network life time and the performance of the sensor nodes can be increased.

• Interaction and multiscale mechanics
• /
• v.4 no.4
• /
• pp.257-271
• /
• 2011

The analysis of interfacial stresses in structural component has been the subject of several investigations but it still requires more effort and studies. In this study a general three-dimensional interface element has been formulated for stress and displacement analyses in the interfacial area between two adjacent plate bending element and brick element. Interface element has 16 nodes with 5 degrees of freedom (DOF) in each node adjacent to plate bending element and 3 DOF in each node adjacent to brick element. The interface element has ability to transfer three translations from each side of interface element and two rotations in the side adjacent to the plate element. Stiffness matrix of this element was formulated and implemented in three-dimensional finite element code. Application of this element to the reinforced concrete (RC) beam strengthened with fiber reinforced polymer (FRP) including variation of deflection, slip between plate and concrete, normal and shear stresses distributions in FRP plates have been verified using experimental and numerical work of strengthened RC beams carried out by some researchers. The results show that this interface element is effective and can be used for structural component with these types of interface elements.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.10
• /
• pp.2398-2406
• /
• 1993

Abdi's numerical method(ref.13) for representing a stress singularity by shifting the mid-side nodes of isoparametric elements is reviewed. A simple technique to obtain the optimal position of the mid-side nodes in quadratic isoparametric finite element is presented. From this technique we can directly obtain the position of the side-nodes adjacent to the crack tip. It is also observed that the present technique provides good accuracy for the expression of the opening displacement and the determination of the mid-side nodes for more wide range of material properties than that obtained by Abdicant the finite element method is applied to determine stress intensity factors for pressurized crack perpendicular to and terminating at the interface of two bonded dissimilar materials. A proper definition for stress intensity factors of a crack perpendicular to bimaterial interface is provided. It is based upon a near-tip displacement solutions on the crack surface for interface crack between two dissimilar materials. Numerical testing is carried out with the eight-node and six-node elements. The results obtained are compared with the previous solutions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.79-86
• /
• 2009

In this paper, we propose a new clustering scheme that provides optimal data aggregation effect and reduces energy consumption of nodes by considering the density of nodes when forming clusters. Since the size of the cluster is determined to ensure optimal data aggregation rate, our scheme reduces transmission range and minimizes interference between clusters. Moreover, by clustering using locally adjacent nodes and aggregating data received from cluster members, we reduce energy consumption of nodes. Through simulation, we confirmed that energy consumption of the whole network is minimized and the sensor network life-time is extended. Moreover, we show that the proposed clustering scheme improves the performance of network compared to previous LEACH clustering scheme.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.sup3
• /
• pp.279-285
• /
• 2016

It has been established that different kinds of bacteria agents are involved in various cancers. Although the mechanism of tumorigenesis is not clearly understood, there is evidence for the presence of bacteria within tumors, with at least a progression effect for some bacteria that prepare suitable microenvironments for tumor cell growth. The aim of current study was to evaluate bacterial dysbiosis in sentinel lymph nodes of breast cancer patients. One hundred and twenty three fresh-frozen sentinel lymph nodes and a corresponding number of normal adjacent breast tissue specimens and five normal mastectomy samples were investigated employing RT-PCR. In addition using genus-specific primers were applied. There was a significant differences as presence of Methylobacterium radiotolerance DNA recorded between patients and normal control group (p= 0.0). Based on our research work, further studies into the role of microbes in breast cancer would be of great interest.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.506-516
• /
• 2015

Wireless sensor networks (WSNs) are generally comprised of densely deployed sensor nodes, which results in highly redundant sensor data transmissions and energy waste. Since the sensor nodes depend on batteries for energy, previous studies have focused on designing energy-efficient medium access control (MAC) protocols to extend the network lifetime. However, the energy-efficient protocols induce an extra end-to-end delay, and therefore recent increase in focus on WSNs has led to timely and reliable communication protocols for mission-critical applications. In this paper, we propose an energy efficient and delay guaranteeing node scheduling scheme inspired by biological systems, which have gained considerable attention as a computing and problem solving technique.With the identification of analogies between cellular signaling systems and WSN systems, we formulate a new mathematical model that considers the networking challenges of WSNs. The proposed bio-inspired algorithm determines the state of the sensor node, as required by each application and as determined by the local environmental conditions and the states of the adjacent nodes. A control analysis shows that the proposed bio-inspired scheme guarantees the system stability by controlling the parameters of each node. Simulation results also indicate that the proposed scheme provides significant energy savings, as well as reliable delay guarantees by controlling the states of the sensor nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1363-1369
• /
• 2004

LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1436-1449
• /
• 2009

The value of sensing information is decided according to positions of sensor nodes, which are very important in sensor networks. In this paper, we propose a method that estimates positions of nodes by using adjacent node information and received signal strength in a sensor network. With the proposed method, we can find positions of nodes easily because we use information that nodes have. Moreover, we can find distribution easily for all the nodes because we can measure a relative position for a node whose position is not known based on anchor nodes whose positions are already known. We utilized Use case diagram, activity diagram and State machine diagram among several diagrams of UML to implement proposed method in sensor networks that is dynamic system. We can understand exact flow for each function of the proposed method in node position estimation system can be implemented easily. And we can be confirmed that the position of estimated nodes has a little error.