By Topic

A hierarchical routing protocol to handle topological variation for wireless sensor network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wei Xiao ; Dept. of Logistical Inf. Eng., Logistical Eng. Univ., Chongqing ; Yaqing Tu ; Hua Xu

As many routing protocols for wireless sensor network canpsilat handle dynamic topological variation efficiently, a new hierarchical routing protocol (HTVRP) based on the shortest path is proposed. In this protocol, all of nodes are arranged to different logic layers according to their distance from the sink, thus a ring-hierarchy, tree-framework topology is formed. Each node merely communicates with the nearest nodes in its upper and lower layer, that is to say, father-node and son-nodes, and transmits an integrated data to its father-node after fusing its own with all sensed data from its son-nodes. The communication between the sink and nodes is multi-hop, and all sensed data is sent to the sink through the shortest path layer by layer. Nodes in the layer nearest from the topological variation layer are first triggered to respond. Simulation results have shown that HTVRP routing protocol can efficiently handle dynamic topological variation, improve network scalability and optimize network performance.

Published in:

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Date of Conference:

25-27 June 2008