Construction of Delay-Driven GNR Routing Tree

2019 ◽  
Author(s):  
Jin-Tai Yan ◽  
Chia-Heng Yen
Keyword(s):  
Routing Tree

Optimally Routable Networks

1998 ◽  
Vol 08 (04) ◽  
pp. 567-575
Author(s):  
Arthur M. Farley
Keyword(s):  
Communication Network ◽  
Decision Tree ◽  
General Model ◽  
Maximum Size ◽  
Tree Representation ◽  
Routing Tree

Routing is the process, performed at each site of a communication network upon receipt of a message, that decides to which neighbor the message is to be sent or that the message is to be received locally. We present a general model of routing based on a decision tree representation of routing information. We describe several classes of optimally routable networks, i.e., networks for which the maximum size of a routing tree over all sites of the network is ⌈log2 n⌉.

ECRPW: Energy-Efficient Clustering Routing Protocol Based on Weight for WSNs

2012 ◽  
Vol 182-183 ◽  
pp. 823-828
Author(s):  
Xiang Ping Gu ◽  
Rong Lin Hu
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Distance Threshold ◽  
Cluster Heads ◽  
Cluster Scheme ◽  
Energy Efficient Clustering ◽  
Routing Tree ◽  
Better Than

ECRPW (energy-efficient clustering routing protocol based on weight) routing protocol is presented to avoid the characteristic of limited energy for wireless sensor networks. It takes nodes’ residual energy into consideration during the process of cluster heads being elected. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, it also sets up the routing tree based on cluster heads’ weight. We simulate and analyze LEACH and ECRPW in NS2. The results show that the performance of ECRPW is better than LEACH.

Sign in / Sign up

Export Citation Format

Share Document