Reliable broadcast protocol independent of system parameters for ad hoc networks with liveness property

Authors:
Jerzy Brzeziński;Michał Kalewski;Cezary Sobaniec
Affiliations:
Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland
Venue:
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Year:
2012

Citing 10
Cited 0

Dynamic sets and their application in VDM

SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Fundamentals of fault-tolerant distributed computing in asynchronous environments

ACM Computing Surveys (CSUR)
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks

Mobile Networks and Applications
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

ACM SIGACT News
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Design and Performance-Study of Crash-Tolerant Protocols for Broadcasting and Reaching Consensus in MANETs

SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Guide to Wireless Ad Hoc Networks

Guide to Wireless Ad Hoc Networks
Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks

Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks
On time constraints of reliable broadcast protocols for ad hoc networks with the liveness property

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The MANET liveness property ensures that any partition in an ad hoc network is not permanently isolated. For networks that fulfil the property a few crash-tolerant broadcast protocols have been proposed. However, it has also been proved that the minimum time of direct connectivity between nodes, and thus the correctness of the protocols, depends on the total number of hosts in a network and on the total number of messages that can be disseminated by each node concurrently. In this paper, we propose an improved version of the reliable broadcast protocols that works correctly, even though the minimum time of direct connection between nodes allows them to exchange (send and respond to) at least only two messages, making the correctness of this protocol independent of system parameters.