• Title/Summary/Keyword: 플러딩

Search Result 191, Processing Time 0.153 seconds

Analysis of Flooding Algorithm using FEC in Wireless Multihop Networks (멀티홉 네트워크 환경에서 FEC 를 적용한 Flooding 기법 분석)

  • Jang, Jeong-Hun;Yang, Seung-Chur;Kim, Jong-Deok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • /
    • pp.725-728
    • /
    • 2011
  • 멀티홉 네트워크에서 플러딩(Flooding) 기법은 토폴로지 내의 모든 노드에게 패킷을 전달하는 것이다. 대표적인 플러딩 기법인 Blind 플러딩은 패킷을 받은 모든 노드가 플러딩을 하기 때문에, 무선 네트워크의 전체적인 성능이 감소한다. 기존 연구에서는 성능 향상을 위해 중복 수신되는 패킷을 줄이는 데에만 초점이 맞춰져 있다. 하지만 실제 무선 네트워크 환경에서는 간섭에 따른 패킷 손실이 발생하고, 플러딩은 Broadcast 로 전송하기 때문에 재전송하여 손실 패킷을 복구할 수 없다. 본 논문에서는 Blind, Self-Pruning, Dominant-pruning 플러딩 기법에 재전송이 필요 없는 오류정정 기법(FEC)를 적용하여, 추가적인 잉여 데이터에 따른 전체 전송 패킷의 수와 플러딩 기법의 신뢰성을 분석 하였다.

  • PDF

Efficient Flooding Mechanisms with Considering Data Transmission Characteristics of the Wireless Sensor Network (무선 센서 네트워크의 데이터 전송 특성을 고려한 효율적인 플러딩 기법)

  • Ahn, Sang-Hyun;Lim, Yu-Jin;Kim, Mahn-Hee
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.209-216
    • /
    • 2009
  • In the wireless sensor network, flooding is required for the dissemination of queries and event announcements. The simple flooding causes the implosion and the overlap problems, so the simple flooding may result in the reduced network lifetime. Therefore, in this paper, we propose the flooding overlay structure (FOS) so that the overhead caused by flooding can be reduced. We propose two variants of FOS mechanisms, the centralized FOS (CFOS) and the distributed FOS (DFOS). In CFOS, the sink collects the network topology information and selects forwarding nodes based on that information. On the other hand, DFOS allows each sensor node to decide whether to act as a forwarding node or not based on its local information. For the performance evaluation of our proposed mechanisms, we carry out NS-2 based simulations and compare ours with the simple flooding and the gossiping. The simulation results indicate that the proposed FOS mechanisms outperform the simple flooding in terms of the network lifetime and the gossiping in terms of the data delivery ratio.

Efficient Flooding in Ad hoc Networks using Cluster Formation based on Link Density (애드 혹 네트워크에서 링크밀도기반 클러스터 구축을 이용한 효율적인 플러딩)

  • Lee, Jae-Hyun;Kwon, Kyung-Hee
    • 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.

A Performance Comparison of Flooding Schemes in Wireless Sensor Networks (무선센서네트워크에서 플러딩 기법의 성능평가)

  • Kim, Kwan-Woong;Cho, Juphil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.153-158
    • /
    • 2016
  • Broadcasting in multi-hop wireless sensor networks is a basic operation that supports many applications such as route search, setting up addresses and sending messages from the sink to sensor nodes. The broadcasting using flooding causes problems that can be mentioned as a broadcasting storm such as redundancy, contention and collision. A variety of broadcasting schemes using wireless sensor networks have been proposed to achieve superior performance rather than simple flooding scheme. Broadcasting algorithms in wireless sensor networks can be classified into six subcategories: flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, location-based schemes, and neighbor knowledge-based scheme. This study analyzes a simple flooding scheme, probabilistic scheme, counter-based scheme, distance-based scheme, and neighbor knowledge-based scheme, and compares the performance and efficiency of each scheme through network simulation.

Efficient Flooding Methods for Link-state Routing Protocols (Link-state 라우팅 프로토콜을 위한 효율적인 플러딩 방법)

  • Kim, Jeong-Ho;Lee, Seung-Hwan;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.760-766
    • /
    • 2012
  • In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.

Flooding techniques for Mobile Ad Ho Networks (이동 Ad Hoc 네트워크에서의 Flooding 기술)

  • Shin, J.W.;Kwon, H.Y.;Kim, E.B.
    • Electronics and Telecommunications Trends
    • /
    • v.18 no.6
    • /
    • pp.8-18
    • /
    • 2003
  • 이동 Ad Hoc 네트워크에서 플러딩(flooding)은 제어 및 데이터 패킷을 브로드캐스팅하기 위해 주로 사용되고 있지만, 노드들간의 공유된 무선 채널 사용 및 무선 전송영역의 중첩으로 인하여 플러딩 수행 시에 발생되는 자원 경쟁, 패킷 충돌 및 패킷 중복 수신현상은 네트워크의 성능을 저하시키는 요인이 되고 있다. 본 고에서는 이동 Ad Hoc 네트워크에서 패킷 플러딩 수행 시에 발생되는 문제점을 기술하고 이를 해결하기 위해 제안된 다양한 플러딩 기법들을 소개한다.

Flooding Scheme considering Location and Barrier in Ubiquitous Sensor Network (유비쿼터스 센서 네트워크에서 위치와 장애물을 고려한 플러딩 방법)

  • Lee, Hyun-Jung;Han, Kyu-Ho;An, Sun-Shin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.163-166
    • /
    • 2007
  • 통신모듈이 포함된 많은 컴퓨팅 장치들이 다가오는 미래에는 유비쿼터스 네트워크 디바이스가 될 것이다. 센서 네트워크도 그런 유비쿼터스 네트워크의 어플리케이션이다. 대부분의 경우 센서 네트워크는 플러딩기반의 on-demand 에드혹 라우팅 프로토콜을 사용하나, 플러딩에 따른 중복된 패킷 전송을 최소화 하기 위해, 위치 정보를 사용하고 장애물까지 고려한다. 본 논문은 건물 내 유비쿼터스 센서 네트워크에서 위치 기반과 장애물을 고려한 플러딩을 제안한다.

  • PDF

Flooding and Hysteresis Effects in Nearly - Horizontal Two - Phase Countercurrent Stratified Flow (근사수평 이상반류성층유동에서의 플러딩 및 히스테리시스효과)

  • 이상천
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.9 no.2
    • /
    • pp.232-239
    • /
    • 1985
  • 근사수평 이상반류유동에서의 플러딩천이에 대한 실험을 수행하였으며 이것을 바탕으로 반류유 동도(flow-regime map)를 완성하였다. 또 플러딩천이에 대한 응축의 영향을 고찰하였는데 플러 딩이 액체입구에서 야기될 때 플러딩 속도는 응축량을 고려한 유효증기량으로 표시되며 이 경우 반드시 히스테리시스효과를 동반하게 된다. 이 효과는 응축에 기인하는 것으로 그 메카니즘을 구명하였다. 또 전달액체유량이 영이 될 때의 임계증기속도는 액체분출유량이나 액체서브쿠울 링의 정도에 무관하며 본 연구에서 사용한 관의 경우, 수정 Wallis 변수로 1.74로 나타났다.

An Efficient Flooding Scheme using Clusters in Mobile Ad-Hoc Networks (애드 혹 네트워크에서 클러스터를 이용한 효율적인 플러딩 방안)

  • Wang Gi-cheol;Kim Tae-yeon;Cho Gi-hwan
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.696-704
    • /
    • 2005
  • Flooding is usually utilized to find a multi hop route toward the destination which is not within transmission range in Ad Hoc networks. However, existing flooding schemes deteriorate the network performance because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve this, a flooding scheme using on demand cluster formation is proposed in this paper. The scheme employs ongoing Packets for constructing a cluster architecture as the existing on demand clustering scheme. Unlike to the existing on demand clustering scheme, the scheme makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results proved that the proposed scheme reduces the number of transmissions and collisions than those of two other schemes.

Air-Water Flooding in Multirod Channels : Effects of Spacer Grids and Blockages (다봉채널내의 공기-물 플러딩 : 스페이서 그릿 및 블럭키지의 영향)

  • Cha, Jong-Hee;Jun, Hyung-Gil
    • Nuclear Engineering and Technology
    • /
    • v.25 no.3
    • /
    • pp.381-393
    • /
    • 1993
  • This paper presents the experimental results on flooding of countercurrent flow in vertical multirod channels, which consists of falling water film and upward air flow. In particular, the effects of spacer grids, with and without mixing vane, and of blockage in the multirod bundle on the behaviour of flooding were investigated. The 5$\times$5 zircaloy tube bundle was used for the test section. The comparison of previous analytical models and empirical correlations with present data on flooding showed that the existing models and correlations predict much higher flooding curves. The spacer grid causes the lower flooding air flow rate to compare with the bare rod bundle. However, the mixing spacer grids need a higher flooding air flow rate for a constant liquid flow rate than the spacer grids without mixing vanes. The bundle containing blockages has the highest flooding air flow rate among the bundles with spacer grids and blockages. Empirical flooding correlations for the three types of test section have been made.

  • PDF