Predictive models to rebroadcast in mobile ad hoc networks

Williams, B.; Mehta, Dinesh P.; Camp, Tracy; Navidi, William

doi:10.1109/tmc.2004.25

Cited by 36 publications

(21 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although some analytical models have been presented for broadcasting schemes in wireless ad hoc networks, such as flooding [110,113], fixed probabilistic scheme [110,113], distance-based [126,113,125], counter-based [126,113,125], location-based [113], further work is needed to model the different types of probabilistic schemes presented in this survey. Only a few papers include analytical models for the proposed schemes such as [70,37].…”

Section: Open Challengesmentioning

confidence: 99%

A survey on probabilistic broadcast schemes for wireless ad hoc networks

et al. 2015

View full text Add to dashboard Cite

a b s t r a c tBroadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper.

show abstract

Section: Open Challengesmentioning

confidence: 99%

A survey on probabilistic broadcast schemes for wireless ad hoc networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…For example, in [29] replicated random walker strategies have been studied for various network topologies. Gossip strategies, under which messages are forwarded based on local information, e.g., [12], [30], [31], [32], [33], [34], [35], have also been on the edge of this research area for many years, e.g., for the design of network protocols.…”

Section: Past Related Workmentioning

confidence: 99%

Probabilistic flooding for efficient information dissemination in random graph topologies

2010

View full text Add to dashboard Cite

Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in unstructured peer-to-peer and other networks. A key challenge in using probabilistic flooding is the determination of the forwarding probability so that global network outreach is achieved while keeping the message overhead as low as possible. In this paper, by showing that a probabilistic flooding network, generated by applying probabilistic flooding to a connected random graph network, can be (asymptotically) "bounded" by properly parameterized random graph networks and by invoking random graph theory results, asymptotic values of the forwarding probability are derived guaranteeing (probabilistically) successful coverage, while significantly reducing the message overhead with respect to traditional flooding. Asymptotic expressions with respect to the average number of messages and the average time required to complete network coverage are also derived, illustrating the benefits of the properly parameterized probabilistic flooding scheme. Simulation results support the claims and expectations of the analytical results and reveal certain aspects of probabilistic flooding not covered by the analysis.

show abstract

“…Naive forwarding of the broadcast message by every node in a flat network results typically in many redundant copies, the so-called broadcast storm problem [18]. This broadcast storm problem can be addressed by limiting the number of nodes that forward broadcast messages [19,20]. The strategy of first clustering the network and then having only cluster leaders forward the route requests has been extensively examined through simulations, see for instance [14,10,21,22].…”

Section: R E L At E D W O R Kmentioning

confidence: 99%

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

Yang

Ritchie

Richa

et al. 2007

Wireless Pers Commun

View full text Add to dashboard Cite

Abstract. As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.

show abstract

Predictive models to rebroadcast in mobile ad hoc networks

Cited by 36 publications

References 12 publications

A survey on probabilistic broadcast schemes for wireless ad hoc networks

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Probabilistic flooding for efficient information dissemination in random graph topologies

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

Contact Info

Product

Resources

About