2279 search results - page 166 / 456 » Distributed Spectrum-Efficient Routing Algorithms in Wireles... |
140
click to vote
ICOIN
2001
Springer
15 years 8 months ago
2001
Springer
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
141
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
144
Voted
IWQOS
2004
Springer
15 years 9 months ago
2004
Springer
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
149
Voted
EWSN
2004
Springer
16 years 3 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
134
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...