| 摘要: |
| 在能量采集型无线传感器网络中，虽然有能量吸收，但是因能量依然非常珍贵，如何优化路由协议，提高能量利用率，延长网络寿命仍然是值得研究的问题。为求解高能效的路由，提出了一种采用遗传算法的高能效路由算法，建立考虑节点的吸收能量、剩余能量、消耗能量和浪费能量的适应函数，用遗传算法寻找全局最优路径。将该适应函数与3种其他适应函数作对比，其他3种适应函数分别为只考虑路径能耗最小的适应函数，考虑路径能耗与路径上节点的吸收能量、剩余能量的适应函数以及考虑路径能耗与网络中所有节点的浪费能量的适应函数。采用遗传算法解出4种路由，通过仿真分析可知，所提出的路由算法能量利用效率最高。 |
| 关键词: 无线传感器网络 能量采集型 遗传算法 能量平衡 能量利用率 |
| DOI：10.3969/j.issn.1001-893x.2017.08.002 |
|
| 基金项目:国家自然科学基金资助项目(61302073)；北京市自然科学基金资助项目(4172021,Z160002)；北京市教育委员会科技发展计划面上项目(KM201711232010) |
|
| A high energy utilization routing algorithm in energy-harvesting wireless sensor networks |
| GUO Jie,YAO Yanxin |
| (School of Information and Communication Engineering, Beijing Information Science and Technology University,Beijng100101,China) |
| Abstract: |
| In energy-harvesting wireless sensor networks, sensor nodes can harness environmental energy to power the nodes. However, energy is still very valuable, so how to optimize routing protocol to improve energy utilization and maximize network lifetime is still a problem worthy of study. In order to solve the energy efficient routing, an energy efficient routing algorithm based on genetic algorithm is proposed to find the global optimal path by establishing the fitness function considering the absorption energy, residual energy, energy consumption and waste energy of the nodes. What is more, fitness function proposed in this paper is compared with three other fitness functions，including fitness function considering minimizing energy consumption,fitness function considering the energy absorption, residual energy and energy consumption of the nodes on the path,and fitness function considering the energy consumption of the nodes on the path and the energy waste of the nodes in wireless sensor networks. Genetic algorithm is used to solve the four kinds of routing and the simulation analysis shows that the proposed routing algorithm is of the highest energy efficiency. |
| Key words: wireless sensor network(WSN) energy-harvesting genetic algorithm energy balance energy utilization |
《电讯技术》编辑部 