A survey on probabilistic broadcast schemes for wireless ad hoc networks

Reina, Daniel Gutiérrez; Toral, S. L.; Johnson, Princy; Barrero, F.

doi:10.1016/j.adhoc.2014.10.001

Cited by 137 publications

(99 citation statements)

References 110 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This is an all-to-all communication procedure by which each node in the network retransmits the incoming packets at least once. Broadcasting algorithms for MANETs have also been widely studied [10,11]. Regarding the wireless technology used in MANETs, IEEE 802.11 a/b/g or WiFi has been the preferred technology to be used.…”

Section: Manetsmentioning

confidence: 99%

“…Broadcasting is basic all-toall communication mechanism widely used in MANETs [69]. The main objective of a broadcasting algorithm is to efficiently disseminate a message throughout the network.…”

Section: Broadcasting Algorithmsmentioning

confidence: 99%

“…The main objective of a broadcasting algorithm is to efficiently disseminate a message throughout the network. Despite its simplicity, the design of broadcasting algorithms has drawn the attention of the ad hoc community for the last two decades [69,70]. The simplest broadcasting algorithm called flooding has been demonstrated many times to be inefficient, causing the well-known broadcast storm problem [71].…”

Section: Broadcasting Algorithmsmentioning

confidence: 99%

See 2 more Smart Citations

A Survey on the Application of Evolutionary Algorithms for Mobile Multihop Ad Hoc Network Optimization Problems

Reina

Ruiz

Ciobanu

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Evolutionary algorithms are metaheuristic algorithms that provide quasioptimal solutions in a reasonable time. They have been applied to many optimization problems in a high number of scientific areas. In this survey paper, we focus on the application of evolutionary algorithms to solve optimization problems related to a type of complex network like mobile multihop ad hoc networks. Since its origin, mobile multihop ad hoc network has evolved causing new types of multihop networks to appear such as vehicular ad hoc networks and delay tolerant networks, leading to the solution of new issues and optimization problems. In this survey, we review the main work presented for each type of mobile multihop ad hoc network and we also present some innovative ideas and open challenges to guide further research in this topic.

show abstract

Section: Manetsmentioning

confidence: 99%

Section: Broadcasting Algorithmsmentioning

confidence: 99%

Section: Broadcasting Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on the Application of Evolutionary Algorithms for Mobile Multihop Ad Hoc Network Optimization Problems

Reina

Ruiz

Ciobanu

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…17 Convergence of data message propagation and inhibition in proposed endcast scheme Table 6 Order of expiring chalone wait and inhibitor wait (e.g., h0 has the smallest wait and h20 has the largest wait) Node h0 h1 h2 h3 h4 h5 h6 h7 h8 h9 h10 h11 h12 h13 h14 h15 h16 h17 h18 h19 RADorder 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Redundancy overhead (ROH uf ): We refer to redundant copies of the same data frame accumulated in the network as redundancy overhead for endcast by modifying the metric ROH used by Reina et. al [30].…”

Section: Simulation Study Of the Proposed Endcast Schemementioning

confidence: 99%

Endcast: mobile stateless data delivery in MANETs

Sooriyaarachchi

Gamage

2017

J Wireless Com Network

View full text Add to dashboard Cite

MANETs are networks of mobile devices for multihop communication without a separate infrastructure for routing and control. If robust protocols are available, MANETs can exploit the true ubiquity of everyday mobile devices for application scenarios such as collaborative learning, multiplayer gaming, adaptive advertising as well as in disaster management and battlefield communication. Traditional schemes such as reactive, proactive and hybrid routing incur costs of often O(n 2 ) for discovering and maintaining routes or node hierarchies for networks with n number of nodes. These routes or node structures become obsolete rapidly due to MANET dynamics resulting from mobility, limited battery life, and impairments of wireless links. These traditional approaches are based on a paradigm that we refer to as fixed-stateful routing. The routing paradigm that best matches the ubiquity of devices in a MANET is mobile-stateless routing. In mobile-stateless routing, nodes do not keep global network states or play special roles as control nodes. We propose flooding as an end to end packet delivery mechanism and introduce the concept of endcast that allows the communication from a single source to a single destination in which the data is carried by controlled flooding and the data propagation is inhibited after reaching the destination. Problem statement: Simple flooding causes excessive packet redundancy resulting in collisions and contention which is known as broadcast storm problem. We introduce the term broadcast flood problem to refer to the propagation of data beyond the destination in flooding operation. This research is aimed at modeling endcast and developing an endcast scheme to enable MANET nodes to perform end to end communication in mobile-stateless manner. Solution:We built a theoretical model to analyze the endcast concept. This model includes methods to quantify broadcast storm problem and broadcast flood problem. Based on this model, we proposed an endcast scheme that controls the storm situation using counter-based flooding and the flood situation using negative acknowledgement packets. The storm control scheme is inspired by the chalone mechanism that regulates growth of biological organs. The proposed scheme is in the mobile-stateless routing paradigm because the nodes keep only a set of local states in the form of a log of received data packets and the nodes do not act as infrastructure nodes. We apply the theoretical model on the proposed endcast scheme to validate its correctness and simulations were done to verify the performance.

show abstract

“…According to Kim et al, (2004) the performance of neighbor based methods were better than area based methods and the performance of an area based were better than probability based methods. There are many probability based rebroadcasting approaches available in the literature (Reina et al, 2015). Some of the probability based approaches take the advantages of neighbor information as next-hop coverage and node density for their broadcasting decisions.…”

Section: Introductionmentioning

confidence: 99%