.png){kind=icon}
.png){kind=icon}
Return
Energy-Efficient Algorithm to Construct the Information Potential Field in WSNs
.png){kind=icon}
PRE
AI
DOI：10.1109/JSEN.2017.2690338.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The information gradient-based routing and navigation protocols have been proved to be effective when collecting data from the distributed wireless sensor networks, because the data collector can achieve the global objective through local greedy decision based on the information gradient. An efficient method to establish this information gradient is to solve a discrete approximation to the harmonic function, which is called information potential field (IPF). However, the energy-efficient and quick convergence methods to construct the IPF should be fully investigated to trade off the energy efficiency and the quality of the IPF, especially in the large-scale networks with high dynamics. In this paper, two algorithms are proposed to efficiently construct the IPF, including hierarchical skeleton-based construction algorithm and value estimating substitution algorithm. Both algorithms obey the typical hypotheses on WSN settings and the gossip-styled propagation principle. In addition, we propose the advanced approaches to construct the IPF to tackle the challenges of its practical applications, such as obstacles, task priorities, and sensor energy budget. Comprehensive simulation results show the feasibility of the proposed algorithms, which can reduce the number of iterations to reach a convergence status by 80% so as to conserve energy, and they perform well considering the requirements of real applications.
Keywords:
Information gradient
information potential field
iteration convergence
energy efficiency
greedy routing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
2.1W
Citations:
7.3W