Flooding Scope Research Articles

Research on Water Cone Behavior in a Heavy Oil Reservoir with Bottom Water Considering the Starting Pressure Gradient.

Aiming at the unclear reorganization of the water cone shape and its flooding scope for a horizontal well in a heavy oil reservoir with bottom water, a new method was proposed in this paper to establish a numerical model with the starting pressure gradient (SPG) by commercial software to study water cone behavior. The results show that there exists SPG in heavy oil reservoirs ranging from 10–4 to 10–3 magnitude with mobility under 30 μm2/mPa·s. With a mobility of 33 μm2/mPa·s, the water cone and flooding scope from the model with SPG is 120 m shorter than that without SPG. Upon increasing the mobility from 11 to 90 μm2/mPa·s, the flooding scope of the model with SPG changes from 125 to 315 m, showing a power exponential form. The new method proposed in this paper was significant for the water cone behavior study and has broad applications in heavy oil reservoir development in the future.

Risk Evaluation of Rainstorm and Flood in the Upper Reaches of Hunhe River (Qingyuan Section) Based on the FloodArea Model

By using data of hourly rainfall with all of the meteorological stations in the upper reaches of Hunhe River (Qingyuan Section), the digital elevation model, the land use and the disasters data etc., the storm flood process which happened on 16 August 2013 is reproduced simulated based on the rainstorm flooding of FloodArea model, also the flooding simulation and its effectiveness have been carried out. Conclusions are drawn as follows: there is a sharp rise of the flood depth falling behind the change of rainfall three or four hours. As the accumulation of the precipitation, the water level has increased, and when the precipitation process stops, the flood pooled into midstream and downstream gradually. According to the disaster investigation, in both the aspects of flooding scope and flooding depth of warning spots, the simulation result of FloodArea model agrees with the fact. It indicates that the FloodArea model generates good simulation effect in the upper reaches of Hunhe River (Qingyuan Section). Combined with population and GDP information, in the whole river, about eighty-three thousand people were affected by flooding, also one billion and five hundred seventy five million RMB of gross domestic product was lost. When the flood depth deepens and the flooding scope increases, correspondingly the loss rate of population and GDP rises and the flood risk increases.

무선 센서 네트워크에서의 통신 경로 은닉

무선 센서 네트워크에 대한 전역 도청에 대응하여 통신 경로 상의 노드들을 은닉하기 위해서는 네트워크 전반에 걸쳐 수많은 속임수용 더미 패킷들이 발행되어야한다. 이 논문에서는 모바일 싱크(기지국)와 근원지들을 포함하는 일정 크기의 원 형태 내에 존재하는 노드들로 국한되는 플러딩 기반의 데이터 전송 프로토콜을 제안하여 노드들의 위치 기밀을 유지하고 생성되는 더미 패킷들의 수를 감축하고자 한다. 플러딩 크기는 보안 수준과 통신 비용을 고려하여 결정할 수 있다. 제안 프로토콜을 설계하고 주요 특성을 검증한다. Tremendous amount of dummy packets are generally generated for faking over a wireless sensor network so as to keep the location privacy of nodes on the communication paths against the global eavesdropping. In this paper, a scoped-flooding protocol is designed for transferring data between each source and mobile sink(aka, basestation) where, the only nodes within the scope are allowed to issue dummy packets at every idle time so that the location privacy of the nodes on the paths is kept and the amount of dummy packets is reduced to the extend of the flooding scope. The size of the flooding diameter can be taken into consideration of the privacy level and the communication cost. We design a detailed specification of the protocol and verify several properties.

2-D Flood Routing Simulation on the Lower Yellow River from Huayuankou to Jianetan Based on Mike21 Software

The Lower Yellow River is apt to deposit and migrate. The reach from Huayuankou to Jiahetan is the typical wandering reach, which has broad and shallow body, intertwined tributary and numerous shoals. The mainstream always swings, and the riverbed deforms rapidly. There exist lots of residential places, irrigation canals, roads, productive dikes and other controlling works within the embankments, which greatly limits the scope of flooding. When the peak discharge is very large, the flood is prone to resulting in productive dikes bursting, which will greatly endanger the lives of residents in flood plains. The 2-D water flow mathematical model which reflects flood routing in the reach from Huayuankou to Jiahetan has been developed based on MIKE 21 software in this paper. Through the numerical simulation of the “96.8” typical flood, the simulating results in the condition of present topography are agreement with the measured ones. It shows that this model is basically reasonable in the selection aspects of river terrain, boundary treatment, roughness and water flow parameters, and the model has a reference value.

P2P Model Based on Isolated Broadcast Domains

Resource location is the most important issue for Peer-to-Peer (P2P) system and flooding is the fundamental mechanism for unstructured P2P systems. Redundant messages will exponential growth with flooding scope increasing which severely influences the scalability of the system. In this paper, a new P2P model based on isolated broadcast domains is given to reduce the amount of redundant messages by limiting the radius of messages transmitted. Analysis and experiments show that this model can guarantee coverage of nodes and significantly reduce the amount of redundant messages generated.

Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

Prior studies show that more than 70 percent of communication paths in a popular unstructured peer-to-peer (P2P) system (i.e., Gnutella) do not exploit the physical network topology, leading to the topology mismatch problem, and thus, lengthen communication between participating peers. While previous efforts in solving overlay topology matching problems do not guarantee the bounds of performance metrics (e.g., the communication delay between any two overlay peers and the broadcasting scope of any participating peer), in this paper, we present a novel topology matching algorithm that has provable performance qualities. In our proposal, each participating node creates and manages a constant number of overlay connections to other peers in a distributed manner. In rigorous performance analysis, we show that 1) the expected overlay communication delay between any two nodes in our P2P network is a constant; 2) in addition, any joining node has the exponential broadcasting scope in expectation; 3) furthermore, a participating node takes a polylogarithmic overhead to exploit the physical network locality and maintain its flooding scope. Together with extensive simulations, we present our proposal that significantly outperforms two recent solutions, i.e., THANCS and mOverlay, in terms of overlay communication latency and/or broadcasting scope.

LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search

Flooding is a fundamental file search operation in unstructured peer-to-peer (P2P) file sharing systems, in which a peer starts the file search procedure by broadcasting a query to its neighbors, who continue to propagate it to their neighbors. This procedure repeats until a time-to-live (TTL) counter is decremented to 0. Flooding can seriously limit system scalability, because the number of redundant query messages grows exponentially during the message propagation. Our study shows that more than 70 percent of the generated messages are redundant in a flooding with a TTL of 7 in a moderately connected Gnutella network. Existing efforts to address this issue have been focused on limiting the use of the flooding operation. We propose a new flooding scheme, called LightFlood, with the objective of minimizing the number of redundant messages and retaining a similar message-propagating scope as that of the standard flooding. In the scheme, each peer keeps track of the connectivities of every immediate and next indirect neighbor peers, which can be acquired locally. LightFlood identifies the neighbor with the highest connectivity and uses the link to that neighbor to form a suboverlay within the existing P2P overlay. In LightFlood, flooding is divided into two stages. The first stage is a standard flooding with a limited number of TTL hops, where a message can spread to a sufficiently large scope with a small number of redundant messages. In the second stage, message propagating is only conducted along the suboverlay, significantly reducing the number of redundant messages. Our analysis and simulation experiments show that the LightFlood scheme provides a low-overhead broadcast facility that can be effectively used in P2P search. For example, compared with standard flooding with seven TTL hops, we show that LightFlood with an additional two to three hops can reduce up to 69 percent of the flooding messages and retain the same flooding scope. We believe that LightFlood can be widely used as a core mechanism for efficient message broadcasting in P2P systems due to its near-optimal performance.