摘要
在多跳无线传感器网络进行精确数据收集时,靠近汇聚节点(sink节点)的传感器节点因为需转发其他节点的数据,其能量消耗快,容易使网络造成能量空洞,缩短网络寿命。为延长网络寿命,提出一种能量全局优化的精确数据收集算法(EGODGA),有效地收集传感器节点的数据。与经典的最短路径算法Dijkstra不同,EGODGA算法同时考虑链路代价和节点代价,找出从源节点到目的节点的最小代价路径,实现网络能量全局优化。仿真结果表明:在相同的条件下,与经典的最短路径算法Dijkstra和对瓶颈节点能量均衡问题解决较好的MAXLAT算法相比,EGODGA算法可以通过优化网络拓扑子树的节点数目,实现网络的能量均衡,缓解网络瓶颈问题,延长网络的整体寿命。
When multi-hop wireless sensor networks gathering the precise data, the node closed to the sink need to transmit other nodes' data, which depletes their energy faster and can easily cause network an energy hole that would shorten the network lifetime. In order to prolong the network lifetime, a novel algorithm called EGODGA is proposed to collect sensor nodes' data availably. Different from the traditional shortest path tree Dijkstra algorithm, this algorithm considers the link cost and node cost simultaneously, seeks out a minimum cost path from source node to destination node and attains network energy global optimization. The simulation results show that under the same conditions, compared with the classic shortest path algorithm Dijkstra and the bottleneck node energy balance to solve the problem of MAXLAT algorithm, EGODGA algorithm can optimize the network topology by the number of nodes of the subtree, achieve energy balance network, alleviate network bottlenecks, prolong the network life overall.
出处
《广西大学学报(自然科学版)》
CAS
北大核心
2017年第5期1744-1752,共9页
Journal of Guangxi University(Natural Science Edition)
基金
广西自然科学基金资助项目(2014GXNSFAA118373)
关键词
无线传感器网络
数据收集
能量全局优化
最小代价路径
wireless sensor networks
data gathering
energy global optimization
minimum cost path