Route discovery in wireless mobile ad hoc networks with adjusted probabilistic flooding

Abdulai, Jamal-Deen; Mohammed, Aminu; Nokoe, Kaku Sagary; Oyetunji, Ekanah

doi:10.1109/icastech.2009.5409740

Cited by 8 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But pull algorithms are difficult to carry out [15]. Similarly, the authors in [2] distinguish all sites by four levels. The probability in each level is reversely proportional to the number of levels predefined in ad hoc network.…”

Section: Related Workmentioning

confidence: 97%

Efficient Probabilistic Information Broadcast Algorithm over Random Geometric Topologies

2014

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

This paper studies reliability of probabilistic gossip algorithms over the random geometric topologies which model ad hoc networks. We propose an efficient algorithm that ensures higher reliability at lower message complexity than the three families of gossip algorithms. Such an improvement is reasonably estimated by our reliability model. The results obtained by OMNET++ simulator confirm the prediction that our algorithm is the best choice for random geometric networks.

show abstract

Section: Related Workmentioning

confidence: 97%

Efficient Probabilistic Information Broadcast Algorithm over Random Geometric Topologies

2014

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…As explained in Section V, our model produces the same result for GossipFF and GossipPISB, depicted as ModelFF. For a given p f orw , we can theoretically have both the reliability by our model and the message complexity M shown in Equation (2).…”

Section: Table I Topology Parametersmentioning

confidence: 99%

“…The authors distinguish all sites by four levels in [2]. Then, the probability in each level is reversely adapted to the number of levels predefined in sensor network.…”

Section: Table I Topology Parametersmentioning

confidence: 99%

Reliable Probabilistic Gossip over Large-Scale Random Topologies

Hu¹,

Jehl²

2017

Preprint

View full text Add to dashboard Cite

This paper studies reliability of probabilistic neighbor-aware gossip algorithms over three wellknown large-scale random topologies, namely Bernoulli (or Erdős-Rényi) graph, the random geometric graph, and the scale-free graph. We propose a new and simple algorithm which ensures higher reliability at lower message complexity than the three families of gossip algorithms over every topology in our study.We also present a uniform approach to model the reliability of probabilistic gossip algorithms in the different random graphs, whose properties, in fact, are quite different. In our model a forwarding probability is derived with consideration of parameters in gossip algorithms and graph properties. Our simulations show that our model gives a reasonable prediction of the trade-off between reliability and message complexity for all probabilistic neighbor-aware gossip algorithms in various random networks. Therefore, it allows to fine-tune the input parameters in the gossip protocols to achieve a desirable reliability with tolerable message complexity.

show abstract

“…The proposed method can significantly reduce the number of RREQ packets transmitted during route discovery operation. Similarly, in [5] the authors proposed a probabilistic method of flooding that adjusts the forwarding probability at a node using its local topological characteristics. Unlike the first two, Li Jian et al [6] proposed a Positional Attribute based Next-hop Determination Approach and identified the "next-hop racing" phenomena due to the random rebroadcast delay approach during the route discovery process.…”

Section: Related Workmentioning

confidence: 99%

A Novel Approach for Efficient Route Request Flooding in MANETs with Directional Antennas

Qian

Zhang²,

Wu³

et al. 2014

Proceedings of the 2nd International Conference on Soft Computing in Information Communication Technology

View full text Add to dashboard Cite

In recent years, using directional antennas to reduce the amount of interference and collisions in mobile ad hoc networks has become more and more popular. Due to the problem of broadcast storm caused by flooding route requests, a novel route request flooding approach called Hexagonal Flooding Strategy (HFS) for Ad Hoc networks using directional antennas is introduced in this paper. With directional antennas, the flooding of route request packets is limited among selected forwarding nodes. By constructing a honeycomb pattern, the forwarding nodes which form the honeycomb vertices are selected. The transmissions between forwarding nodes which form the honeycomb edges are reshaped according to certain rules to optimize flow directions. Through simulations we evaluate the performance of HFS using route discovery success rate, average number of nodes and forwardings involved in the route discovery process. Simulation results show that HFS can: (a) improve route discovery success rate, (b) reduce the number of nodes and forwardings involved in the route discovery process.

show abstract

Route discovery in wireless mobile ad hoc networks with adjusted probabilistic flooding

Cited by 8 publications

References 15 publications

Efficient Probabilistic Information Broadcast Algorithm over Random Geometric Topologies

Efficient Probabilistic Information Broadcast Algorithm over Random Geometric Topologies

Reliable Probabilistic Gossip over Large-Scale Random Topologies

A Novel Approach for Efficient Route Request Flooding in MANETs with Directional Antennas

Contact Info

Product

Resources

About