Topic
Flooding algorithm
About: Flooding algorithm is a research topic. Over the lifetime, 244 publications have been published within this topic receiving 2997 citations.
Papers published on a yearly basis
Papers
20 Mar 2003
TL;DR: By considering ideal and realistic models, a better understanding is acquired of the factors that determine phase transition, the consequences of the passage to realistic MANET conditions and to what extent the authors may benefit from probabilistic flooding in real MANET networks are acquired.
Abstract: Although far from the optimal, flooding is an indispensable message dissemination technique for network-wide broadcast within mobile ad hoc networks (MANETs). As such, the plain flooding algorithm provokes a high number of unnecessary packet rebroadcasts, causing contention, packet collisions and ultimately wasting precious limited bandwidth. We explore the phase transition phenomenon observed in percolation theory and random graphs as a basis for defining probabilistic flooding algorithm. By considering ideal and realistic models, we acquire a better understanding of the factors that determine phase transition, the consequences of the passage to realistic MANET conditions and to what extent we may benefit from probabilistic flooding in real MANET networks.
553 citations
TL;DR: Three geocasting protocols for ad hoc networks are proposed, obtained as variations of a multicast flooding algorithm, and three algorithms attempt to utilize physical location information to decrease the overhead of geocast delivery.
Abstract: Geocasting is a variation on the notion of multicasting. A geographical area is associated with each geocast, and the geocast is delivered to the nodes within the specified geographical area. Thus, geocasting may be used for sending a message that is likely to be of interest to everyone in a specified area. In this paper, we propose three geocasting protocols for ad hoc networks, obtained as variations of a multicast flooding algorithm, and then evaluate these approaches by means of simulations. Proposed geocasting algorithms attempt to utilize physical location information to decrease the overhead of geocast delivery.
229 citations
6 Jun 2007
TL;DR: This paper shows the performance improvements obtained by adding more special characteristics to the existing version of MHVB by changing the shape of the backfire region in the algorithm and introducing a new Dynamic Scheduling algorithm which prioritizes the packet transmission based upon "processing" of the received packets from the other vehicles.
Abstract: This paper, focuses on the "enhancement" of multi- hop vehicular broadcast (MHVB). The protocol is fundamentally a flooding algorithm with special characteristics in order to efficiently disseminate information such as the positions and the velocities of the vehicles for the sake of active safety applications. The main purpose of this paper is to show the performance improvements obtained by adding more special characteristics to the existing version of MHVB. The enhancement procedure is carried out in two steps: by changing the shape of the backfire region in the algorithm and by introducing a new Dynamic Scheduling algorithm which prioritizes the packet transmission based upon "processing" of the received packets from the other vehicles. The key point in the proposal made to enhance the broadcast protocol is the balance between the application requirement and the performance of the protocol.
105 citations
TL;DR: An efficient flooding algorithm is proposed that achieves the local optimality in two senses: 1) the number of forwarding nodes in each step is minimal and 2) the time complexity for computing forwarding nodes is the lowest, which is O(nlogn), where n is thenumber of neighbors of a node.
Abstract: Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of messages, resource contention, and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. Some efficient flooding algorithms were proposed to avoid these problems. However, these algorithms either perform poorly in reducing redundant transmissions or require each node to maintain 2-hop (or more) neighbors information. In the paper, we study the sufficient and necessary condition of 100 percent deliverability for flooding schemes that are based on only 1-hop neighbors information. We further propose an efficient flooding algorithm that achieves the local optimality in two senses: 1) the number of forwarding nodes in each step is minimal and 2) the time complexity for computing forwarding nodes is the lowest, which is O(nlogn), where n is the number of neighbors of a node. Extensive simulations have been conducted and simulation results have shown the excellent performance of our algorithm
91 citations
TL;DR: It is shown that the optimized WSN with integrated self healing far outweighs the performance that is obtained by standard random deployment and a “measure of optimality” is defined that will enable the comparison of different implementations of a WSN from an energy efficiency stand point.
Abstract: An energy efficient cover of a region using Wireless Sensor Networks (WSNs) is addressed in this paper. Sensor nodes in a WSN are characterized by limited power and computational capabilities, and are expected to function for extended periods of time with minimal human intervention. The life span of such networks depends on the efficient use of the available power for sensing and communication. In this paper, the coverage problem in a three dimensional space is rigorously analyzed and the minimum number of sensor nodes and their placement for complete coverage is determined. Also, given a random distribution of sensor nodes, the problem of selecting a minimum subset of sensor nodes for complete coverage is addressed. A computationally efficient algorithm is developed and implemented in a distributed fashion. Numerical simulations show that the optimized sensor network has better energy efficiency compared to the standard random deployment of sensor nodes. It is demonstrated that the optimized WSN continues to offer better coverage of the region even when the sensor nodes start to fail over time. A localized “self healing” algorithm is implemented that wakes up the inactive neighbors of a failing sensor node. Using the “flooding algorithm” for querying the network, it is shown that the optimized WSN with integrated self healing far outweighs the performance that is obtained by standard random deployment. For the first time, a “measure of optimality” is defined that will enable the comparison of different implementations of a WSN from an energy efficiency stand point.
85 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 5 |
| 2020 | 11 |
| 2019 | 10 |
| 2018 | 6 |
| 2017 | 8 |
| 2016 | 8 |