• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1535-1541
• /
• 2009

In this paper, we suggest an efficient path searching algorithm that reduces the hop count when each node sends a data in ZigBee networks. As the hop count reduces, the network traffic is also reduces and leads to less energy consumption. This enables the sensor network live longer with limited node power. The proposed path searching algorithm consists of two sub-algorithms. One for upstream process and the other for downstream process. When a node selects its proper routing path, the node not only uses the information of the parent and child node, but it also uses the neighbor nodes for each node. In the simulation, we changed various network environment factors such as network parameters, number of nodes, and number of neighbor nodes and observed their performances. We compare the performance to the previous ZigBee Tree routing algorithm with separate two algorithms, the upstream and the downstream, and then compare the performance when all two algorithms are applied.

• Korean Journal of Veterinary Research
• /
• v.37 no.3
• /
• pp.463-469
• /
• 1997

This study was performed to investigate the gross anatomical features and microscopical structures of the hemal nodes and the hemolymph nodes in the water deer (Hydropotes inermis) found in Kangwon-do, Korea. The hemal nodes and hemolymph nodes were observed mainly in the periphery of the thoracic and abdominal aortae of the animals. The size of hemal nodes was generally smaller than that of the hemolymph nodes, and the shape of the both organs was spherical or ovoid. The color of the hemal nodes was red or black while that of the hemolymph nodes was gray with red bands. The hemal nodes were surrounded by a thin connective tissue capsule and there were extensive subcapsular and deep sinuses distended by a great number of erythrocytes. Although a few number of lymphatic nodules and small areas of diffuse lymphatic tissues were observed in the parenchyma, no typical cortex and medulla were defined in the hemal node. Small numbers of blood vessels were found at the connective tissue capsule but lymph vessel was not observed microscopically in this organ. The hemolymph nodes were covered by a relatively thick connective tissue capsule and there was a hilus in each node. The parenchyma was divided into cortex and medulla. The cortex was composed of a few numbers of lymphatic nodules and some diffuse lymphatic tissues. The medulla comprised medullary sinus and cords. Afferent and efferent lymph vessels were observed at the periphery of the capsule and the hilus, respectively. The subcapsular and medullary sinuses were not extensive but filled with small numbers of erythrocytes. The stroma of hemal node and hemolymph node was composed of reticular cells and fibers, and the capsule and trabecula consisted of collagenous fibers with smooth muscle fibers.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.445-450
• /
• 2020

Cooperative networks provides the benefits of performance improvements and capacity increment when the source node transmits signal to the destination node using several relay nodes. In this paper, we consider the cooperative network where the transmission scheme between the source node and relay node use conventional binary signaling, whereas the transmission scheme between thee relay node and destination node adopt the differential space time coding signaling. We analyze the performance of the system depending on the modulation scheme, i.e., coherent and differential modulation, at the source-relay links. The performance depending on the relay location is also compared by considering modulation scheme and the number of relay node.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.15-24
• /
• 2003

In this paper, an optimization model for the clustered node allocation systems in the distributed computing environment is presented. In the presented model with a distributed file system framework, the dynamics of system behavior over times is carefully thought over the nodes and hence the functionality of the cluster monitor node to check the feasibility of the current set of clustered node allocation is given. The cluster monitor node of the node allocation system capable of distributing the parallel modules to clustered nodes provides a good allocation solution using Genetic Algorithms (GA). As a part of the experimental studies, the solution quality and computation time effects of varying GA experimental parameters, such as the encoding scheme, the genetic operators (crossover, mutations), the population size, and the number of node modules, and the comparative findings are presented.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.5
• /
• pp.97-104
• /
• 2010

In this paper, mesh network structure is applied to solve the load balancing problems in the Grid database. Data of the Grid database is replicated to several node for enhanced performance. Therefore, load balancing for user's query is selected node that evaluated workload in it. Existing researches are using passive load balancing method that selected another node after then node overflowed workload. It is inefficient to be applied to Gird database that has a number of node and user's queries almost changes dynamically. The proposed method connected each node which includes the same data through mesh network structure. When user's query occurs, it select node that has the lowest workload. The performance evaluation shows that proposed method performs better than the existing methods.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.147-151
• /
• 2005

CAN(Controller Area Network) is a simple and efficient network system for real time control and measurement. As it is not only good at error detection but also strong in electromagnetic interference, CAN has been widely used all over the industries. Basically, CAN needs a master node in charge of sensor data collection, node scheduling for data transmission to a monitoring system and error detection. According to the number of mater nodes, the CAN system is classified into two type of master system. One is a single master system that has only one master node and the other is a multi-master system where any sensor node can become a master node depending on the system's conditions. While it has the advantage of its fault tolerance, the multi-master system will suffer form the overall performance degradation when a defect is found in the master node. It is because all sensor nodes pertaining to a defective master node lose their position. Moreover, it is difficult and expensive to implement. For a single master system, the whole system will be broken down when a problem happens to a single master. In this paper, a dynamic master system is presented that there are several sub-master nodes of which basic functions are those of other sensor nodes at ordinary times but dynamically changed to replace the failing master node. An effective scheduling algorithm is also proposed to choose an appropriate node among sub-master nodes, where each sub-master node has its precedence value. The performance of the dynamic master system is experimented and analyzed.

• Journal of Sericultural and Entomological Science
• /
• no.12
• /
• pp.13-16
• /
• 1970

The studies were intended to clarify the correlations between the characters and the influences upon yield of mulberry trees. The analysis of covariance was used to obtain the genotypic correlations and phenotypic correlations among the eight characters namely branch length, node number, branch diameter, branch number per stock, total branch weight, old branch weight, new shoot and leaf weight, etc., and path-coefficients were calculated by Dewey's method (5). The results obtained are summarized as follows： 1. Genotypic correlations were slightly higher than the corresponding phenotypic correlations between tile characters as shown in Table 1. It could be indicated that hight leaf yield was genetically correlated with almost all characters studied except branch diameter. 2. Leaf yield of mulberry trees was mainly associated with the characters such as node number per branch, total branch weight and old branch weight, etc. 3. Branch length, branch diameter, branch number per stock and new shoot weight had little direct influence upon yield but it had rather considerable indirect in fluence upon yield by increasing the node number and total branch weight per stock. As a result, it can be concluded that total branch weight is primarily determined by branch number per stock and old branch weight, and in turn the leaf yield of mulberry trees is secondary determined by the node number by increasing the branch diameter and length which are positively correlated with branch number per stock and new shoot weight of mulberry trees.

• Journal of the Korean Society of Costume
• /
• v.47
• /
• pp.73-88
• /
• 1999

To find the reasonable gathering amount by a length of gathered skirt and a fabric the methods of this study were divided on three types-five kinds of the gathering amounts three kinds of fabrics and three kinds of skirt length-so forty five kinds of the samples were made. As the visual evaluation and the shape of hemlines evaluation of the gathered skirt were practiced by these factors this study found the aesthetical gathering amount and analyzed the shape of hemlines. The following are the results of this research. 1. In the same fabric and skirt length to estimate a hemlines shape of a gathered skirt the increased amount of the node number of cotton fabric was widest and wool fabric was most stable And when the gathering amounts of each fabric were higher than 1.5 times the node indexes were no difference. According as a skirt length was longer the node indexes assumed a similar aspects but according as the skirt length was shorten an the gathering amount was smaller the node shapes were level and broad. And according to being increased a gathering amount the width of right and left of gathered skirt was generally wider. 2. In the same gathering amount and skirt length in seeing the estimation of a hemlines shape of a gathered skirt when the skirt length was 40cm in cotton polyester wool fabrics the node indexes were similar at up to 1.5 times of gathering amount and especially it became very bigger at 0.5 times and according as the gathering amount was increased node index became gradually smaller. The width of right and left of the skirt hemlines of wool fabric was more smaller than polyester and cotton fabrics so it is happen to hang down. 3. In the same gathering amount and fabric in seeing the estimation of a hemlines shape as a variation of a skirt length when the gathering amount of cotton and polyester was from up to 1.5 times and wood fabric was from up to 1.0 times according as skirt length was longer node index in the same gathering amount was decreased. And in case as it was 0.5 times the node indexes of the 40cm and 60cm skirt length were bigger than other factors. In the same gathering amount the width of right and left of the skirt hemlines was smaller at 60cm skirt length and polyester fabric was smaller at 80cm skirt length.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.303-316
• /
• 2011

Data aggregation is important in wireless sensor networks. However, it also introduces many security problems, one of which is that a compromised node may inject false data or drop a message during data aggregation. Most existing solutions rely on encryption, which however requires high computation and communication cost. But they can only detect the occurrence of an attack without finding the attacking node. This makes sensor nodes waste their energy in sending false data if attacks occur repeatedly. Even an existing work can identify the location of a false data injection attack but it has a limitation that at most 50% of total sensor nodes can participate in data transmission. Therefore, a novel approach is required such that it can identify an attacker and also increase the number of nodes which participate in data transmission. In this paper, we propose a monitoring-based secure data aggregation protocol to prevent against a compromised aggregator which injects false data or drops a message. The proposed protocol consists of aggregation tree construction and secure data aggregation. In secure data aggregation, we use integration of abnormal data detection with monitoring and a minimal cryptographic technique. The simulation results show the proposed protocol increases the number of participating nodes in data transmission to 95% of the total nodes. The proposed protocol also can identify the location of a compromised node which injects false data or drops a message. A communication overhead for tracing back a location of a compromised node is O(n) where n is the total number of nodes and the cost is the same or better than other existing solutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.751-764
• /
• 2013

In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.