On Time Constraints of Reliable Broadcast Protocols for Ad Hoc Networks with the Liveness Property
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.
KeywordsNeighbouring Node Minimum Time Mobile Host Broadcast Message Liveness Property
Unable to display preview. Download preview PDF.
- 1.Barbeau, M., Kranakis, E.: Principles of Ad-hoc Networking, 1st edn. John Wiley & Sons (April 2007)Google Scholar
- 4.Guerraoui, R., Rodrigues, L.: Introduction to Reliable Distributed Programming, 1st edn. Springer-Verlag New York, Inc. (April 2006)Google Scholar
- 5.Liu, S., McDermid, J.A.: Dynamic sets and their application in VDM. In: Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing (SAC 1993), pp. 187–192. ACM (February 1993)Google Scholar
- 7.Vollset, E.W.: Design and Evaluation of Crash Tolerant Protocols for Mobile Ad-hoc Networks. Ph.D. thesis, University of Newcastle Upon Tyne (September 2005)Google Scholar
- 8.Vollset, E.W., Ezhilchelvan, P.D.: Design and performance-study of crash-tolerant protocols for broadcasting and supporting consensus in MANETs. In: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), pp. 166–178. IEEE Computer Society (October 2005)Google Scholar