Sciweavers

4 search results - page 1 / 1
» An Algorithm for Generating Node Disjoint Routes in Kautz Di...
Sort
View
IPPS
1991
IEEE
14 years 2 months ago
An Algorithm for Generating Node Disjoint Routes in Kautz Digraphs
Gerard J. M. Smit, Paul J. M. Havinga, Pierre G. J...
HUMAN
2003
Springer
14 years 4 months ago
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo
IPSN
2011
Springer
13 years 2 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
GLOBECOM
2006
IEEE
14 years 5 months ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...