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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boukerche, A. (ed.): lgorithms and Protocols for Wireless, 1st edn. Mobile Ad Hoc Networks. Wiley Series on Parallel and Distributed Computing. John Wiley & Sons (November 2008)
Brzeziński, J., Kalewski, M., Libuda, M.: A short survey of basic algorithmic problems in distributed ad hoc systems. Pro Dialog (Polish Information Processing Society Journal) 21, 29–46 (2006)
Brzeziński, J., Kalewski, M., Wawrzyniak, D.: On Time Constraints of Reliable Broadcast Protocols for Ad Hoc Networks with the Liveness Property. In: Wyrzykowski, R. (ed.) PPAM 2011, Part I. LNCS, vol. 7203, pp. 40–49. Springer, Heidelberg (2012)
Chandra, R., Ramasubramanian, V., Birman, K.P.: Anonymous gossip: Improving multicast reliability in mobile ad-hoc networks. In: Proceedings of the 21st International Conference on Distributed Computing Systems, ICDCS 2001, pp. 275–283. IEEE Computer Society Press (April 2001)
Gärtner, F.C.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Computing Surveys 31(1), 1–26 (1999)
Gilbert, S., Lynch, N.A.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51–59 (2002)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
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 Press (February 1993)
Luo, J., Eugster, P.T., Hubaux, J.P.: Route driven gossip: Probabilistic reliable multicast in ad hoc networks. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2003, pp. 2229–2239. IEEE Computer Society Press (April 2003)
Misra, S., Woungang, I., Misra, S.C. (eds.): Guide to Wireless Ad Hoc Networks. Computer Communications and Networks, 1st edn. Springer (February 2009)
Pagani, E., Rossi, G.P.: Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks. Mobile Networks and Applications 4(3), 175–192 (1999)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brzeziński, J., Kalewski, M., Sobaniec, C. (2012). Reliable Broadcast Protocol Independent of System Parameters for Ad Hoc Networks with Liveness Property. In: Li, XY., Papavassiliou, S., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2012. Lecture Notes in Computer Science, vol 7363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31638-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-31638-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31637-1
Online ISBN: 978-3-642-31638-8
eBook Packages: Computer ScienceComputer Science (R0)