6 search results - page 1 / 2 » ahswn 2008 |
81
Voted
AHSWN
2008
15 years 1 months ago
2008
65
Voted
AHSWN
2008
15 years 1 months ago
2008
89
Voted
AHSWN
2008
15 years 1 months ago
2008
115
Voted
AHSWN
2008
15 years 1 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
105
Voted
AHSWN
2008
15 years 1 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...