Combining the advantages of table-driven routing and on-demand driven routing, a heterogeneous driven wireless sensor network routing algorithm is proposed to achieve efficient aggregation of monitoring data in wireless sensor networks. The algorithm expands the original single sink node (Sink node) of the wireless sensor network into a set of loop-free connected points, called virtual slot nodes, to cover the entire network. The sensing node uses an on-demand driven routing strategy to transmit the monitoring data to the virtual slot node within a short distance, and then the data is aggregated at high speed within the virtual slot node according to table-driven routing. The optimal virtual slot node selection method is determined through theoretical calculations, and a two-hop neighbor algorithm is proposed to achieve routing. Through simulation experiments, the algorithm can ensure that any node in the network can reach the virtual slot node within two hops, and the effectiveness of the algorithm is demonstrated by analyzing simulation data. Keywords: wireless sensor network; virtual slot node; on-demand routing; table-driven routing; spanning tree
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore