145 search results - page 12 / 29 » Weak State Routing for Large-Scale Dynamic Networks |
SIGCOMM
2000
ACM
15 years 2 months ago
2000
ACM
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
89
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
—We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless l...
SRDS
2008
IEEE
15 years 4 months ago
2008
IEEE
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...
ICWN
2004
14 years 11 months ago
2004
Peer-to-Peer networks are gaining popularity through file-sharing communities. Most P2P networks demand a certain stability from it's nodes in order to function satisfactory. ...
MOBICOM
2000
ACM
15 years 2 months ago
2000
ACM
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...