期刊文献+

Multi-sink Deployment Strategy for Wireless Sensor Networks Based on Improved Particle Swarm Clustering Optimization Algorithm

Multi-sink Deployment Strategy for Wireless Sensor Networks Based on Improved Particle Swarm Clustering Optimization Algorithm
下载PDF
导出
摘要 In wireless sensor networks(WSNs) with single sink,the nodes close to the sink consume their energy too fast due to transferring a large number of data packages,resulting in the "energy hole" problem.Deploying multiple sink nodes in WSNs is an effective strategy to solve this problem.A multi-sink deployment strategy based on improved particle swarm clustering optimization(IPSCO) algorithm for WSNs is proposed in this paper.The IPSCO algorithm is a combination of the improved particle swarm optimization(PSO) algorithm and K-means clustering algorithm.According to the sink nodes number K,the IPSCO algorithm divides the sensor nodes in the whole network area into K clusters based on the distance between them,making the total within-class scatter to minimum,and outputs the center of each cluster.Then,multiple sink nodes in the center of each cluster can be deployed,to achieve the effects of partition network reasonably and deploy multi-sink nodes optimally.The simulation results show that the deployment strategy can prolong the network lifetime. In wireless sensor networks(WSNs) with single sink,the nodes close to the sink consume their energy too fast due to transferring a large number of data packages,resulting in the "energy hole" problem.Deploying multiple sink nodes in WSNs is an effective strategy to solve this problem.A multi-sink deployment strategy based on improved particle swarm clustering optimization(IPSCO) algorithm for WSNs is proposed in this paper.The IPSCO algorithm is a combination of the improved particle swarm optimization(PSO) algorithm and K-means clustering algorithm.According to the sink nodes number K,the IPSCO algorithm divides the sensor nodes in the whole network area into K clusters based on the distance between them,making the total within-class scatter to minimum,and outputs the center of each cluster.Then,multiple sink nodes in the center of each cluster can be deployed,to achieve the effects of partition network reasonably and deploy multi-sink nodes optimally.The simulation results show that the deployment strategy can prolong the network lifetime.
出处 《Journal of Donghua University(English Edition)》 EI CAS 2016年第5期689-693,共5页 东华大学学报(英文版)
基金 the Key Project of the National Natural Science Foundation of China(No.61134009) National Natural Science Foundations of China(Nos.61473077,61473078) Program for Changjiang Scholars from the Ministry of Education,China Specialized Research Fund for Shanghai Leading Talents,China Project of the Shanghai Committee of Science and Technology,China(No.13JC1407500) Innovation Program of Shanghai Municipal Education Commission,China(No.14ZZ067) the Fundamental Research Funds for the Central Universities,China(No.15D110423)
关键词 wireless sensor networks(WSNs) multi-sink deployment particle swarm clustering optimization(PSCO) network lifetime clustering deployment partition scatter rotation reasonably lifetime recognize Recognition coordinates
  • 相关文献

参考文献3

二级参考文献30

  • 1汪学清,杨永田,孙亭,张忠林.无线传感器网络中基于网格的覆盖问题研究[J].计算机科学,2006,33(11):38-39. 被引量:26
  • 2杨文国,郭田德,赵彤.异构监测传感器网络寿命最大化模型及其求解[J].计算机学报,2007,30(4):532-538. 被引量:21
  • 3Sun L M, Li J Z, Chen Y, et al. Wireless sensor network [ M ]. Beijing: Tsinghua University Press, 2005 : 4 - 5.
  • 4Hou E S H, Ansari N, Ren H. A genetic algorithms for multiprocessor scheduling [J ]. IEEE Trans Parallel and Distributed Systems, 1994,5(2):113- 120.
  • 5De Jong K A. Genetic algorithms: a 10 year perspective[C]// Proceedings of the First International Conference on Genetic Algorithms. Hillsdale, N J: Lawrence Erlbaum Associates Publishers, 1985 : 169 - 177.
  • 6Goldberg D, Lingle R. Alleles, Loci and the traveling salesman problem [ C ] // Proceeding of International Conference on Genetic Algorithms and Their Application. New York, 1999:154- 159.
  • 7Grefenstette J J, Gopal R, Rosmaita B, et al. Genetic algorithms for the travelling salesman problem [ C ] // Proceeding of International Conference on Genetic Algorithms and Their Application. New York, 1999:160 - 168.
  • 8Smith D. Bin packing with adaptive search[ C]//Proceeding of an International Conference on Genetic Algorithms and Their Application. Keystone, Colo, 1985 : 202 - 207.
  • 9Davis L. Handbook of genetic algorithms[ M]. New York: Van Nostrand Reinhold Publishers, 1991:40- 42.
  • 10Goldberg D E. Genetic algorithms in search, optimization and machine learning[ M]. New York: Addison Wesley, 1989:65 - 70.

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部