2279 search results - page 135 / 456 » Distributed Spectrum-Efficient Routing Algorithms in Wireles... |
103
click to vote
GCC
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
139
Voted
TCAD
2002
15 years 3 months ago
2002
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
110
Voted
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
Broadcasting in ad hoc networks is required for many routing and other network-layer protocols to request information like routes or locations about destination nodes. Most of the...
127
Voted
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
136
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— Transmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the ...