Border node retransmission based probabilistic broadcast protocols in ad-hoc networks

Cartigny, Julien; Simplot, David

doi:10.1109/hicss.2003.1174853

Cited by 111 publications

(117 citation statements)

References 8 publications

Supporting

Mentioning

116

Contrasting

Order By: Relevance

“…In [4] a method has been proposed that is similar to simple flooding except that vehicles rebroadcast with a probability. A distributed gossip-based routing is designed to solve the overhead problem.…”

Section: Related Backgroundmentioning

confidence: 99%

Dynamic Broadcasting in Vehicular Ad hoc Networks

Najafzadeh¹,

Ithnin²,

Razak³

et al. 2013

IJCTE

View full text Add to dashboard Cite

Abstract-Vehicular Ad hoc Network (VANET) is a subclass of mobile ad hoc networks (MANETs). VANETs provide a variety of interesting applications. Many of these applications rely on broadcasting of messages to other vehicles. The simplest broadcasting algorithm is flooding. Because of a large number of vehicles during peak hour, blindly flooding may lead to packet collision and high contention named broadcast storm problem. This paper presents a broadcasting approach for safety messages that dynamically adjust waiting time of a vehicle according to the number of neighbor vehicles and distance to source. We evaluate the performance of our proposed approach in terms of reachability, reliability. The simulation results show our protocol introduces better performance than flooding and random waiting time protocol.Index Terms-Vehicular Ad hoc Network, broadcast storm problem, network density

show abstract

Section: Related Backgroundmentioning

confidence: 99%

Dynamic Broadcasting in Vehicular Ad hoc Networks

Najafzadeh¹,

Ithnin²,

Razak³

et al. 2013

IJCTE

View full text Add to dashboard Cite

show abstract

“…Cartigny and Simplot [8] suggested and empirically studied four probabilistic broadcasting schemes, in which nodes utilize the knowledge of their local density and neighboring nodes can exchange their neighborhood lists between themselves. One of the schemes studied (mode 2) is similar to our Distributed Gossip scheme.…”

Section: A Network-wide Broadcasting and Gossipingmentioning

confidence: 99%

Controlled Gossiping in Ad Hoc Networks

Lysiuk

Haas

2010

2010 IEEE Wireless Communication and Networking Conference

View full text Add to dashboard Cite

Abstract-Gossiping, a probabilistic algorithm for networkwide broadcasting, can significantly reduce the number of transmissions in one-to-all message spread. Based on the Continuum Percolation Theory, we develop a novel analytical model of gossiping for wireless ad hoc networks. This model provides an intuitive way for setting the gossiping probability, so that a gossip achieves high degree of network coverage with limited number of transmissions. We also propose and study a distributed gossiping scheme, in which nodes set their gossiping probabilities according to locally acquired information. Both gossiping schemes are demonstrated to be scalable; i.e., for fixed network area, the expected number of gossip transmissions does not depend on the number of nodes in the network. The analytical results are verified via simulations of large ad hoc networks.

show abstract

“…Function exponents are normally used use to determine how the forwarding probability varies to the variables used to tune the forwarding probability [41][42] [43]. In the proposed MOP the exponent will be optimized according to the target scenario.…”

Section: Broadcasting In Disaster Response Scenarios As a Multi-objecmentioning

confidence: 99%

Multi-objective performance optimization of a probabilistic similarity/dissimilarity-based broadcasting scheme for mobile ad hoc networks in disaster response scenarios

et al. 2013

View full text Add to dashboard Cite

decentralized communications quickly and using common devices like mobile phones. Broadcasting is the main mechanism used to disseminate information in all-to-all fashion in ad hoc networks. The objective of this paper is to optimize a broadcasting scheme based on similarity/dissimilarity coefficient designed for disaster response scenarios through a multi-objective optimization problem in which several performance metrics such as reachability, number of retransmissions and delay are optimized simultaneously.

show abstract

Border node retransmission based probabilistic broadcast protocols in ad-hoc networks

Cited by 111 publications

References 8 publications

Dynamic Broadcasting in Vehicular Ad hoc Networks

Dynamic Broadcasting in Vehicular Ad hoc Networks

Controlled Gossiping in Ad Hoc Networks

Multi-objective performance optimization of a probabilistic similarity/dissimilarity-based broadcasting scheme for mobile ad hoc networks in disaster response scenarios

Contact Info

Product

Resources

About