Advertisement

A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks

  • Orhan Dagdeviren
  • Kayhan Erciyes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4362)

Abstract

We propose a three layer software architecture for shared resource management in mobile ad hoc networks(MANETs). At the lowest layer, the Merging Clustering Algorithm(MCA)[11] partitions the MANET into a number of balanced clusters periodically. At the second layer, the Backbone Formation Algorithm(BFA) provides a virtual ring using the clusterheads found by MCA. Finally, an example resource management protocol which is a modified and scaled version of the Ricart-Agrawala algorithm implemented using the virtual ring structure is presented with the performance results.

Keywords

Minimum Span Tree Software Architecture Critical Section Mutual Exclusion Message Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Erciyes, K.: Distributed Mutual Exclusion Algorithms on a Ring of Clusters. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 518–527. Springer, Heidelberg (2004)Google Scholar
  2. 2.
    Erciyes, K.: Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 933–940. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. CACM 21, 558–565 (1978)zbMATHGoogle Scholar
  4. 4.
    Maekawa, M.: A sqrt(n) Algorithm for Mutual exclusion in Decentralized Systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)CrossRefGoogle Scholar
  5. 5.
    Raymond, K.: A Tree-Based Algorithm for Distributed Mutual Exclusion. ACM Trans. Comput. Systems 7(1), 61–77 (1989)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Ricart, G., Agrawala, A.: An Optimal Algorithm for Mutual Exclusion in Computer Networks. CACM 24(1), 9–17 (1981)MathSciNetGoogle Scholar
  7. 7.
    Shu, W.: An Efficient Distributed Token-Based Mutual Exclusion Algorithm with a Central Coordinator. Journal of Parallel and Distributed Processing 62(10), 1602–1613 (2002)zbMATHGoogle Scholar
  8. 8.
    Susuki, I., Kasami, T.: A Distributed Mutual Exclusion Algorithm. ACM Trans. Computer Systems 3(4), 344–349 (1985)CrossRefGoogle Scholar
  9. 9.
    Walter, J.E., Welch, J.L., Vaidya, N.H.: A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. Wireless Networks 7(6), 585–600 (2001)zbMATHCrossRefGoogle Scholar
  10. 10.
    Walter, J.E., Cao, G., Mohanty, M.: A K-way Mutual Exclusion Algorithm for Ad Hoc Wireless Networks. In: Proc. of the First Annual Workshop on Principles of Mobile Computing (2001)Google Scholar
  11. 11.
    Dagdeviren, O., Erciyes, K., Cokuslu, D.: A Merging Clustering Algorithm for Mobile Ad Hoc Networks. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3981, pp. 681–690. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Dagdeviren, O., Erciyes, K.: A distributed backbone formation algorithm for mobile ad hoc networks. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 219–230. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)Google Scholar
  14. 14.
    Chen, Y.P., Liestman, A.L.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks. In: Proc. 3rd ACM Int. Symp. Mobile Ad Hoc Net. and Comp., pp. 165–172 (2002)Google Scholar
  15. 15.
    Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs, Advanced Topics. Marcel Dekker, New York (1998)zbMATHGoogle Scholar
  16. 16.
    Grimaldi, R.P.: Discrete and Combinatorial Mathematics. An Applied Introduction. Addison-Wesley Longman, Reading (1999)zbMATHGoogle Scholar
  17. 17.
    Gallagher, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Transactions on Programming Languages and Systems 5, 66–77 (1983)CrossRefGoogle Scholar
  18. 18.
    Baldoni, R., Virgillito, A., Petrassi, R.: A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks. Computers and Communications, pp. 539–544 (2002)Google Scholar
  19. 19.
    Delmastro, F.: From Pastry to CrossROAD: CROSS-Layer Ring Overlay for Ad Hoc Networks. In: Third IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 60–64 (2005)Google Scholar
  20. 20.
    Yang, C.Z.: A Token-Based h-out of-k Distributed Mutual Exclusion Algorithm for Mobile Ad Hoc Networks. In: 3rd International Conference on Information Technology, pp. 73–77 (2005)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Orhan Dagdeviren
    • 1
  • Kayhan Erciyes
    • 1
  1. 1.Izmir Institute of Technology, Computer Engineering Department, Urla, Izmir 35340Turkey

Personalised recommendations