2279 search results - page 397 / 456 » Distributed Spectrum-Efficient Routing Algorithms in Wireles... |
133
click to vote
DCOSS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
142
click to vote
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
132
click to vote
SIGMETRICS
2003
ACM
15 years 8 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
148
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
111
click to vote
ISPA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...