Routing algorithm design of satellite network architecture based on SDN and ICN

2019 ◽  
Vol 38 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Zhiguo Liu ◽  
Jie Zhu ◽  
Jiangmei Zhang ◽  
Qingli Liu
2018 ◽  
Vol 7 (3) ◽  
pp. 1910
Author(s):  
R Brendha ◽  
V Sinthu Janita Prakash

Vehicular ad hoc network is a wireless communication technology that is used to provide safety and comfort transport on the roads. Routing algorithm design is one of the main challenging issues in VANET. This paper presents a Geographical Zone Based Cluster Head algorithm for Vehicular Ad hoc Networks (VANETs) to reduce the communication overhead generated by the Control Packets (CP). Depending on the area, the network can be sparsely or fully connected. The Geographical Zone Based Cluster Head Routing in Sparse network (GZCHRS) algorithm can endure network partition due to low node density in the sparse network and high node density in the urban network. This paper inspects the issues of VANETs in sparse networks. In this algorithm, the routing decision is based on vehicular density, velocity and link lifetime. The simulation results display that under rural network conditions, the Geographical Zone Based Cluster Head Routing algorithm performs well when compared to Light Weight Intersection based Traffic Aware Routing (LITAR) and Intersection-based Connectivity Aware Routing (ICAR).  


2019 ◽  
Vol 6 (2) ◽  
pp. 3727-3742 ◽  
Author(s):  
Qixun Zhang ◽  
Menglei Jiang ◽  
Zhiyong Feng ◽  
Wei Li ◽  
Wei Zhang ◽  
...  

2013 ◽  
Vol 756-759 ◽  
pp. 1059-1062 ◽  
Author(s):  
Xue Bing Wang

By making small adjustment to general ad hoc network architecture, we build a network topology with short average path length and high clustering coefficient, which are two important metrics of ad hoc networks. Furthermore, an efficient probabilistic flooding routing algorithm is proposed based on this network model. Simulation results show that this architecture behaves better performance than its ordinary counterpart.


Author(s):  
Xiaodong Shi ◽  
Yongjun Li ◽  
Shanghong Zhao ◽  
Weilong Wang

Author(s):  
Chakib Nehnouh ◽  
Mohamed Senouci

To provide correct data transmission and to handle the communication requirements, the routing algorithm should find a new path to steer packets from the source to the destination in a faulty network. Many solutions have been proposed to overcome faults in network-on-chips (NoCs). This article introduces a new fault-tolerant routing algorithm, to tolerate permanent and transient faults in NoCs. This solution called DINRA can satisfy simultaneously congestion avoidance and fault tolerance. In this work, a novel approach inspired by Catnap is proposed for NoCs using local and global congestion detection mechanisms with a hierarchical sub-network architecture. The evaluation (on reliability, latency and throughput) shows the effectiveness of this approach to improve the NoC performances compared to state of art. In addition, with the test module and fault register integrated in the basic architecture, the routers are able to detect faults dynamically and re-route packets to fault-free and congestion-free zones.


Sign in / Sign up

Export Citation Format

Share Document