• DocumentCode
    2375789
  • Title

    An improved clustering algorithm based on intersecting circle structure

  • Author

    Ze-Jun Yang ; Ying-long Wang ; Fu-Meng Zhao ; Tai-Bo Huang

  • Author_Institution
    Shandong Province Key Network Lab., Shandong Comput. Sci. Center, Jinan, China
  • fYear
    2012
  • fDate
    23-25 May 2012
  • Firstpage
    622
  • Lastpage
    625
  • Abstract
    A good clustering algorithm can provide the basis for forming a good network topology and target location, improve routing efficiency and greatly reduce energy consumption. For the lack of GAF algorithm, an improved algorithm is putted forward. First of all, the monitored area is divided into many sections according to the intersecting circle structure. Then the nodes which meet specific criteria will be elected as cluster heads. Finally, some nodes in overlapping area of intersecting circles will be elected as the Mid Nodes to achieve multi-hops routing. As is shown in the experiment, the improved algorithm can greatly save energy consumption of nodes, and extend the lifetime of wireless sensor networks.
  • Keywords
    energy consumption; pattern clustering; telecommunication network reliability; telecommunication network routing; telecommunication network topology; wireless sensor networks; cluster heads; clustering algorithm; energy consumption reduction; intersecting circle structure; mid node; multihops routing; network topology; routing efficiency; target location; wireless sensor network lifetime; Ad hoc networks; Mobile communication; Mobile computing; Routing; Intersecting circular structure; Load Balancing; Wireless Sensor Networks (WSNs);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Supported Cooperative Work in Design (CSCWD), 2012 IEEE 16th International Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4673-1211-0
  • Type

    conf

  • DOI
    10.1109/CSCWD.2012.6221883
  • Filename
    6221883