2279 search results - page 115 / 456 » Distributed Spectrum-Efficient Routing Algorithms in Wireles... |
133
click to vote
ICDCSW
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we argue that there is a need for an event-based middleware to build large-scale distributed systems. Existing publish/subscribe systems still have limitations comp...
116
Voted
ADHOCNOW
2007
Springer
15 years 9 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
126
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...
119
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
159
click to vote
HICSS
2008
IEEE
15 years 3 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...