• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.11-18
• /
• 2005

In ad hoc networks, many applications use the broadcast service that is elementary operation to support various important functions such as route discovery procedure. This paper presents several adaptive probabilistic broadcast schemes base on local information to alleviate the broadcast storm problem for wireless ad hoc network. Our schemes dynamically determine the rebroadcast probability at each node based on the neighbor information within two-hop span. Simulation results are presented, which show our schemes have a better performance over the deterministic flooding approach.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1092-1099
• /
• 2017

In this paper, we propose a novel geographical on-demand routing protocol for a mobile ad-hoc network (MANET) that resolves the broadcast storm problem of ad-hoc on-demand distance vector (AODV) routing protocol. The candidates relaying route request (RREQ) packet are geographically restricted by the locations of the destination and a (RREQ sender. Then, the duplicate RREQs, which are generally discarded in the protocols that follow the principle of the AODV, are parsed to avoid redundant RREQ rebroadcasts and to perform passive acknowledgement with respect to a RREQ rebroadcast. The proposed routing protocol is implemented by modifying the source code of the AODV in QualNet. It is shown through QualNet simulations that the proposed routing protocol significantly improves the packet delivery ratio and the latency of the AODV in high-density and heavy traffic network scenarios.

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

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1306-1312
• /
• 2017

The route request (RREQ) packet is selectively re-broadcasted in the routing protocols that improve the broadcast storm problem of the ad-hoc on-demand routing protocol (AODV). However, in a low node density scenario, the connectivity of these selective rebroadcast schemes becomes less than that of the AODV. In order to clarify the requirements of these selective re-broadcast routing protocols, it is necessary to investigate the relationship between the node density and the connectivity. In this paper, we drive a probability to preserve the connectivity of the GAODV at an intermediate rebroadcast node. In addition, we present an intuitive method to approximate the end-to-end connectivity of the GAODV. We draw the required node density to guarantee the connectivity of 0.9 and 0.99 through computer simulations, and verify the validity of the derived theoritical connectivity by comparing with the simulation results.