Deriving time complexities for a class of distributed gradient projection-based optimal routing algorithms

1990 ◽  
Author(s):  
J.K. Antonio ◽  
G.M. Huang ◽  
W.K. Tsai
Keyword(s):  
Routing Algorithms ◽  
Gradient Projection ◽  
Optimal Routing

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.

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 survey on ACO based multipath routing algorithms for ad hoc networks

2017 ◽  
Vol 13 (4) ◽  
pp. 370-385 ◽  
Author(s):  
Ishu Sharma ◽  
K.R. Ramkumar
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Routing Algorithms ◽  
Optimal Routing ◽  
Content Type ◽  
Multiple Paths ◽  
Routing Method ◽  
Hoc Networks

Purpose The purpose of this paper is to review the existing routing algorithms for wireless ad hoc networks to evaluate the methods according to the current requirements. Wireless ad hoc network can provide communication in emergency situations. Active nodes in ad hoc network work as sender, receiver and router at the same time. Nodes are equipped with limited bandwidth and energy. Optimal routing method can help in “smart use” of available resources. Evolvement of routing method based on need is a continuous process. Numerous applications of ad hoc network motivates researcher for further development to fulfill the need of society. Design/methodology/approach In this paper, routing algorithms for ad hoc network based on ant colony optimization, multipath routing and with multiple input multiple output (MIMO) antenna support have been discussed. Findings Comparative analysis has been drawn among existing algorithms of different categories. Transmitting message packets parallel through multiple paths in the network can save overall resource usage in the network. Originality/value The authors have discussed the future area of development for optimal routing in ad hoc networks. Considering signal noise ratio and congestion status while selecting path can provide better energy use in the network. Rather than leaving less prioritized route paths, multiple paths can be used for sending data packets parallel.

Sign in / Sign up

Export Citation Format

Share Document