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

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.