Dynamic routing algorithm based on application rules and probability in wireless sensor networks
传感器网络中基于应用规则与概率的动态路由算法

A dynamic routing algorithm based on application rules and probability in Wireless Sensor Networks(WSN)was proposed.Making use of node's neighbors,the algorithm periodically interacted with application rules to construct a breath-first data-centric tree after two stages,and then routing path was posed.On the first stage,the data-centric tree was initiated after computing the node's probability to act as a routing one.Second,some appropriate nodes were added to the tree to be a complete connectivity one.Simulation results show its superiority to TinyOS Beaconing algorithm.