A Distributed Backbone Formation Algorithm for Mobile Ad Hoc Networks

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


Construction of a backbone architecture is an important issue in mobile ad hoc networks(MANET)s to ease routing and resource management. We propose a new fully distributed algorithm for backbone formation in MANETs that constructs a directed ring architecture. We show the operation of the algorithm, analyze its message complexity and provide results in the simulation environment of ns2. Our results conform that the algorithm is scalable in terms of its running time and round-trip delay against mobility, surface area, number of nodes and number of clusterheads.


Mobile Node Member Node Message Complexity Backbone Node Mutual Exclusion Algorithm 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Yu, J.Y., Chong, P.H.J.: A survey of clustering schemes for mobile ad hoc networks. In: Proc. IEEE Communications Surveys and Tutorials, pp. 1553–1877 (2005)Google Scholar
  2. 2.
    Wu, J., Li, H.L.: On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In: Proc. 3rd Int’l. Wksp. Discrete Algorithms and Methods for Mobile Comp. and Commun., p. 714 (1999)Google Scholar
  3. 3.
    Chen, Y.-Z.P., Liestman, A.L.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks. In: Proc. 3rd ACM Int’l. Symp. Mobile Ad Hoc Net. and Comp., pp. 165–172 (2002)Google Scholar
  4. 4.
    Cokuslu, D., Erciyes, K., Dagdeviren, O.: A Dominating Set Based Clustering Algorithm for Mobile Ad hoc Networks. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 571–578. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Das, B., Bharghavan, V.: Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets. In: Proc. IEEE ICC 1997, vol. 33(2), pp. 376–380 (1997)Google Scholar
  6. 6.
    Das, B., Sivakumar, R., Bharghavan, V.: Routing in Ad Hoc Networks Using a Spine. Proc. IEEE Int’l. Comp. and Commun. Net. 1997 1997, 120 (1997)Google Scholar
  7. 7.
    Lin, C.R., Gerla, M.: Adaptive Clustering for Mobile Wireless Networks. IEEE JSAC 15, 1265–1275 (1997)Google Scholar
  8. 8.
    Chiang, C.-C., et al.: Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel. In: Proc. IEEE SICON 1997 (1997)Google Scholar
  9. 9.
    Yu, J.Y., Chong, P.H.J.: 3hBAC (3-hop between Adjacent Clusterheads): a Novel Non-overlapping Clustering Algorithm for Mobile Ad Hoc Networks. In: Proc. IEEE Pacrim 2003, vol. 1, pp. 318–321 (2003)Google Scholar
  10. 10.
    Kwon, T.J., et al.: Efficient Flooding with Passive Clustering – an Overhead-Free Selective Forward Mechanism for Ad Hoc/Sensor Networks. Proc. IEEE 91(8), 1210–1220 (2003)CrossRefGoogle Scholar
  11. 11.
    MaDonald, A.B., Znati, T.F.: A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks. IEEE JSAC 17, 1466–1487 (1999)Google Scholar
  12. 12.
    Basu, P., Khan, N., Little, T.D.C.: A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks. Proc. IEEE ICDCSW 2001, 413–418 (2001)Google Scholar
  13. 13.
    McDonald, A.B., Znati, T.F.: Design and Performance of a Distributed Dynamic Clustering Algorithm for Ad-Hoc Networks. In: Proc. 34th Annual Simulation Symp., pp. 27–35 (2001)Google Scholar
  14. 14.
    Amis, A.D., Prakash, R.: Load-Balancing Clusters in Wireless Ad Hoc Networks. In: Proc. 3rd IEEE ASSET 2000, pp. 25–32 (2000)Google Scholar
  15. 15.
    Wu, J., et al.: On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. J. Commun. and Networks 4(1), 59–70 (2002)Google Scholar
  16. 16.
    Ryu, J.-H., Song, S., Cho, D.-H.: New Clustering Schemes for Energy Conservation in Two-Tiered Mobile Ad-Hoc Networks. In: Proc. IEEE ICC 2001, vol. 3, pp. 862–866 (2001)Google Scholar
  17. 17.
    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
  18. 18.
    Ohta, T., Inoue, S., Kakuda, Y.: An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks. In: Proc. 6th ISADS 2003 (2003)Google Scholar
  19. 19.
    Chatterjee, M., Das, S.K., Turgut, D.: An On-Demand Weighted Clustering Algorithm (WCA) for Ad hoc Networks. In: Proc. IEEE Globecom 2000, pp. 1697–1701 (2000)Google Scholar
  20. 20.
    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)CrossRefGoogle Scholar
  21. 21.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Orhan Dagdeviren
    • 1
  • Kayhan Erciyes
    • 1
  1. 1.Computer Eng. Dept.Izmir Institute of TechnologyUrlaTurkey

Personalised recommendations