Sciweavers

583 search results - page 34 / 117
» Computing Linking Numbers of a Filtration
Sort
View
ISPA
2005
Springer
14 years 3 months ago
Online Adaptive Fault-Tolerant Routing in 2D Torus
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
Yamin Li, Shietung Peng, Wanming Chu
IJNSEC
2008
132views more  IJNSEC 2008»
13 years 10 months ago
Optimal Energy-Delay Routing Protocol with Trust Levels for Wireless Ad Hoc Networks
This paper presents the Trust Level Routing (TLR) protocol, an extension of the optimized energy-delay routing (OEDR) protocol, focusing on the integrity, reliability and survivab...
Eyad Taqieddin, S. Jagannathan, Ann Miller
IWCMC
2006
ACM
14 years 3 months ago
Detecting spatial congestion in multihop wireless networks
While TCP is highly successful in the wire-line Internet, its performance fast degrades as the number of hops increases in multihop wireless networks. It is due to not only the ha...
Changhee Joo, Saewoong Bahk, Hyogon Kim
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 7 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...
KAIS
2011
129views more  KAIS 2011»
13 years 4 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis