On Reliable Dissemination in Wireless Ad Hoc Networks

Drabkin, V.; Friedman, Roy; Kliot, Gabriel; Segal, Michael

doi:10.1109/tdsc.2010.54

Cited by 22 publications

(25 citation statements)

References 36 publications

(70 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mechanism of CAREFOR algorithm to avoid collisions is to compare the results of the collision threshold (37) with the collision probability at each node, which can be calculated as:…”

Section: Dg Reina Et Al / Ad Hoc Network XXX (2014) Xxx-xxxmentioning

confidence: 99%

“…In RAPID scheme [36,37], deterministic and probabilistic broadcast are combined to ensure successful delivery of messages in ad hoc networks [36,37]. First, the authors proposed that the forwarding probability in probabilistic schemes should be inversely proportional to the number of neighbors of a given node.…”

Section: Dg Reina Et Al / Ad Hoc Network XXX (2014) Xxx-xxxmentioning

confidence: 99%

“…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]. Most of the proposed schemes are based on heuristics.…”

Section: Open Challengesmentioning

confidence: 99%

See 2 more Smart Citations

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

“…The mechanism of CAREFOR algorithm to avoid collisions is to compare the results of the collision threshold (37) with the collision probability at each node, which can be calculated as:…”

Section: Dg Reina Et Al / Ad Hoc Network XXX (2014) Xxx-xxxmentioning

confidence: 99%

Section: Dg Reina Et Al / Ad Hoc Network XXX (2014) Xxx-xxxmentioning

confidence: 99%

Section: Open Challengesmentioning

confidence: 99%

See 1 more Smart Citation

A survey on probabilistic broadcast schemes for wireless ad hoc networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Though regional gossip can constrain the flooding within a certain region, it is still costly in terms of network resources. Vadim et al, [10] propose three common approaches for achieving scalable reliable broadcast in wireless ad hoc networks, namely probabilistic flooding, counter-based broadcast, and lazy gossip. The strength and weaknesses of each scheme are analyzed, and a new protocol that combines these three techniques is developed.…”

Section: Related Workmentioning

confidence: 99%

Reliable Adaptive Replication Routing for Wireless Sensor Networks

PrakashT¹,

Raja²,

Venugopal³

2015

IJCA

View full text Add to dashboard Cite

In this paper, we consider the problem of reliable communication, the packet-loss prevention and packet-loss recreation recovery techniques are widely used and have many practical challenges. Hence, we propose a Reliable Adaptive Replication Routing (RARR) Algorithm, here the packet loss replication is accomplished in several hops and End-to-End (E2E) reliability is improved compared to conventional single E2E paths. RARR algorithm is comprised of a link capacity estimator, random disseminator and a replicator. The protocol employs an adaptive neighbor knowledge scheme which differentiates the density of nodes in the deployed scenario and hence reduces the overheads compared to the existing Proliferation Routing scheme. Simulation results demonstrate the effectiveness of this scheme and show that the proposed protocol is a feasible solution to increase the service quality (i.e., E2E transmission success rate, energy efficiency) compared with the well-known routing techniques. The proposed protocol is scalable and practical, and it dynamically adapts to the network topology.

show abstract

“…Recently, the idea about cooperative communications among vehicles was proposed to make the driving experience safer and more comfortable [3,4]. VANET is a special ad-hoc network that equips vehicles with wireless communications devices [5,6]. Hence, vehicles can "talk" with each other (i.e., vehicle-to-vehicle), infrastructure (i.e., vehicle to infrastructure), and road side units (RSU), and the traffic information can be shared among them.…”

Section: Introductionmentioning

confidence: 99%

Historical Spectrum Sensing Data Mining for Cognitive Radio Enabled Vehicular Ad-Hoc Networks

Huang

et al. 2016

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

In vehicular ad-hoc network (VANET), the reliability of communication is associated with driving safety. However, research shows that the safety-message transmission in VANET may be congested under some urgent communication cases. More spectrum resource is an effective way to solve transmission congestion. Hence, we introduce cognitive radio enabled VANET (CR-VANET), where CR device can detect possible idle spectrum for VANET communications and assist to timely broadcast safety-message. Given high-speed mobility of vehicles and dynamically-changing availability of channels, a novel prediction algorithm is proposed to pick out the channel with the greatest probability of availability, which can meet the quality of service (QoS) requirement of urgent communications and effectively avoid conflict with licensed users. Specifically, the spatiotemporal correlations among historical spectrum sensing data are exploited to form prior knowledge of channel availability probability, and Bayesian inference is used to derive posterior probability of channel availability. Comparing with other spectrum detection methods, the proposed algorithm has more than 8% detection performance improvement at false alarm probability 0.2, and thus can avoid access conflict with licensed users dramatically. Furthermore, the proposed algorithm always has larger packet reception probability (PRP) and lower transmission delay compared with conventional VANET broadcasting. Hence, the proposed algorithm can improve reliability of safety-message transmission and enhance driving safety significantly.

show abstract

On Reliable Dissemination in Wireless Ad Hoc Networks

Cited by 22 publications

References 36 publications

A survey on probabilistic broadcast schemes for wireless ad hoc networks

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Reliable Adaptive Replication Routing for Wireless Sensor Networks

Historical Spectrum Sensing Data Mining for Cognitive Radio Enabled Vehicular Ad-Hoc Networks

Contact Info

Product

Resources

About