Sciweavers

1016 search results - page 94 / 204
» Optimized algorithms for multi-agent routing
Sort
View
FPGA
2007
ACM
153views FPGA» more  FPGA 2007»
15 years 4 months ago
Variation-aware routing for FPGAs
Chip design in the nanometer regime is becoming increasingly difficult due to process variations. ASIC designers have adopted statistical optimization techniques to mitigate the e...
Satish Sivaswamy, Kia Bazargan
IPPS
2005
IEEE
15 years 3 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
CSREASAM
2006
14 years 11 months ago
Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
Levent Ertaul, Vaidehi Kedlaya
WCNC
2008
IEEE
15 years 4 months ago
A Density Adaptive Routing Protocol for Large-Scale Ad Hoc Networks
Abstract—Position-based routing protocols use location information to refine the traditional packet flooding method in mobile ad hoc networks. They mainly focus on densely and ...
Zhizhou Li, Yaxiong Zhao, Yong Cui, Dong Xiang
AHSWN
2010
130views more  AHSWN 2010»
14 years 10 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li