625 search results - page 32 / 125 » Routing in Trees |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Many previously proposed routing metrics and algorithms for ad hoc networks work well in static networks, however, when nodes are moving and wireless links may fail from time t...
106
click to vote
TCAD
2008
14 years 10 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
IPSN
2010
Springer
15 years 4 months ago
2010
Springer
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
ASPDAC
2006
ACM
15 years 4 months ago
2006
ACM
In recent years, the X-Architecture is introduced to obtain better performance for integrated circuit physical design. This paper reformulates the global routing problem in X-Archi...