摘要
对无线传感器网络（WSNs）路由优化问题进行研究，提出一种基于离散群居蜘蛛算法的WSNs分簇路由优化方案．首先定量分析节点覆盖冗余度期望值与网络覆盖率的关系，筛选出能够保证网络覆盖率要求的最少网络工作节点，其次研究分簇大小与网络节点密度的关系，动态地确定最佳的分簇个数．基于此，以簇间距离和簇首能量为评价指标构建簇间通信模型，重新定义蜘蛛个体编码方式和更新策略，采用离散群居蜘蛛算法对模型进行求解，最终实现WSNs分簇路由优化．仿真结果表明，方案能够满足网络覆盖要求，而且与其它路由优化算法相比，延长了网络生命周期，降低了网络能耗．
Based on the research of wireless sensor network （WSNs） routing optimization problem, a clustering WSNs routing optimization scheme based on discrete social spider al- gorithm is proposed. Firstly, the relationship between expected value of node coverage redundancy and network coverage is analyzed, and the nodes which ensure network coverage requirements are screened for working; then, the relationship between cluster size and network node density is study, and the best cluster number for WSNs is determined dynamically. On this basis, the distance between clusters and cluster energy are chosen as the evaluation indexes to construct the inter-cluster communication model, and the social spider optimization algorithm in which particle encoding and update strategy is redefined is used to solve the model, finally the WSNs routing optimization is realized. Simulation results show that the proposed scheme can meet the requirements of network coverage, and compared with other routing optimization algorithms, the network energy consumption is reduced and the life cycle is increased.
作者
王丽
王晓凯
宫建平
WANG li;WANG Xiao-kai;GONG Jian-ping(School of Mathematics ＆ Physics,Jinzhong University,Jinzhong 030619,China;School of Physics and Electronic Engineering,Shanxi University,Taiyuan 030006,China)
出处
《数学的实践与认识》
北大核心
2018年第13期171-181,共11页
Mathematics in Practice and Theory
基金
山西省高校“131”领军人才工程项目
教育部高等学校教学指导委员会项目(JZW-14-JW-09)
山西省科技攻关计划项目(20110321025-02)
晋中学院教学改革项目(ZL2016jg04)
关键词
无线传感器网络
网络覆盖保持
动态分簇
群居蜘蛛算法
路由优化
wireless sensor networks
network coverage preserving
dynamic clustering mechanism
social spider optimization algorithm
routing optimization
