Sciweavers

1204 search results - page 39 / 241
» Optimal Routing in a Small-World Network
Sort
View
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 1 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
MOBIHOC
2005
ACM
14 years 7 months ago
Efficient geographic routing in multihop wireless networks
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proxi...
Seungjoon Lee, Bobby Bhattacharjee, Suman Banerjee
NETWORKING
2004
13 years 9 months ago
Power Adaptation Based Optimization for Energy Efficient Reliable Wireless Paths
We define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal ch...
Suman Banerjee, Archan Misra
INFOCOM
2008
IEEE
14 years 2 months ago
Optimal Geographic Routing for Wireless Networks with Near-Arbitrary Holes and Traffic
Sundar Subramanian, Sanjay Shakkottai, Piyush Gupt...
INFOCOM
2007
IEEE
14 years 2 months ago
On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic
Sundar Subramanian, Sanjay Shakkottai, Piyush Gupt...