RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks

Bar-Yossef, Ziv; Friedman, Roy; Kliot, Gabriel

doi:10.1145/1365815.1365817

Cited by 63 publications

(67 citation statements)

References 45 publications

(54 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A generic framework for presenting gossip protocols was proposed in [19], and in particular highlighted the advantages of designing gossiping protocols using a pull-push approach for higher reliability. This framework was later extended to ad-hoc networks in [2], [10]. An example of a protocol for ad-hoc networks that uses a pull-push approach and is easily expressed in the above framework is [27].…”

Section: Related Workmentioning

confidence: 99%

“…Loosely speaking, the three most common techniques for obtaining this in ad-hoc networks are probabilistic flooding, e.g., [14], [26], in which the decision of a node to rebroadcast depends on some locally computable probabilistic mechanism, counter based approaches (and its derivatives such as distance-based and location-based forwarding), e.g., [6], [14], [40], [41], in which rebroadcasting a message depends on the number of retransmissions the node hears in its neighborhood, and lazy gossip [19], [22], in which nodes periodically gossip with their neighbors about the ids of messages they have received and request missing messages from them. 2 Previous analysis of probabilistic flooding [14], [33] has taught us that in order to obtain reasonable reliability level in a fixed probability protocol, one has to set the forwarding probability to very high values. The latter means that for very high reliability, this scheme becomes almost as wasteful as flooding.…”

Section: Introductionmentioning

confidence: 99%

“…It indicates that RAPID sends a small number of messages compared to other known alternatives and guarantees high reliability with any topology. The protocol is also computationally very efficient, and highly resilient to mobility, 2 Notice that probabilistic flooding protocols, such as GOSSIP3 [14], are often referred to as (active) push based gossip. A transmission by a node s can be received by all nodes within its transmission range: p, n 1 , ...,n k failures, and selfishness (and even some forms of malicious behavior), due to its probabilistic nature, the reliance on local information only, and the gossip mechanism.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On Reliable Dissemination in Wireless Ad Hoc Networks

Drabkin

Friedman

Kliot

et al. 2011

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Abstract-Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. This paper studies three common approaches for achieving scalable reliable broadcast in 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, called RAPID, is developed.Specifically, the analysis in this paper focuses on the tradeoffs between reliability (percentage of nodes that receive each message), latency, and the message overhead of the protocol. Each of these methods excel in some of these parameters, but no single method wins in all of them. This motivates the need for a combined protocol that benefits from all of these methods and allows to trade between them smoothly. Interestingly, since the RAPID protocol only relies on local computations and probability, it is highly resilient to mobility and failures and even selfish behavior. By adding authentication, it can even be made malicious tolerant.Additionally, the paper includes a detailed performance evaluation by simulation. The simulations confirm that RAPID obtains higher reliability with low latency and good communication overhead compared with each of the individual methods.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Reliable Dissemination in Wireless Ad Hoc Networks

Drabkin

Friedman

Kliot

et al. 2011

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

show abstract

“…Distributed algorithms that maintain a list of k n neighbors selected at random has been recently investigated with reference to ad hoc networks in [2]. The authors introduce an algorithm (that we indicate as reverse sampling) that, transposed in our environment, consists in replacing one of the neighbors with the one that executed a two-way session m token passing events ago, the m parameter being around 10 for very large networks.…”

Section: Algorithmmentioning

confidence: 99%

Preventing the Collision of Requests From Slave Clocks in the Precision Time Protocol (PTP)

Ciuffoletti

2011

IEEE Trans. Instrum. Meas.

View full text Add to dashboard Cite

Abstract-The Precision Time Protocol (PTP) distributes a time reference across a network: it specifically addresses demanding environments, where it can reach sub microsecond precision using appropriate technologies. Its scalability is primarily limited by message packet delay variations induced by packet collisions.While it is possible to avoid collisions with non-PTP packets using appropriate traffic management technologies, collision between PTP packets is an open problem in large systems with critical clock precision requirements.We propose a coordination algorithm that avoids the occurrence of such collisions. It assumes the availability of a multicast facility from the timing reference source, the master clock, to all the slaves: this is not a restrictive hypotesis since PTP itself takes advantage of this kind of connectivity, and it is also compatible with typical wireless environments.The algorithm operates without introducing additional traffic, it ensures an upper bound to the time between two successive synchronizations of any given slave, it does not alter the structure of the standard PTP messages, it envisions a dynamic number of slaves, it tolerates the replacement of the master with a hot spare in case of failure, and does not rely on specialized hardware.The algorithm has a footprint that does not insist on activities that are already time sensitive, and its operation is mostly concentrated on the master.The algorithm inherits the security and fault tolerance limits of PTP: in particular this refers to malicious nodes, and to broken devices that may jam the network.

show abstract

“…To secure this operation the data passed during directories synchronization must be authenticated: requirement iv) gives the basis for this. Concerning directory synchronization, the interested reader finds an applicable result in [1]. We do not discuss further the issue, that falls outside the scope of this paper.…”

Section: A Case Studymentioning

confidence: 99%

Secure token passing at application level

Ciuffoletti

2010

Future Generation Computer Systems

View full text Add to dashboard Cite

We introduce an application level implementation of a token passing operation. After an introduction that explains the conceptual principles, we describe exhaustively the state machines that implement our solution. The security requirements are carefully considered, since the token is a sensitive resource, but without introducing scalability limits.We aim at a general purpose token passing primitive: we do not enter the domain of the distributed coordination algorithms that can be implemented using the proposed operation. We discuss its practical utilization, and we indicate as primary application area the coordination of servers in a distributed infrastructure: this matches service oriented Grids as well as other emerging paradigms.Its usage is explained with a simplified use case. A working prototype exists, and we report about experimental results that confirm our claims concerning performance.

show abstract

RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks

Cited by 63 publications

References 45 publications

On Reliable Dissemination in Wireless Ad Hoc Networks

On Reliable Dissemination in Wireless Ad Hoc Networks

Preventing the Collision of Requests From Slave Clocks in the Precision Time Protocol (PTP)

Secure token passing at application level

Contact Info

Product

Resources

About