RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks

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

doi:10.1109/srds.2007.4365680

Cited by 21 publications

(33 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where p is the forwarding probability calculated using (36) and n is the number of nodes interfering with each other's transmission. According to [77], the performance of CAREFOR is divided into three phases: 91) RTB transmission phase, in this phase the source node sends a Request-to-Broadcast (RTB) control packet, including local information such as the GPS coordinates, the number of neighbors, and the transmission power in order to calculate the radio transmission range.…”

Section: P Busy ð40þmentioning

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

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: P Busy ð40þmentioning

confidence: 99%

“…This packet is only used to inform the source node about the potential forwarders. Finally, CAREFOR algorithm also uses silencing mechanism based on the forwarding probability (36).…”

Section: P Busy ð40þmentioning

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

“…The work in [10] presents an extensive evaluation of flood control mechanisms as Blind [6], Gossip [7], Adaptive Gossip [9], FloorB [10] and MPR [8]. It evaluates the message delivery rate and saved forwarded messages of these mechanisms in several scenarios.…”

Section: Evaluation Of Flood Control Mechanismsmentioning

confidence: 99%

“…The control of these harmful effects of broadcast storms can be done through two different approaches: by selecting the forwarding nodes [6], [7], [8], [9], [10], called here flood control approach, or by ordering the forwarding nodes transmissions, called here scheduling approach. Although orthogonals, the two approaches have similarities, as shown in results of Sections III and V, since the scheduling approach implicitly assume the choice of only few nodes to forward messages.…”

Section: Introductionmentioning

confidence: 99%

Distributed broadcast scheduling in mobile ad hoc networks

Augusto

Rezende

2010

2010 the 9th IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net)

View full text Add to dashboard Cite

Abstract-Data and control messages broadcasting is a widely used mechanism in network applications and protocols, which can have latency requirements for the information delivery. One solution to achieve low latencies is to solve the Minimum-Latency Broadcast Scheduling (MLBS) problem. However, MLBS is a NP-Complete problem, thus some works propose approximation algorithms. This paper presents simulation results of wellknown flood control mechanisms over IEEE 802.11 scheduling (CSMA/CA), which show that simple heuristics can provide acceptable latencies. Thus, a distributed scheduling mechanism that requires only partial topology knowledge is proposed and evaluated when combined with flood control mechanisms on CSMA/CA and TDMA networks. Results show the good performance of the proposal compared to theoretical limits of centralized algorithms.

show abstract

“…This claim is supported by noticing that updates can be rapidly propagated using any algorithm aiming at reliable message delivery in MANETs (e.g. [30,14]). …”

Section: Update Propagationmentioning

confidence: 99%

Gossiping over storage systems is practical

Weatherspoon

Miranda

Iwanicki

et al. 2007

SIGOPS Oper. Syst. Rev.

View full text Add to dashboard Cite

International audienceGossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resources (e.g., intermittent network connectivity, limited bandwidth, constrained communication range, or limited battery power). We focus on persistent storage systems that, unlike mere caches, are responsible for both the durability and the consistency of data. Examples of such systems may be encountered in many different environments, in particular: wide-area networks (constrained by limited bandwidth), wireless sensor networks (characterized by limited resources), and mobile ad hoc networks (suffering from intermittent connectivity). In this paper, we demonstrate the qualities of gossiping in these three respective environments

show abstract

RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks

Cited by 21 publications

References 0 publications

A survey on probabilistic broadcast schemes for wireless ad hoc networks

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Distributed broadcast scheduling in mobile ad hoc networks

Gossiping over storage systems is practical

Contact Info

Product

Resources

About