• Title/Summary/Keyword: Broadcast storm

Search Result 42, Processing Time 0.025 seconds

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.

A Flooding Scheme Based on Packet Reception Counts for Ad Hoc Networks (애드혹 네트워크에서 패킷 수신 횟수에 기반한 확률적 플러딩 알고리즘)

  • Song, Tae-Kyu;Kang, Jeong-Jin;Ahn, Hyun-Sik
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.197-203
    • /
    • 2011
  • Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

Analysis of Forwarding Schemes to Mitigate Data Broadcast Storm in Connected Vehicles over VNDN

  • Hur, Daewon;Lim, Huhnkuk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.3
    • /
    • pp.69-75
    • /
    • 2021
  • Limitation of the TCP/IP network technology included in the vehicle communication is due to the frequent mobility of the vehicle, the increase in intermittent connection requirements, and the constant presence of the possibility of vehicle hacking. VNDN technology enables the transfer of the name you are looking for using textual information without the need for vehicle identifiers like IP/ID. In addition, intermittent connectivity communication is possible rather than end-to-end connection communication. The data itself is the subject of communication based on name-based forwarding using two types of packets: Interest packet and Data packet. One of the issues to be solved for the realization of infotainment services under the VNDN environment is the traffic explosion caused by data broadcasting. In this paper, we analyze and compare the existing technologies to reduce the data broadcast storm. Through this, we derive and analyze the requirements for presenting the best data mitigation technique for solving the data explosion phenomenon in the VNDN environment. We expect this paper can be utilized as prior knowledge in researching improved forwarding techniques to resolve the data broadcast explosion in connected vehicles over NDN.

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.

Secure and Efficient Traffic Information System Utilizing IPFS and Blockchain in Vehicular Ad-hoc Network (Vehicular Ad-hoc Network 환경에서 IPFS와 블록체인을 활용한 안전하고 효율적인 교통정보시스템)

  • Park, Hanwool;Heo, Gabin;Doh, Inshil
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.260-263
    • /
    • 2022
  • 현재의 교통정보시스템은 수집된 정보를 서버에서 가공하여 서비스하는 형태로 이루어져 있다. 이러한 형태는 네트워크 구성이 비교적 단순하고 유지관리 비용이 적게 든다는 장점이 있지만, 반면에 실시간성이 저하되고 보안이 제대로 보장되지 않을 수 있다는 문제가 있으며, 최근 많은 연구가 이루어지고 있는 VANET 환경에서의 교통정보시스템도 broadcast storm의 가능성을 안고 있다. 본 연구에서 제안하는 교통정보시스템은 자동차가 수집한 돌발 상황에 대한 데이터를 RSU(Road Side Unit)가 수신하고, 이후 메시지를 노드들에게 보낼 때 블록체인에 업로드함으로써 보안성과 broadcast storm 문제들을 해결할 수 있으며, raw data 를 IPFS 에 저장하여 시스템 고도화에 사용할 수 있어 참여자들이 교통 상황에 대해 신속하게 대응할 수 있도록 하는 장점을 갖는다.

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을 해결할 수 있다.

Experimental Evaluation of Data Broadcast Storm in Vehicular NDN (차량 엔디엔 네트워크 안에 데이터 폭증 현상 실험적 평가)

  • Lim, Huhnkuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.7
    • /
    • pp.940-945
    • /
    • 2021
  • Future network architectures such as Named Data Networking (NDN) were born to change the way data can be transmitted from current host-centric network technologies to information-centric network technologies. Recently, many studies are being conducted to graft Vehicular NDN to the communication network technology of smart vehicles including connected vehicles. Explosion of data traffic due to Interest/Data packet broadcasting in Vehicular NDN environment is a very important problem to be solved in order to realize VNDN-based data communication. In this paper, the generation of data packet copies according to the increase in network size, vehicle speed, and frequency of interest packets in VNDN network is simulated and evaluated using ndnSIM, in order to show how severe the data broadcast storm phenomenon. The CDP(Copies of Data Packets) increased proportionally in the increase of network size or Interest frequency.

Adaptive Query Flooding using Neighbor Information for Routing Performance Enhancement in Ad Hoc Networks (Ad Hoc Network에서 라우팅 성능 향상을 위한 이웃 노드 정보를 이용한 적응성 경로 구성 전송 방식)

  • Lee Hakhu;Kang Sangwook;An Sunshin
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.673-684
    • /
    • 2004
  • As the wireless mobile communication is being widespread, mobile technologies will have important roles in the communication with the explosive growth of demanding for wireless portable devices. Among the mobile technologies, a great deal of interest has been taken in mobile ad hoc network (MANET), which is a collection of wireless mobile nodes forming a temporary network without the aid of stationary infrastructure in recent. Furthermore, considering characteristic of ad hoc networks, the design of efficient routing protocols is an important issue. In recent years, on-demand protocols among routing protocols have noticed because of the low routing overhead. However, on-demand protocols suffer from production of the enormous query Packets by broadcasting in order to setup routes, that is, a flooding scheme. The flooding scheme is very costly and results in serious problem, which we refer as the broadcast storm problem. In this paper, we propose a Dynamic Adaptation Query flooding Using Neighbor Topology (NT-DAQ) scheme, in order to resolve the broadcast storm Problem. When a route discovery is in progress, each mobile node decides on the basis of neighbor topology information whether discovery process participates or not. Therefore, our proposed scheme enables to improve network performance in which minimize the number of query rackets. We evaluate the efficiency of our proposed scheme through simulation.

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.

Design and Implementation of Wireless Protocol for Managing Rooms in a Large Building (대형 건물 객실 관리를 위한 무선 프로토콜 설계 및 구현)

  • Jeong, Woo-Jeong;Choi, Sung-Chul;Jeong, Kyu-Seuck;Kim, Jong-Heon;Yoo, Kwan-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.1
    • /
    • pp.27-36
    • /
    • 2010
  • In wireless networks environment, there are attempts for constructing systems through which we can monitor and control various electronic devices used in large buildings at remoteness by using Zigbee protocol. Since address assignment method of DAA in Zigbee has a depth restriction, we cannot construct a network in large buildings. And also communication failures are frequent in a large network since broadcast storm can be occurred due to frequent broadcasts among a lot of nodes at AODV routing used in Zigbee. In order to solve these problems, in this paper, we propose a novel protocol which has improved the restriction of depth by using a fixed address assignment method, and has enhanced the broadcast occurrence by devising a static routing method to a packet movement between floors. Regardless of entire network, additionally, this was to enable internal communication reliably by composing an independent PAN. Specially, in this paper, we implemented the proposed wireless protocol and proved stability and practicality through experiment appliances of control of devices established in a large building.