An Efficient Algorithm for Buffered Routing Tree Construction under Fixed Buffer Locations with Accurate Delay Models

2005 ◽  
Author(s):  
Yiqian Zhang ◽  
Xianlong Hong ◽  
Yici Cai
Keyword(s):  
Efficient Algorithm ◽  
Tree Construction ◽  
Delay Models ◽  
Routing Tree

A Cluster-Based Routing Tree Construction Algorithm for Wireless Sensor Networks

2011 ◽  
Vol 58-60 ◽  
pp. 2245-2250
Author(s):  
Peng Li ◽  
Yan Jun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Network Routing ◽  
Wireless Sensor ◽  
Construction Algorithm ◽  
Tree Construction ◽  
Routing Technology ◽  
Cluster Based Routing ◽  
Routing Tree

In the architecture of wireless sensor network, routing technology at the network layer is essential. Since the clustering routing leads in good performance on data aggregation, energy minimization and so on, it has become the focus of the study routing. In this paper, a cluster-based routing tree construction algorithm for Wireless Sensor Networks is proposed. The detail of how to select the intermediate nodes to build the routing gathering tree is also described. The experiments show that the algorithm is effective to extend the network lifetime.

scholarly journals An algorithm for obstacle‐avoiding clock routing tree construction with multiple TSVs on a 3D IC

2018 ◽  
Vol 13 (2) ◽  
pp. 102-109 ◽  
Author(s):  
Khokan Mondal ◽  
Subhajit Chatterjee ◽  
Tuhina Samanta
Keyword(s):  
3D Ic ◽  
Obstacle Avoiding ◽  
Tree Construction ◽  
Clock Routing ◽  
Routing Tree
Sign in / Sign up

Export Citation Format

Share Document