Trust integrated node potential aware routing for WSNs

Author(s):  
Shaik Sahil Babu ◽  
Arnab Raha ◽  
Omar Alfandi ◽  
Dieter Hogrefe ◽  
Mrinal Kanti Naskar
Keyword(s):  
2016 ◽  
Author(s):  
Youjun Bu ◽  
Chuanhao Zhang ◽  
YiMing Jiang ◽  
Zhen Zhang

1983 ◽  
Vol 13 (2) ◽  
pp. 146-151 ◽  
Author(s):  
Akira Furuse ◽  
Yutaka Kotsuka ◽  
Ken-ichi Asano

1988 ◽  
Vol 11 (9) ◽  
pp. 1296-1298 ◽  
Author(s):  
WILLIAM E. STRAUSS ◽  
RICHARD W. ASINGER ◽  
MORRISON HODGES

2020 ◽  
Vol 2020 ◽  
pp. 1-5 ◽  
Author(s):  
Yongwen Hu ◽  
Xiao Zhao ◽  
Jing Liu ◽  
Binyuan Liang ◽  
Chao Ma

This paper presents an algorithm for solving a minimum cost flow (MCF) problem with a dual approach. The algorithm holds the complementary slackness at each iteration and finds an augmenting path by updating node potential iteratively. Then, flow can be augmented at the original network. In contrast to other popular algorithms, the presented algorithm does not find a residual network, nor find a shortest path. Furthermore, our algorithm holds information of node potential at each iteration, and we update node potential within finite iterations for expanding the admissible network. The validity of our algorithm is given. Numerical experiments show that our algorithm is an efficient algorithm for the MCF problem, especially for the network with a small interval of cost of per unit flow.


1976 ◽  
Vol 4 (3) ◽  
pp. 239-243 ◽  
Author(s):  
William T. Creasman ◽  
Richard C. Boronow ◽  
C.Paul Morrow ◽  
Philip J. DiSaia ◽  
John Blessing

Sign in / Sign up

Export Citation Format

Share Document