460 search results - page 51 / 92 » Bounding the locality of distributed routing algorithms |
TMC
2010
13 years 7 months ago
2010
—This paper focuses on multihop range-free localization in anisotropic wireless sensor networks. In anisotropic networks, geometric distance between a pair of sensor nodes is not...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
QUESTA
2010
13 years 3 months ago
2010
Consider a multiclass stochastic network with state dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load bala...
ISPAN
1997
IEEE
14 years 1 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— This paper theoretically analyzes cross-layer optimized design of transmit power allocation in distributed interference-limited wireless networks with asynchronously ac...