Clustering In Mobile Wireless Ad Hoc Networks

Issues and Approaches
  • Ekram Hossain
  • Rajesh Palit
  • Parimala Thulasiraman
Part of the Information Technology: Transmission, Processing and Storage book series (ITTP)

Abstract

Wireless mobile ad hoc networks consist of mobile nodes which can communicate with each other in a peer-to-peer fashion (over single hop or multiple hops) without any fixed infrastructure such as access point or base station. In a multi-hop ad hoc wireless network, which changes its topology dynamically, efficient resource allocation, energy management, routing and end-to-end throughput performance can be achieved through adaptive clustering of the mobile nodes. Impacts of clustering on radio resource management and protocol performance in a multi-hop ad hoc network are described, and a survey of the different clustering mechanisms is presented. A comparative performance analysis among the different clustering mechanisms based on the metrics such as cluster stability, load distribution, control signaling overhead, energy-awareness is performed.

Keywords

Mobile ad hoc networks adaptive clustering radio resource management routing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Hubaux, J.-P, T. Gross, J.-Y. L. Boudec, and M. Vetterli, “Towards self-organized mobile ad hoc networks: The terminodes project,” IEEE Communications Magazine, pp. 118–124, Jan. 2001.Google Scholar
  2. [2]
    McDonald, A. B., and T. F. Znati, “A mobility-based framework for adaptive clustering in wireless ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1466–1487, Aug. 1999.CrossRefGoogle Scholar
  3. [3]
    Min, R., M. Bhardwaj, S.-H. Cho, N. Ickes, E. Shih, A. Sinha, A. Wang, and A. Chandraksan, “Energy-centric enabling technologies for wireless sensor networks,“ IEEE Wireless Communications, Aug. 2002.Google Scholar
  4. [4]
    Richard, C. L., and M. Gerla, “Adaptive clustering for mobile wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 7, pp.1265–1275, Sept. 1997.Google Scholar
  5. [5]
    Hou, T.-C., and T.-J. Tsai, “An access-based clustering protocol for multihop wireless ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 19, no. 7, July 2001.Google Scholar
  6. [6]
    Chen, W., N. Jain, and S. Singh, “ANMP: Ad hoc network management protocol,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1506–1531, Aug. 1999.Google Scholar
  7. [7]
    Gerla, M., and J. T.-C. Tsai, “Multicluster, mobile, multimedia radio network,” ACM/Baltzer Wireless Networks, vol. 1, no. 3, pp. 255–265, 1995.Google Scholar
  8. [8]
    Amis, A. D., R. Prakash, T. H. P. Vuong, and D. T. Huynh, “Max-min D-cluster formation in wireless ad hoc networks,” Proc. IEEE INFOCOM’2000, pp. 32–41.Google Scholar
  9. [9]
    Fernandess, Y., and D. Malkhi, “K-clustering in wireless ad hoc networks,” Proc. ACM POMC’ 2002, Oct. 30–31, 2002, Toulose, France, pp. 31–37.Google Scholar
  10. [10]
    Chhaya, H.S., and S. Gupta, “Performance of asynchronous data transfer methods for IEEE 802.11 MAC protocol,” IEEE Personal Communications Magazine, pp. 8–15, Mar. 1996.Google Scholar
  11. [11]
    Garcia-Luna-Aceves, J. J., and J. Raju, “Distributed assignment of codes for multihop packet-radio networks,” Proc. IEEE MILCOM 1997.Google Scholar
  12. [12]
    Rodoplu, V., and T. H. Meng, “Minimum energy mobile wireless networks,” IEEE Journal on Selected Areas in Communications, pp. 1333–1344, Aug. 1999.Google Scholar
  13. [13]
    Chiang, C.-C., H.-K. Wu, and M. Gerla, “Routing in clustered multihop, mobile wireless networks with fading channel,” Computer Science Department, UCLA.Google Scholar
  14. [14]
    Krishna, P., N. H. Vaidya, M. Chatterjee, and D. K. Pradhan, “A cluster-based approach for routing in dynamic networks,” Computer Communications Review, vol. 17, no. 2, Apr. 1997. http://www.acm.org/sigs/sigcomm/ccr/archive/1997/apr97/ccr-9704-krishna.pdf
  15. [15]
    Sinha, P., R. Sivakumar, and V. Bharghavan, “CEDAR: A core-extraction distributed routing algorithm,” Proc. IEEE INFOCOM’ 1999, vol. 1, pp. 202–209.Google Scholar
  16. [16]
    Krishnan, R., R. Ramanathan, and M. Steenstrup, “Optimization algorithms for large self-structuring networks,” Proc. IEEE INFOCOM’ 1999, vol. 1, pp. 71–78.Google Scholar
  17. [17]
    Toh, C.-K., Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall, 2001.Google Scholar
  18. [18]
    Camp, T., J. Boleng, and V. Davies, “A survey of mobility models for ad hoc network research,” Wireless Communications and Mobile Computing, vol. 2, pp. 483–502, 2002.CrossRefGoogle Scholar
  19. [19]
    Siddiqui, A., and R. Prakash, “Modeling, performance measurement, and control of clustering mechanisms for multi-cluster mobile ad hoc networks,” Technical Report (UTDCS-16-01), Department of Computer Science, University of Texas at Dallas.Google Scholar
  20. [20]
    Baker, D. J., and A. Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Transactions on Communications, COM-29(11), pp. 1694–1701, Nov. 1981.CrossRefGoogle Scholar
  21. [21]
    Kwon, T. J., and M. Gerla, “Clustering with power control,” Proc. IEEE MILCOM’ 1999.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Ekram Hossain
    • 1
  • Rajesh Palit
    • 1
  • Parimala Thulasiraman
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of ManitobaWinnipegCanada
  2. 2.Department of Computer ScienceUniversity of ManitobaWinnipegCanada

Personalised recommendations