• Title/Summary/Keyword: broadcast storm problem

Search Result 29, Processing Time 0.041 seconds

A Study on Efficient Vehicular Safety Message Broadcast Scheme using GPS Information in VANET (VANET에서 위치 정보를 이용한 효율적인 차량 안전 메시지 브로드캐스트 방안에 관한 연구)

  • Han, Seung-Hwa;Lee, Cheol-Hee;Kim, Young-Beom
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.6
    • /
    • pp.103-110
    • /
    • 2012
  • In Vehicle Safety Communication (VSC), noted as a representative application of VANET technologies, emergency warning messages (EWM) are broadcast over vehicles in response to an emergency situation. However, as the number of vehicles increases, the so-called Broadcast Storm Problem often occurs due to a huge number of redundant EWM transmitted. Though many approaches in the literature have been proposed to solve the problem, most of them require the preliminary phase for setting up or refreshing neighbor relationship through exchanging beacon messages with nearby vehicles, thereby further increasing the traffic load. In this paper, we propose Longest Leaping Relay (LLR) scheme which can efficiently solve the Broadcast Storm Problem without any preliminary phase for setting up neighbor relationship. Through computer simulations, we compared the performance of the proposed scheme with competitive schemes and verified the proposed scheme outperforms the existing schemes.

A Node Status Control Algorithm in Mobile Ad-Hoc Networks (MANET 환경에서 노드 상태 제어 알고리즘)

  • Lee, Su-Jin;Choi, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.3
    • /
    • pp.188-190
    • /
    • 2014
  • In mobile ad hoc networks(MANETs), each node rebroadcast received route request packets for route discovery. Flooding from large number of nodes induces the broadcast storm problem which causes severe degradation in network performance due to redundant retransmission, collision and contention. This paper presents a node status algorithm based on probabilistic scheme to alleviate the broadcast storm problem for wireless ad hoc networks.

A Study on Mitigation Methods for Broadcast Storm Problem over Vehicular CCN (VCCN에서 Broadcast Storm 문제를 완화시키는 방법에 대한 연구)

  • Yeon, Seunguk;Chae, Ye-eun;Kang, Seung-Seok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.429-434
    • /
    • 2019
  • There are several high technologies applied to the driving cars such as self-driving car and connected car for safe and convenient driving. VANET provides useful information such as route selection and gas price by communicating nearby cars and RSUs. VANET prefers CCN rather than traditional TCP/IP stack because CCN offers inherent multicast communication for sharing traffic information as well as traditional unicast. When all participating node rebroadcasts the Interest packets in a Vehicular CCN, the network may suffer from Broadcast Storm Problem. In order to mitigate the effect of the problem and to improve the Data packet transmission, not all but some selected nodes have to rebroadcast the packet. This paper simulates car movements using SUMO and evaluates data transmission performance using ns-3. According to the simulation results, when some selected nodes rebroadcast the Interest packets, the transmission performance improves 10% to 25% depending on the number of requesting nodes.

An Efficient Flooding Algorithm with Adaptive Retransmission Node Selection for Wireless Sensor Networks (무선 센서 네트워크에서의 적응적 재전송 노드 선택에 의한 효율적인 Flooding 알고리즘)

  • Choi, Seung-Joon;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11B
    • /
    • pp.673-684
    • /
    • 2007
  • In this paper, we introduce an FARNS (Flooding algorithm with Adaptive Retransmission Nodes Selection). It is an efficient cross layer-based flooding technique to solve broadcast storm problem that is produced by simple flooding of nodes in wireless sensor network. FARNS can decrease waste of unnecessary energy by preventing retransmission action of whole network node by deciding retransmission candidate nodes that are selected by identification in MAC and distance with neighborhood node through received signal strength information in PHY. In simulation part, we show the results that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, number of redundancy packets and overhead. And FARNS can adjust of node ratio for retransmission operation, it can solve broadcast storm problem as well as meet the requirements of various network environments.

A trust-based algorithm for reducing broadcast traffic in USN (USN의 방송트래픽을 감소하기 위한 신뢰기반 알고리즘)

  • Choi, Ji-Young;Kim, Nam-Hoon;Park, Ho-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.9
    • /
    • pp.2019-2031
    • /
    • 2011
  • Recently USN has been widely used and a lot of research issues have been focused on network configuration. The SOS system is one of the USN applications. The SOS system inherently uses broadcasting due to its emergency. However, a naive broadcasting may cause a significant problem called broadcasting storm. This paper introduces a new trust concept into USN and proposes a new broadcasting algorithm solving the broadcast storm problem.

Dynamic Probabilistic Flooding Algorithm based-on the Number of Child and Sibling Nodes in Wireless Sensor Networks (무선 센서 네트워크에서 자식 노드 수와 형제 노드 수에 따른 동적 확률기반 플러딩 알고리즘)

  • Jeong, Hyo-Cheol;Yoo, Young-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.17C no.6
    • /
    • pp.499-504
    • /
    • 2010
  • The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.

An Efficient Flooding Algorithm with Selection of Retransmission Nodes (재전송 노드의 선택에 의한 효율적인 Flooding 알고리즘)

  • Choi, Seung-Joon;Yoo, Sang-Jo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.907-910
    • /
    • 2007
  • 본 논문에서는 Ad-hoc 네트워크에서 패킷 flooding에 의해 발생하게 되는 broadcast storm problem [1]을 해결하기 위한 크로스 레이어 기반의 flooding 기법을 제안한다. 제안된 flooding 기법은 크로스 레이어 프로토콜을 기반으로 하여 물리계층과 MAC (Medium Access Control) 계층에서 이웃 노드들에 대한 정보를 수집하고, 이를 이용하여 효율적인 재전송 노드의 수를 결정한다. 모의 실험을 통한 성능평가에서는 전체 네트워크 노드에 대한 수신 비율이 simple flooding 에 근접하며, 전송 비율 및 평균중복패킷 수에서도 좋은 성능을 보임으로서 broadcast storm problem을 해결할 수 있다.

  • PDF

An MPR-based broadcast scheme using 3 channels for WSNs (무선 센서 네트워크에서 3개의 채널을 이용한 MPR 기반의 브로드캐스트 기법)

  • Lee, Ji-Hye;Lee, Ki-Seok;Kim, Chee-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1043-1049
    • /
    • 2009
  • Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

Distance and Random-based Broadcast Scheme for Vehicle Safety Communication (차량 안전 통신을 위한 거리와 랜덤 기반 브로드캐스트 기법)

  • You, Jong-Duck;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.11
    • /
    • pp.69-76
    • /
    • 2008
  • Safety-related messages are propagated in form of broadcasting among vehicles in vehicle safety communication. There is the broadcast storm problem in high density vehicle environments. To solve this problem, a distance-based broadcast scheme has been proposed. It causes a serious problem such as retransmission delay in low density vehicle environments since it requires additional defer time to rebroadcast messages. This paper proposes a distance and random-based broadcast scheme. The proposed scheme selects a random time from zero to the defer time that estimated depending on the distance between sending and receiving vehicles. Simulation results show that the proposed scheme requires shorter defer time and less rebroadcasting message than existing schemes.

An LV-CAST algorithm for emergency message dissemination in vehicular networks (차량 망에서 긴급 메시지 전파를 위한 LV-CAST 알고리즘)

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.6
    • /
    • pp.1297-1307
    • /
    • 2013
  • Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.