• Magazine of the Korean Society of Agricultural Engineers
• /
• v.24 no.4
• /
• pp.69-79
• /
• 1982

The objective of this study is to contribute to drainage planning in the most realistic and economical way by establishing the relationship between rice yield reduction and overhead flooding by muddy water of each growth stage of paddy, which is the most important factor in determining optimum drainage facilities. This study was based on the data mainly from the experimental reports of the Office of Rural Development of Korea, Reduction Rate Estimation for Summer Crops, published by Ministry of Agriculture and Forestry of Japan and other related research documenta- tion. The results of this study are summarized as follows 1. Damages by overhead flooding are highest in heading stage and have the tendency of decrease in the order of booting stage, panicle formation stage, tillering stage, and stage just after transplanting. Damages by overhead flooding of each growing stage are as follows: a) It is considered that overhead flooding just after transplanting gives a little influence on plant growth and yield because the paddy has sufficient growth period from floo ding to harvest time. b) Jt is analyzed that according to the equation y=11 12x 0.908 which is derived from this study, damages by overhead flooding during tillering stage for 1, 2, 3 successive days are 11.1 %, 20.9%, and 30.2% respectively. c) Damages by overhead flooding after panicle formation stage are very serious because recovering period is very short after damage and ineffective tillering is much. Acc- ording to the equation y=9. 58x+10. Ol derived from this study, damages by overhead flooding fal 1,2,3,5 successive days are 19.6%, 29.2%, 38.8%, 57.9% respectively. d) Booting stage is the very important period in which young panicle has grown up almost completely and the number of glumous flower is fixed since reduction division takes place in the microspore mother cell and enbryo mother cell. According to the equation y=39. 66x 0.558 derived from this study, damages by overhead floodingfor 0.5, 1, 3, 5 successive days are 26.9%, 39.7%, 72. 2% and 97.4%, respectively. Therefore, damages by overhead flooding is very serious during the hooting stage. e) When ear of paddy emerges, flowering begins on that day or the next day; when paddy flowers, fertilization will be completed 2-3 hours after flowering. Therefore overhead flooding during heading stage impedes flowering and increases sterilizing percentage. From this reason damages of heading stage are larger than that of booting stage. According to the equation y-41 94x 0.589 derived from this study, damages by overhead flooding for 0.5, 1, 3, 5, successive days are 27.9%, 63.1 %, 80.1%, and 100% 2. Considering that temperature of booting stage is higher than that of beading stage and plant height of booting stage is ten centimeters shorter than that of heading stage, booting stage should be taken as a critical period for drainage planning because possi- bility of damage occurrence in booting stage is larger than that of heading stage. There-fore, it is considered that booting stage should be taken as critical period of paddy growth for drainage planning. 3. Overhead flooding depth is different depending on the stage of growth. In case, booting stage is adopted as design stage of growth for drainage planning, it is conside red that the allowable flooding depth for new varieties and general varieties are 70cm and 80cm respectively. 4. Reduction Rate Estimation by Wind and Flood for Rice Planting of the present design criteria for drainage planning shows damage by overhead flooding for 1 to 2, 3 to 4, 5 to 7 consecutive days; damages by overhead flooding varies considerably over several hours and experimental condition of soil, variety of paddy, and climate differs with real situation. From these reasons, damage by flooding could not be estimated properly in the past. This study has derived the equation which shows damages by flooding of each growth stage on an hourly basis. Therefore, it has become possible to compute the exact damages in case duration of overhead flooding is known.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.1-14
• /
• 2006

Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.415-418
• /
• 2018

To reduce the flooding overhead of typical AODV, we propose a local flooding initiated by a destination. The proposed routing protocol determines the one-hop neighbor nodes around the shortest path between source and destination by overhearing, and periodically generate flooding at the destination to cope with topology changes. This flooding process involves only one-hop neighbor nodes around the shortest path for reducing the flooding overhead and forms multiple alternate paths around the shortest path. This makes it possible to seamlessly route to the newest shortest path around when the current routing path is disconnected.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.4
• /
• pp.32-39
• /
• 2006

MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.40 no.1
• /
• pp.92-97
• /
• 1995

The objective of this study is to investigate the growth characters of overhead flooded soybean plants at four growth stage. Overhead flooding treatments were applied at the vegetative growth stage ($V_3,\;V_6$) and the reproductive stage ($R_2,\;R_4$) for 6.12.24 hrs, respectively. Yield and yield components were more decreased as the overhead flooding duration was longer and the growth stage was later. Yield was not reduced significantly in soybean plants flooded at $V_3$ stage regardless of flooding duration, and flooded 6 or 12 hrs at $V_6$ stage. When compared to the control, 27 to 36% of yield reduction was observed in soybean plants flooded for 24 hrs at $V_6$ stage, 6 or 12 hrs at $R_2$ stage, and 6 hrs at $R_4$ stage. And 43%, 53% and 66% of yield were reduced through the flooding treatment for 24 hrs at $R_2$ stage 12 hrs and 24 hrs at $R_4$ stage, respectively. So yield reduction was higher in overhead flooded soybean plants at the reproductive stage than that at the vegetative growth stage.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.67-73
• /
• 2010

Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.622-625
• /
• 2010

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.326-328
• /
• 2014

In this paper we propose an efficient algorithm for LSA(Link State Advertisements) flooding. Link state routing protocols have been widely adopted in wired networks. When link state change occurs, a LSA is flooded into the whole network. The overhead of LSA flooding may be a big problem in wireless networks because their link states can be changed frequently. We propose an efficient flooding method that optimizes the flooding processes in wireless networks.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.589-596
• /
• 2007

Although flooding has the disadvantages like a transmission of duplicated packets and a packet collision, it has been used frequently to find a path between a source and a sink node in a wireless ad hoc network. Clustering is one of the techniques that have been proposed to overcome those disadvantages. In this paper, we propose a new flooding mechanism in ad hoc networks using cluster formation based on the link density which means the number of neighbors within a node's radio reach. To reduce traffic overhead in the cluster is to make the number of non-flooding nodes as large as possible. Therefore, a node with the most links in a cluster will be elected as cluster header. This method will reduce the network traffic overhead with a reliable network performance. Simulation results using NS2 show that cluster formation based on the link density can reduce redundant flooding without loss of network performance.