CPCA: An efficient wireless routing algorithm in WiNoC for cross path congestion awareness

Integration ◽  
2019 ◽  
Vol 69 ◽  
pp. 75-84 ◽  
Author(s):  
Yiming Ouyang ◽  
Zhe Li ◽  
Jianhua Li ◽  
Chenglong Sun ◽  
Huaguo Liang ◽  
...  
Author(s):  
Raul Aquino Santos

Location-Based Routing Algorithm with Cluster-Based Flooding (LORA-CBF) employs two location services: Simple and Reactive. A Simple Location Service has been implemented for neighbors nodes, and for faraway nodes, a Reactive Location Service is employed. In LORA-CBF, the source node includes the location of its destination in each packet. The packet moves hop by hop through the network, forwarded along via cooperating intermediates nodes. At each node, a purely local decision is made to forward the packet to the neighbor that is geographically closest to the destination. However, location information by itself does not guarantee the transmission between neighboring nodes in vehicular ad-hoc networks. Mobility and contention of wireless media may cause loss of packets being transferred, and this is very important aspect to consider in the development of wireless routing algorithms. Here, the authors have addressed this problem by including a predictive algorithm in LORA-CBF.


Micromachines ◽  
2020 ◽  
Vol 11 (12) ◽  
pp. 1034
Author(s):  
Juan Fang ◽  
Di Zhang ◽  
Xiaqing Li

Routing algorithms is a key factor that determines the performance of NoC (Networks-on-Chip) systems. Regional congestion awareness routing algorithms have shown great potential in improving the performance of NoC. However, it incurs a significant queuing latency when practitioners use existing regional congestion awareness routing algorithms to make routing decisions, thus degrading the performance of NoC. In this paper, we propose an efficient area partition-based congestion-aware routing algorithm, ParRouting, which aims at increasing the throughput and reducing the latency for NoC systems. First, ParRouting partitions the network into two areas (i.e., edge area and central area.) based on node priorities. Then, for the edge area, ParRouting selects the output node based on different priorities for higher throughput; for the central area, ParRouting selects the node in the low congestion direction as the output node for lower queuing latency. Our experimental results indicate that ParRouting achieves a 53.4% reduction in packet average latency over SPLASH -2 ocean application and improves the saturated throughput by up to 38.81% over a synthetic traffic pattern for an NoC system, compared to existing routing algorithms.


2012 ◽  
Vol 457-458 ◽  
pp. 1149-1154
Author(s):  
Li Xin Zhang ◽  
Liang Wang

Aiming at the routing protocol in an industrial monitoring system, this paper analyzes the demand of the industrial monitoring wireless routing protocol, proposes a region adaptive routing protocol, and provides the algorithm, procedure and data structure of the route protocol in the industrial monitoring system. Simulation results show that the result of quantitative description compared energy consumption with time delay, this protocol is superior to orientation spreading, sensor protocols for information via negotiation(SPIN) and passing more energy protocols in both aspects, this algorithm can replace the all existing route protocols in the field of industrial monitoring area.


2011 ◽  
Vol E94-B (6) ◽  
pp. 1625-1629
Author(s):  
Atsufumi MORIYAMA ◽  
Hiroshi ISHINISHI ◽  
Katsuichi NAKAMURA ◽  
Yoshiaki HORI

2015 ◽  
Vol E98.B (8) ◽  
pp. 1715-1724 ◽  
Author(s):  
Zhu TANG ◽  
Chunqing WU ◽  
Zhenqian FENG ◽  
Wanrong YU ◽  
Baokang ZHAO ◽  
...  

2019 ◽  
Vol 16 (7) ◽  
pp. 195-206 ◽  
Author(s):  
Feng Wang ◽  
Dingde Jiang ◽  
Sheng Qi

Sign in / Sign up

Export Citation Format

Share Document