On time constraints of reliable broadcast protocols for ad hoc networks with the liveness property

Authors:
Jerzy Brzeziński;Michał Kalewski;Dariusz Wawrzyniak
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:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Year:
2011

Citing 7
Cited 1

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
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

ACM SIGACT News
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
Introduction to Reliable Distributed Programming

Introduction to Reliable Distributed Programming
Principles of Ad-hoc Networking

Principles of Ad-hoc Networking

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

ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider a formal model of ad hoc systems and its liveness property, defined with the use of the concept of dynamic sets. In this context we analyse reliable broadcast protocols dedicated for use in this kind of networks. In solutions proposed till now it is assumed that the minimum time of direct connectivity between any neighbouring nodes is much longer than maximum message transmission time. This assumption covers, however, dependence of the required minimum time of direct communication on some system parameters. Therefore, in this paper we show precisely how the minimum time of direct connectivity 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.