检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王章权[1] 陈友荣[1] 尉理哲[1] 任条娟[1]
出 处:《传感技术学报》2014年第3期409-415,共7页Chinese Journal of Sensors and Actuators
基 金:浙江省自然科学基金项目(Y13F010013;Q12F03014);浙江省教育厅项目(Y201330053)
摘 要:为克服无线传感网的能量空穴问题,采用最优化方法,研究一种优化网络生存时间的Sink节点移动路径选择算法(MPSA)。在MPSA算法中,将单跳传输的无线传感网监测区域分成多个大小一致的网格,Sink节点可移动到任一网格中心,停留收集单跳最大通信范围内的传感节点数据。分析停留位置的全节点覆盖条件和所有传感节点的能耗,建立权衡网络生存时间和Sink节点移动路程的优化模型。提出一种改进的遗传算法,用于求解优化模型,即迭代执行染色体评估、选择、交叉、变异、最小覆盖处理、孤立节点处理等步骤,最终获得优化网络生存时间的Sink节点移动方案。仿真结果表明:MPSA算法能提高网络生存时间,将移动路程保持在较小范围。在提高网络生存时间方面,比RCC算法更优。To overcome the energy hole problem in wireless sensor networks,optimization method is used and mobile path selection algorithm of Sink node for optimizing network lifetime( MPSA) is researched. In MPSA algorithm,the monitoring area of single-hop transmission wireless sensor network is divided into multiple grids of same size. Sink node can move to any grid's center and stay to gather data in the single-hop maximum communication range. Full node coverage condition of stay location and node energy consumption are analyzed. Then the optimization model which weighs network lifetime and mobile journey is established. The modified genetic algorithm is proposed to solve the model. The steps such as chromosome evaluation, selection, crossover, mutation, minimum coverage processing and isolated nodes processing are iteratively executed. Finally the mobile scheme of Sink node for optimizing network lifetime is obtained. Simulation results show that MPSA algorithm can improve the network lifetime and keep mobile journey at small range. In the aspect of improving network lifetime, it is better than RCC ( range constrained clustering) algorithm.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.173.30