Optimal routing algorithms for mesh-connected processor arrays

Algorithmica ◽  
1992 ◽  
Vol 8 (1-6) ◽  
pp. 21-38 ◽  
Author(s):  
Sanguthevar Rajasekaran ◽  
Thanasis Tsantilas
Keyword(s):  
Routing Algorithms ◽  
Optimal Routing ◽  
Processor Arrays

A Distributed Algorithm for Data Collection in Low-Duty-Cycled WSNs

2014 ◽  
Vol 668-669 ◽  
pp. 1355-1358
Author(s):  
Feng Liu ◽  
Yu Fei Wang ◽  
Mu Lin
Keyword(s):  
Data Collection ◽  
Distributed Algorithm ◽  
Routing Algorithms ◽  
Optimal Routing ◽  
Shortest Path Algorithm ◽  
End To End Delay ◽  
Network Utility ◽  
Control Message ◽  
End To End ◽  
Better Than

In order to prolong the lifetime of WSNs, low-duty-cycled scheduling is a widely used strategy. However, there exists high latency with traditional routing algorithms. In this paper, we model the data collection scheme of WSNs to be a delay optimization problem and propose a distributed algorithm based on Network Utility Maximization. The proposed algorithm can distributed find an optimal routing to achieve minimal average end-to-end delay. The simulation results show that our algorithm performs better than the traditional shortest path algorithm on end-to-end delay with less control message.

Sign in / Sign up

Export Citation Format

Share Document