• Jun 04, 2019 News!IJIEE Vol. 9, No. 2 issue has been published online!   [Click]
  • May 14, 2019 News!Vol.7, No.5-Vol.8, no.2 has been indexed by EI (Inspec).   [Click]
  • Apr 15, 2019 News!Papers published in Vol.8, No.1-No.4 have all received dois from Crossref.
General Information
    • ISSN: 2010-3719 (Online)
    • Abbreviated Title: Int. J. Inf. Electron. Eng.
    • Frequency: Quarterly
    • DOI: 10.18178/IJIEE
    • Editor-in-Chief: Prof. Chandratilak De Silva Liyanage
    • Executive Editor: Jennifer Zeng
    • Abstracting/ Indexing : Google Scholar, Electronic Journals Library, Crossref and ProQuest, Ei (INSPEC, IET), EBSCO.
    • E-mail ijiee@ejournal.net

University of Brunei Darussalam, Brunei Darussalam   
" It is a great honor to serve as the editor-in-chief of IJIEE. I'll work together with the editorial team. Hopefully, The value of IJIEE will be well recognized among the readers in the related field."

IJIEE 2014 Vol.4(4): 288-292 ISSN: 2010-3719
DOI: 10.7763/IJIEE.2014.V4.450

Large Wireless Ad Hoc Network Clustering with End-to-End QoS Constraints Using Multiobjective Particle Swarm Optimization

Nasser M. Alsaedi and Dionysios Kountanis
Abstract— To scale for large ad hoc networks containing hundreds or even thousands of subnets, the networks must be hierarchically organized by partitioning them into clusters or domains. Many researchers have proposed partitioning of large networks into clusters, but this requires specifying cluster size bound. Graph Partitioning (GP) algorithms search for min-cut that balances the number of nodes in each partition. The limitations of GP algorithms are that they cannot be optimized for end-to-end performance requirements or take into account the characteristics of network topology. We propose a clustering algorithm based on the concept of Multiobjective Particle Swarm Optimization (MOPSO). Our algorithm minimizes the sum of the total hop count in each cluster and minimizes the edge-cut weight between clusters. Further, our algorithm provides quality of service (QoS) by taking into account end-to-end performance requirements. We find that minimizing the sum of the cluster hop count results in a balanced and bounded cluster size. For a given number of clusters, our clustering algorithm creates clusters with sizes closer to average size and avoids isolated nodes. In our study, the terms domain, cluster, and partition are used interchangeably.

Index Terms— Ad-hoc network clustering, QoS, bounded cluster size, hop count, multiobjective optimization.

The authors are with Computer Science Department of Western Michigan University, USA (e-mail: nasser.m.alsaedi@wmich.edu, dionysios.kountanis@wmich.edu).


Cite: Nasser M. Alsaedi and Dionysios Kountanis, " Large Wireless Ad Hoc Network Clustering with End-to-End QoS Constraints Using Multiobjective Particle Swarm Optimization," International Journal of Information and Electronics Engineering vol. 4, no. 4, pp. 288-292, 2014.

Copyright © 2008-2019. International Journal of Information and Electronics Engineering. All rights reserved.
E-mail: ijiee@ejournal.net