• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.387-390
• /
• 2009

Wireless Sensor Network (WSN) can easily compromised from attackers because it has the limited resource and deployed in exposed environments. When the sensitive packets are occurred such as enemy's movement or fire alarm, attackers can selectively drop them using a compromised node. It brings the isolation between the basestation and the sensor fields. To detect selective forwarding attack, Xiao, Yu and Gao proposed checkpoint-based multi-hop acknowledgement scheme (CHEMAS). The check-point nodes are used to detect the area which generating selective forwarding attacks. However, CHEMAS has static probability of selecting check-point nodes. It cannot achieve the flexibility to coordinate between the detection ability and the energy consumption. In this paper, we propose the control method for the number fo check-point nodes. Through the control method, we can achieve the flexibility which can provide the sufficient detection ability while conserving the energy consumption.

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

The development of USN(Ubiquitous Sensor Network) technology is creating numerous application areas. Although a network configuration with fixed sensors was the norm in the past, the coexistence of mobile and fixed sensor nodes is a new trend. Fixed sensor networks focused on the energy efficiency of nodes, but the latest studies consider guaranteeing the mobility of nodes and maintaining their connectivity, while remaining energy efficient at the same time. This paper proposes a routing protocol for a mobile ad-hoc sensor network that improves the mobility, connectivity and energy efficiency of nodes while allowing for the management and maintenance of a large number of nodes even in a complex communication environment where mobile and fixed nodes coexist. An algorithm for multi-hop multi-paths, a technique for topology reconfiguration by node movement prediction and vibration sensors, path setting for a large number of nodes, and efficient data transfer technology have been introduced to implement the modified LEAHC-AOMDV protocol. Furthermore, the excellence of this protocol was verified through a comparative experiment with the conventional LEACH protocol.

• ETRI Journal
• /
• v.40 no.2
• /
• pp.237-245
• /
• 2018

The Distributed Modulated Wideband Converter (DMWC) is a networking system developed from the Modulated Wideband Converter, which converts all sampling channels into sensing nodes with number variables to implement signal undersampling. When the number of sparse subbands changes, the number of nodes can be adjusted flexibly to improve the reconstruction rate. Owing to the different attenuations of distributed nodes in different locations, it is worthwhile to find out how to select the optimal sensing node as the sampling channel. This paper proposes the spectrum sensing of DMWC based on a Markov random field (MRF) to select the ideal node, which is compared to the image edge segmentation. The attenuation of the candidate nodes is estimated based on the attenuation of the neighboring nodes that have participated in the DMWC system. Theoretical analysis and numerical simulations show that neighboring attenuation plays an important role in determining the node selection, and selecting the node using MRF can avoid serious transmission attenuation. Furthermore, DMWC can greatly improve recovery performance by using a Markov random field compared with random selection.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.59-68
• /
• 1996

In this paper, we propose two types of WDMA protocol for multi-wavelength optical networks that have a dedicated control channel. Protocol type I is designed for the case that the number of nimislots is less than the number of nodes (La${\ge}$M). Proposed protocols employ the aging scheme to guarantee a fairness in the process of channel allocation. The perfomrance of proposed protocols are evaluated in terms of throughput and delay with variations in offered load. Simulation results show that the proposed protocols have superior performance to conventional protocols.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.1
• /
• pp.84-92
• /
• 1994

In this paper, we present a novel scheduling algorithm using the weighted interval graph. An interval graph is constructed, where an interval is a time frame of each operation. And for each operation type, we look for the maximum clique of the interval graph: the number of nodes of the maximum clique represents the number of operation that are executed concurrently. In order to minimize resource cost. we select the operation type to reduce the number of nodes of a maximum clique. For the selected operation type, an operation selected by selection rule is moved to decrease the number of nodes of a maximum clique. A selected operation among unscheduled operations is moved repeatly and assigned to a control step consequently. The proposed algorithm is applied to the pipeline and the nonpipeline data path synthesis. The experiment for examples shows the efficiency of the proposed scheduling algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.121-125
• /
• 2008

It is essential to maintain hierarchical information properly for efficient XML query processing. Well known approach to represent hierarchical information of XML tree is assigning a specific node number to each node of XML tree. Insertion and deletion of XML node can occur at any position in a dynamic XML tree. A dynamic numbering scheme allows us to add nodes to or delete nodes from an XML tree without relabeling or with relabeling only a few existing nodes of XML tree while executing XML query efficiently. According to W3C XQuery update facility specifications a node can be added as first or last child of the existing node in XML tree. Generating new number for last child requires referencing the number of previous last child. Getting the number of last child is very costly with previous approaches. We have developed a new dynamic numbering scheme PSN which is very effective for insertion of a node as last child. Our approach reduces the time to find last child dramatically by removing sorting of children.

• Korean Journal of Veterinary Research
• /
• v.39 no.5
• /
• pp.865-877
• /
• 1999

Hemal nodes and hemolymph nodes are lymphoid organs which share morphologic and functional characteristics of lymph nodes and spleens. Hemal nodes and hemolymph nodes are normally present in Korean native goats. Hemal nodes bad extensive subcapsular and deep sinuses distended by a great number of erythrocytes, and no typical cortex and medulla were observed. Blood vessels commonly occurred, but lymph vessel was not observed in the hemal node. Hemolymph nodes had distinct cortex and medulla, and also had afferent and efferent lymph vessels. The aim of the present study was to obtain new information on the distinct morphological structures of hemal nodes and hemolymph nodes according to ages, and have the basic data for their functions. Goats are divided into 5 groups, consisting of 3 animals aged 1, 3, 6, 10, and 12 months. The morphological studies of the organs were carried out by gross anatomy, light microscopy and immunohistochemistry. During aging, there was an increase in the size of the organs, while there were no significant changes of their numbers, locations and colors. As the goat got older, the lymphatic nodules of hemal nodes were more developed, and the number of macrophage containing phagocytosed erythrocytes was more increased. As the goat was younger, the lymphatic tissues of hemolymph nodes were less developed. There was no difference in distribution of T- and B- lymphocytes according to ages.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.516-518
• /
• 2022

In this paper, we introduce a dependence of number of nodes of hidden-layer in fall detection system using Long Short-Term Memory that can detect falls. Its training is carried out using the parameter theta(θ), which indicates the angle formed by the x, y, and z-axis data for the direction of gravity using a 3-axis acceleration sensor. In its learning, validation is performed and divided into training data and test data in a ratio of 8:2, and training is performed by changing the number of nodes in the hidden layer to increase efficiency. When the number of nodes is 128, the best accuracy is shown with Accuracy = 99.82%, Specificity = 99.58%, and Sensitivity = 100%.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.514-527
• /
• 2009

Wireless sensor networks (WSNs) can be used in various applications for military or environmental purpose. Recently, there are lots of on-going researches for detecting and tracking the spread of continuous objects or phenomena such as poisonous gas, wildfires, earthquakes, and so on. Some previous work has proposed techniques to detect edge nodes of such a continuous object based on the information of all the 1-hop neighbor nodes. In those techniques, however, a number of nodes are redundantly selected as edge nodes, and thus, the boundary of the continuous object cannot be presented accurately. In this paper, we propose a new edge detection method in which edge nodes of the continuous object are detected based on the information of the neighbor nodes obtained via the Localized Delaunay Triangulation so that a minimum number of nodes are selected as edge nodes. We also define the sensor behavior rule for tracking continuous objects energy-efficiently. Our simulation results show that the proposed edge detection method provides enhanced performance compared with previous 1-hop neighbor node based methods. On the average, the accuracy is improved by 29.95% while the number of edge nodes, the amount of communication messages and energy consumption are reduced by 54.43%, 79.36% and 72.34%, respectively. Moreover, the number of edge nodes decreases by 48.38% on the average in our field test with MICAz motes.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.179-192
• /
• 2012

This paper presents novel statistical algorithms for protecting the iTrust information retrieval network against malicious attacks. In iTrust, metadata describing documents, and requests containing keywords, are randomly distributed to multiple participating nodes. The nodes that receive the requests try to match the keywords in the requests with the metadata they hold. If a node finds a match, the matching node returns the URL of the associated information to the requesting node. The requesting node then uses the URL to retrieve the information from the source node. The novel detection algorithm determines empirically the probabilities of the specific number of matches based on the number of responses that the requesting node receives. It also calculates the analytical probabilities of the specific numbers of matches. It compares the observed and the analytical probabilities to estimate the proportion of subverted or non-operational nodes in the iTrust network using a window-based method and the chi-squared statistic. If the detection algorithm determines that some of the nodes in the iTrust network are subverted or non-operational, then the novel defensive adaptation algorithm increases the number of nodes to which the requests are distributed to maintain the same probability of a match when some of the nodes are subverted or non-operational as compared to when all of the nodes are operational. Experimental results substantiate the effectiveness of the detection and defensive adaptation algorithms for protecting the iTrust information retrieval network against malicious attacks.