Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks

By Zhang Kejia  

International Journal of Sensor Networks, Vol. 13, Iss. 3, 2013-06 ,pp. : 173-184

Inderscience Publishers

Access to resources Recommend Favorite

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S.   Ghosh R.K.   Reddy A.P.K.  

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite

A Fast and Efficient Processor Management Scheme for k-ary n-cubes

By Yoo B.S.   Das C.R.  

Journal of Parallel and Distributed Computing, Vol. 55, Iss. 2, 1998-12 ,pp. : 192-214

Academic Press

Access to resources Recommend Favorite

End-to-end pairwise key establishment using node disjoint secure paths in wireless sensor networks

By Ling Hui   Znati Taieb  

International Journal of Security and Networks, Vol. 2, Iss. 1-2, 2007-03 ,pp. : 109-121

Inderscience Publishers

Access to resources Recommend Favorite

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

By Kolman Petr   Scheideler Christian  

Algorithmica, Vol. 39, Iss. 3, 2004-04 ,pp. : 209-233

Springer Publishing Company

Access to resources Recommend Favorite