Sciweavers

1016 search results - page 134 / 204
» Optimized algorithms for multi-agent routing
Sort
View
FSTTCS
2004
Springer
15 years 3 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
MOBIHOC
2008
ACM
15 years 9 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
15 years 3 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
ISQED
2005
IEEE
81views Hardware» more  ISQED 2005»
15 years 3 months ago
Exact Algorithms for Coupling Capacitance Minimization by Adding One Metal Layer
Due to the rapid development of manufacturing process technology and tight marketing schedule, the chip design and manufacturing always work toward an integrated solution to achie...
Hua Xiang, Kai-Yuan Chao, Martin D. F. Wong
MST
2010
155views more  MST 2010»
14 years 4 months ago
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
We consider the important problem of energy balanced data propagation in wireless sensor networks and we extend and generalize previous works by allowing adaptive energy assignment...
Pierre Leone, Sotiris E. Nikoletseas, José ...