552 search results - page 16 / 111 » Routing complexity of faulty networks |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
82
Voted
SIGMETRICS
2003
ACM
15 years 2 months ago
2003
ACM
Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path per...
MOBIHOC
2000
ACM
15 years 1 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
GLOBECOM
2008
IEEE
14 years 10 months ago
2008
IEEE
— Nodes forming mobile ad hoc networks (MANET) nodes can be logically partitioned into 1) a selfish user agent serving the interests of the end user (owner) of the mobile device...
ICNP
2006
IEEE
15 years 3 months ago
2006
IEEE
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...