• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.413-424
• /
• 2009

Wireless sensor network is based on an event driven system. Sensor nodes collect the events in surrounding environment and the sensing data are relayed into a sink node. In particular, when events are detected, the data sensing periods are likely to be shorter to get the more correct information. However, this operation causes the traffic congestion on the sensor nodes located in a routing path. Since the traffic congestion generates the data queue overflows in sensor nodes, the important information about events could be missed. In addition, since the battery energy of sensor nodes exhausts quickly for treating the traffic congestion, the entire lifetime of wireless sensor networks would be abbreviated. In this paper, a new congestion control method is proposed on the basis of genetic algorithm. To apply genetic algorithm, the data traffic rate of each sensor node is utilized as a chromosome structure. The fitness function of genetic algorithm is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets, the proposed method selects the optimal data forwarding sensor nodes for relieving the traffic congestion. In experiments, when compared with other methods to handle the traffic congestion, the proposed method shows the efficient data transmissions due to much less queue overflows and supports the fair data transmission between all sensor nodes as possible. This result not only enhances the reliability of data transmission but also distributes the energy consumptions across the network. It contributes directly to the extension of total lifetime of wireless sensor networks.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.36 no.6
• /
• pp.568-575
• /
• 1991

The morpho-anatomical characteristics of panicle in rice plant is generally correlated with the number of spikelets and grain weight per panicle. For the increase of grain yield potential in rice, a low -tillering plant type with large panicles has been suggested as an ideotype. This study was conducted to investigate the panicle morphology and peduncle anatomy of different tillers within a plant in low -and high-tillering cultivars and their relationships on the number of spikelets and grain weight per panicle. A low-tillering, large panicled IR25588 was compared with a high-tillering. small panicled IR58. IR25588 had more inner(IVB) and outer vascular bundles (OVB). bigger peduncle diameter and peduncle thickness just below the panicle neck node than IR58. The top six tillers(M. P1, P2, P3. P4 and S1P2) within a plant had more IVB and OVB. larger peduncle diameter and thickness than the rest of the tillers in both cultivars. Tillers that emerged earlier had more IVB and OVB than tillers that emerged Jater. The total number of primary and secondary rachis-branches of IR25588 was much higher than that of IR58. IR25588 had more number of spikelets per panicle than IR58. and the top six panicles showed more spikelets per panicle than the rest of the panicles in both cultivars. The peduncle diameter was more important than peduncle thickness on the spikelet differentiation and panicle weight. especially in low-tillering cultivars. The number of IVB and OVB were highly correlated with the number of rachis-branches. spikelets and grain weight per panicle. The number of spikelets per IVB and spikelets per primary branch were higher in IR25588 than IR58 indicating the higher sink strength in low -tillering with large panicled cultivars than in high-tillering with small panicled cultivars. Based on the morpho-anatomical characteristics of a low-tillering cultivar and the top six tillers within a plant. the present results could be support that 'a low-tillering sturdy culms with large panicles' is an ideo-type of rice plant for increasing grain yield potential.potential.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1268-1279
• /
• 2015

In order to manage a large number of devices connected to the Internet of Things (IoT), the Internet Engineering Task Force (IETF) proposed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL). The route of the RPL network is generated through the use of an Objective Function (OF) that is suitable for the service that is required for the IoT network. Since the route of the RPL network is conventionally simply chosen only by considering the link quality between the nodes, it is sensible to seek an OF that can also provide better Quality of Service (QoS). In previous studies, the end-to-end delay might possibly be sub-optimal because they only deal with problems related to the reduction of energy consumption and not to the link quality on the path to the sink node. In this study, we propose a scheme that reduces the end-to-end delay but also gives full consideration to both the quality on the entire route to the destination and to the expected lifetime of nodes with bottlenecks from heaped traffic. Weighting factors for the proposed scheme are chosen by experiments and the proposed scheme can reduce the end-to-end delay and the energy consumption of previous studies by 20.8% and 10.5%, respectively.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.50-64
• /
• 2013

In clustered sensor networks, since a CH (Cluster Head) collects data from its members and delivers the collected data to the sink, it is very important to prevent compromised nodes from joining a CH election and manipulating and fabricating the election result. In order to protect CH elections from compromised nodes, unpredictability, non-manipulability, and agreement property should be guaranteed in CH elections. However, existing CH election schemes cannot prevent intelligent compromised nodes from skilfully violating those properties via their cooperation. In this paper, we propose a scheme which protects the CH election process by detecting intelligent compromised nodes and excluding them. For every CH election round, each member gives a direct trust value to other members according to their behavior. Then a real reputation value is given to each member by combining the direct trust value and indirect trust values provided by other members. Then, each node evaluates the real reputation values of members in its cluster and excludes some untrustable nodes from CH candidates. The scheme greatly improves the non-manipulability and agreement property of CH election results compared to other rival schemes. Furthermore, the scheme preserves the high non-manipulability and the high agreement property even in an environment where message losses can happen.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.146-154
• /
• 2007

In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.