pdf

Heterogeneity-driven routing algorithm for wireless sensor networks

  • 2013-09-21
  • 222.21KB
  • Points it Requires : 2

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

unfold

You Might Like

Uploader
froglucky
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×