A temporal graph model based power aware routing algorithm in deep-space networks

2017 ◽  
Author(s):  
Yang Song ◽  
Lixiang Liu ◽  
Jianzhou Chen
Keyword(s):  
Routing Algorithm ◽  
Graph Model ◽  
Deep Space ◽  
Model Based ◽  
Space Networks ◽  
Temporal Graph

scholarly journals Improved Networks Routing Using an Arrow-Based Description

Telecom ◽  
2020 ◽  
Vol 1 (3) ◽  
pp. 150-160
Author(s):  
Cristian E. Onete ◽  
Maria-Cristina C. Onete
Keyword(s):  
Planar Graphs ◽  
Mesh Networks ◽  
Routing Algorithm ◽  
Graph Model ◽  
Model Based ◽  
Return Path ◽  
Planar Networks

In this paper, an improved routing algorithm suitable for planar networks—static Zigbee and mesh networks included—is shown. The algorithm is based on the cycle description of the graph, and on a new graph model based on arrow description, which is outlined. We show that the newly developed model allows for a faster algorithm for finding a direct and a return path in the network. The newly developed model allows further interpretations of the relationships in any simple planar graphs. Examples showing the implementation of the newly developed model are presented too.

Sign in / Sign up

Export Citation Format

Share Document