Abstract
The article proposes a token based algorithm to ensure mutual exclusion in clustered vehicular ad hoc networks (VANETs). Since our scheme is dual token based, it handles the token passing among the processes at the inter-cluster level and intra-cluster level in separate manners, which makes the approach suitable for strategic VANET environment. In the interest of efficiency, we implement a centralized scheme at intra-cluster level. The centralized schemes are inherently failure prone, thus, we also attempt to make the intra-cluster token passing fault tolerant. In order to enhance reliability, we have applied a distributed scheme at inter-cluster level. More importantly, the message complexity turns out not only to be independent of N, the total number of nodes in the system; rather, under heavy load, it is inversely proportional to n, the (average) number of nodes per each cluster. We also present the complexity analysis and correctness proof of the protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Raynal, M.: A simple taxonomy for distributed mutual exclusion algorithms. ACM SIGOPS Operating Systems Review 25(2), 47–50 (1991)
Singhal, M.: A taxonomy for distributed mutual exclusion. Journal of Parallel and Distributed Computing 18, 94–101 (1993)
Saxena, P.C., Rai, J.: A survey of permission-based mutual exclusion algorithms. Journal of Computer Standards and Interface 25(2), 159–181 (2003)
Badrinath, B.R., Acharya, A., Imielinski, T.: Designing distributed algorithms for mobile computing networks. Computer Communications 19, 309–320 (1996)
Ghosh, R.K., Mohanty, H.: On restructuring distributed algorithms for mobile computing. In: Das, S.K., Bhattacharya, S. (eds.) IWDC 2002. LNCS, vol. 2571, pp. 224–233. Springer, Heidelberg (2002)
Benchaiba, M., et al.: Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview. ACM SIGOPS Operating Systems Review 38(1), 74–89 (2004)
Sharma, B., et al.: DMX in MANETs: Major Research Trends Since 2004. In: Int. Conf. on Advances in Computing and Artificial Intelligence, ACAI 2011 (to appear, 2011)
Hartenstein, H., Laberteaux, K.P.: A tutorial survey on vehicular ad hoc networks. IEEE Communications Magazine, 164–171 (June 2008)
Nekoui, M., Pishro-Nik, H.: Fundamental tradeoffs in vehicular ad hoc networks. In: 7th ACM International Workshop on Vehicular Internetworking, VANET 2010, pp. 91–96 (2010)
Kumar, V., Place, J., Yang, G.-C.: An efficient algorithm for mutual exclusion using queue migration in computer networks. IEEE Trans. Knowledge and Data Engineering 3(3), 380–384 (1991)
Chaudhury, P., Edward, T.: An O(\(\sqrt{n}\)) distributed mutual exclusion algorithm using queue migration. Journal of Universal Computer Science 12(2), 142–159 (2006)
Baldoni, R., Virgillito, A., Petrassi, R.: A distributed mutual exclusion algorithm for mobile ad hoc networks. In: 7th IEEE Symposium on Computer and Communications (ISCC 2002), pp. 539–545 (July 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharma, B., Bhatia, R.S., Singh, A.K. (2011). An O(1/n) Protocol for Supporting Distributed Mutual Exclusion in Vehicular Ad Hoc Networks. In: Nagamalai, D., Renault, E., Dhanuskodi, M. (eds) Advances in Parallel Distributed Computing. PDCTA 2011. Communications in Computer and Information Science, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24037-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-24037-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24036-2
Online ISBN: 978-3-642-24037-9
eBook Packages: Computer ScienceComputer Science (R0)