410 search results - page 41 / 82 » Upgrading Shortest Paths in Networks |
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
153
click to vote
GLOBECOM
2008
IEEE
15 years 1 months ago
2008
IEEE
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...
122
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
140
click to vote
GLOBECOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— The wormhole attack is one of the most severe security attacks in wireless ad hoc networks. In this paper, we analyze the effect of the wormhole attack in shortest path routing...
112
Voted
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...