Sciweavers

581 search results - page 40 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
MOBIHOC
2002
ACM
16 years 1 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
TON
2008
133views more  TON 2008»
15 years 1 months ago
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
Cunqing Hua, Tak-Shing Peter Yum
CCR
1998
96views more  CCR 1998»
15 years 1 months ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad
BROADNETS
2007
IEEE
15 years 7 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta