• DocumentCode
    2103015
  • Title

    Equal Spacing Grouping Network algorithm for chain WSN

  • Author

    Anbang Zhao ; Cheng He ; Bin Zhou ; Tiansi An ; Zhongcheng Ma

  • Author_Institution
    Coll. of Underwater Acoust. Eng., Harbin Eng. Univ., Harbin, China
  • fYear
    2012
  • fDate
    9-11 Nov. 2012
  • Firstpage
    464
  • Lastpage
    468
  • Abstract
    Limited by actual situation, WSN (Wireless Sensor Network) always possesses chain structure. This structure has been used in many engineering situations, so there is a practical significance and value to increase the lifetime of WSN in this structure. Survival time is a very important indicator of WSN. In order to extend life time and reduce power consumption of those WSNs, Equal Spacing Grouping Network (ESGN) algorithm is proposed. This algorithm divides a entire network into many sub-networks which interweaved with each other, data packets in those sub-networks are aggregated to coordinator through the nodes nearby. In this way, the burden of the node on the neighbor of coordinator is shared by several nodes. So the maximum power consumption of nodes in network is reduced, and the entire network life time is extended at the same time. In this paper, the conclusion that ESGN is able to extend network lifetime is proved by formula derivation, assumption calculus and MATLAB simulation. Compared with good-performance BCBRP algorithm, up to about 50% of energy consumption is saved at most.
  • Keywords
    calculus; energy consumption; mathematics computing; wireless sensor networks; ESGN algorithm; MATLAB simulation; assumption calculus; chain WSN; chain structure; data packets; energy consumption; equal spacing grouping network algorithm; maximum power consumption; network life time; survival time; wireless sensor network; Chain WSN; ESGN; Low-power;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Technology (ICCT), 2012 IEEE 14th International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4673-2100-6
  • Type

    conf

  • DOI
    10.1109/ICCT.2012.6511263
  • Filename
    6511263