Sciweavers

217 search results - page 20 / 44
» Approximating Minimum Manhattan Networks
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Diverse Routing in Networks with Probabilistic Failures
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
Hyang-Won Lee, Eytan Modiano
FOCS
1996
IEEE
14 years 2 months ago
Path Coloring on the Mesh
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
Yuval Rabani
ADHOC
2005
122views more  ADHOC 2005»
13 years 9 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
TWC
2008
105views more  TWC 2008»
13 years 9 months ago
Joint medium access control, routing and energy distribution in multi-hop wireless networks
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
Khoa T. Phan, Hai Jiang, Chintha Tellambura, Sergi...
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
14 years 2 months ago
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder