• 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.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.691-693
• /
• 2004

Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.3
• /
• pp.25-32
• /
• 2016

Mobile Ad Hoc Networks(MANETs) consists of mobile nodes which communicate with each other without any centralized infrastructure. Message broadcasting by flooding for route discovery in MANET can result in high redundant retransmission, contention and collision of broadcasting packet, known as the broadcast storm problem collectively. The cross-layer design is adopted in this paper, which lets routing layer share the received signal strength information at MAC layer. Also this paper proposes a new probabilistic approach that dynamically adjusts the rebroadcasting probability of a node for routing request packets (RREQs) according to the received signal strength. The simulation results show that the proposed approach demonstrates better performance than blind flooding, fixed probabilistic broadcasting approaches.

• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.95-102
• /
• 2012

The development of applications for vehicular ad hoc networks (VANETs) has very specific and clear goals such as providing intellectual safe transport systems. An emergency warning technic for public safety is one of the applications which requires an intelligent broadcast mechanism to transmit warning messages quickly and efficiently against the time restriction. The broadcast storm problem causing several packet collisions and extra delay has to be considered to design a broadcast protocol for VANETs, when multiple nodes attempt transmission simultaneously at the access control layer. In this paper, we propose an early intelligent alert broadcasting (EI-CAST) algorithm to resolve effectively the broadcast storm problem and meet time-critical requirement. The proposed algorithm uses not only the early alert technic on the basis of time to collision (TTC) but also the intelligent broadcasting technic on the basis of fuzzy logic, and the performance of the proposed algorithm was compared and evaluated through simulation with the existing broadcasting algorithms. It was demonstrated that the proposed algorithm shows a vehicle can receive the alert message before a collision and have no packet collision when the distance of alert region is less than 4 km.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.1
• /
• pp.42-49
• /
• 2009

Most Vehicular Ad hoc Network (VANET) applications rely heavily on broadcast transmission of traffic related information to all reachable nodes within a certain geographical area. Among various broadcast approaches, flooding is the first broadcasting technique. Each node rebroadcasts the received message exactly once, which results in broadcast storm problems. Some mechanisms have been proposed to improve flooding in Mobile Ad hoc Networks (MANET), but they are not effective for VANET and only a few studies have addressed this issue. We propose two distance-based and timer-based broadcast suppression techniques: 15P(15percent) and slotted 15P. In the first (distance based) scheme, node's transmission range is divided into three ranges (80%,15%and5%). Only nodes within 15% range will rebroadcast received packet. Specific packet retransmission range (15%) is introduced to reduce the number of messages reforwarding nodes that will mitigate the broadcaststorm. In the second (timer-based) scheme, waiting time allocation for nodes within 15% range isused to significantly reduce the broadcaststorm. The proposed schemes are distributed and reliedon GPS information and do not requireany other prior knowledge about network topology. To analyze the performance of proposed schemes, statistics such as link load and the number of retransmitted nodes are presented. Our simulation results show that the proposed schemes can significantly reduce link load at high node densities up to 90 percent compared to a simple broadcast flooding technique.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.1-8
• /
• 2022

The message propagation between vehicles must be efficiently performed to quickly transmit information between vehicles in vehicle ad hoc networks (VANETs). Broadcasting can be the most effective solution for propagating these messages. However, broadcasting can cause broadcast storm problems, which can reduce the performance of the overall network. Therefore, rapid information delivery in VANET requires a method that can propagate messages quickly without causing the broadcast storm problems. This paper proposes a lightweight and opportunistic broadcast (LOB) protocol that leverages the features of opportunistic routing to propagate messages quickly while minimizing the load on the network in VANETs where the network topology changes frequently. LOB does not require any routing information like greedy forwarding scheme, and neighboring nodes at the farthest distance within the range of transmission nodes are likely to be selected as forwarding nodes, and multiple forwarding candidate nodes like opportunistic routing scheme can increase packet transmission rates. Simulation results using ns-2 showed that LOB outperformed existing broadcast protocols in terms of packet rate and packet delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.956-963
• /
• 2008

In a multi-hop wireless ad hoc network broadcasting is an elementary operation to support route discovery, address resolution and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether re-broadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce re-broadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.6
• /
• pp.588-594
• /
• 2010

In a multi-hop wireless sensor network, broadcasting is an elementary operation to support command message sending, route discovery and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless sensor network. How to decide whether re-broadcast or not also poses a dilemma between reach ability and efficiency under different host densities. In this paper, we present popular broadcasting schemes, which can reduce re-broadcast packets and improve SRB(Saved ReBroadcast). Simulation results show different levels of improvement over the simple flooding scheme.