• DocumentCode
    2458629
  • Title

    Optimize the Data Collection Path in WSNs Based on the Neighbor Count of Path Points

  • Author

    He, Liang ; Huang, Guowei ; Hua, Yu ; Yu, Jing ; Xu, Jingdong

  • Author_Institution
    Dept. of Comput. Sci., Nankai Univ., Tianjin, China
  • Volume
    3
  • fYear
    2010
  • fDate
    12-14 April 2010
  • Firstpage
    308
  • Lastpage
    312
  • Abstract
    Accomplishing data collection in WSNs by mobile elements (MEs) can reduce the amount of multi-hop communications in the network, which will decrease the energy consumption of sensors and prolong network lifetime. However, this may result in unacceptable data collection latency. The problem can be alleviated by reducing the traveling distance of the MEs with a genetic algorithm (GA) implementation. In this paper, we proposed an optimized GA initialization operator based on the neighbor count of path points, which can significantly improve the fitness of the initial population. We also modify the crossover operator to speed up the GA evolution process. Our method is testified by comprehensive experiments, and the results show that the length of data collection path got by the improved GA implementation is about 60% of the solutions got by the original one.
  • Keywords
    energy consumption; genetic algorithms; wireless sensor networks; GA evolution process; ME; WSN; crossover operator; data collection latency; data collection optimization; data collection path; genetic algorithm; mobile elements; multihop communications; network lifetime; path points neighbor count; sensors energy consumption; wireless sensor networks; Base stations; Computer networks; Computer science; Costs; Delay; Genetic algorithms; Mobile communication; Mobile computing; Spread spectrum communication; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Mobile Computing (CMC), 2010 International Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-1-4244-6327-5
  • Electronic_ISBN
    978-1-4244-6328-2
  • Type

    conf

  • DOI
    10.1109/CMC.2010.75
  • Filename
    5471581