• DocumentCode
    1986482
  • Title

    A Cluster-Head Selection and Update Algorithm for Ad Hoc Networks

  • Author

    Wu, Hao ; Zhong, Zhangdui ; Hanzo, Lajos

  • Author_Institution
    State Key Lab. of Rail Traffic Control & Safety, Beijing Jiaotong Univ., Beijing, China
  • fYear
    2010
  • fDate
    6-10 Dec. 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    A novel cluster-head selection and update algorithm "Type-based Cluster-forming Algorithm (TCA)" is proposed, which outperforms both the lowest node ID (LID) and the Weighted Clustering Algorithm (WCA) in the ad hoc network scenario considered. The system\´s performance is investigated in a scenario, when the 50 communicating nodes belong to three different groups, for example, a group of rescue workers, fire-fighters and paramedics. It is demonstrated that the carefully designed protocol is capable of outperforming the above-mentioned benchmarkers both in terms of a reduced number of cluster-head updates and cluster-change events. Hence its quality-of-service may be deemed higher.
  • Keywords
    ad hoc networks; pattern clustering; quality of service; LID; TCA; WCA; ad hoc networks; carefully designed protocol; cluster-change events; cluster-head selection; lowest node ID; quality-of-service; type-based cluster-forming algorithm; update algorithm; weighted clustering algorithm; Ad hoc networks; Algorithm design and analysis; Clustering algorithms; IP networks; Mobile communication; Peer to peer computing; Stability analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
  • Conference_Location
    Miami, FL
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-5636-9
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2010.5683416
  • Filename
    5683416