Sciweavers

407 search results - page 40 / 82
» Recursive or iterative routing
Sort
View
MOBIHOC
2006
ACM
16 years 16 days ago
Robust distributed node localization with error management
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
Juan Liu, Ying Zhang, Feng Zhao
DAC
1998
ACM
16 years 1 months ago
Performance Driven Multi-Layer General Area Routing for PCB/MCM Designs
In this paper we present a new global router appropriate for Multichip Module MCM and dense Printed Circuit Board PCB design, which utilizes a hybrid of the classical rip-up and r...
Jason Cong, Patrick H. Madden
SECON
2008
IEEE
15 years 7 months ago
Practical Algorithms for Gathering Stored Correlated Data in a Network
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
Ramin Khalili, James F. Kurose
ICC
2007
IEEE
183views Communications» more  ICC 2007»
15 years 7 months ago
Most Reliable Routing in WDM Mesh Networks with Arbitrary Risk Distribution
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
Ji Li, Kwan Lawrence Yeung
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 16 days ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg