Sciweavers

953 search results - page 47 / 191
» A Heuristic for Channel Routing
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Some Results on Greedy Embeddings in Metric Spaces
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
Ankur Moitra, Tom Leighton
MOBICOM
2006
ACM
14 years 1 months ago
Component based channel assignment in single radio, multi-channel ad hoc networks
In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment...
Ramanuja Vedantham, Sandeep Kakumanu, Sriram Laksh...
ICNP
2007
IEEE
14 years 2 months ago
Inferring the Origin of Routing Changes using Link Weights
— The global Internet routing infrastructure is a large and complex distributed system where routing changes occur constantly. Our objective in this paper is to develop a simple ...
Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lix...
IJNSEC
2006
131views more  IJNSEC 2006»
13 years 7 months ago
A Frobenius Map Approach for an Efficient and Secure Multiplication on Koblitz
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier ...
Mustapha Hedabou
SIGCOMM
1999
ACM
14 years 5 days ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves