Sciweavers

2808 search results - page 109 / 562
» Routing betweenness centrality
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Optimized algorithms for multi-agent routing
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
Akihiro Kishimoto, Nathan R. Sturtevant
160
Voted
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
15 years 8 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
ISCAPDCS
2004
15 years 7 months ago
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
Yamin Li, Shietung Peng, Wanming Chu
ICC
2009
IEEE
190views Communications» more  ICC 2009»
15 years 3 months ago
Low Bound of Energy-Latency Trade-Off of Opportunistic Routing in Multi-Hop Networks
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
Ruifeng Zhang, Jean-Marie Gorce, Katia Jaffr&egrav...
ICNS
2009
IEEE
15 years 3 months ago
Evaluation of Free-Riding Traffic Problem in Overlay Routing and Its Mitigation Method
Recent research on overlay networks has revealed that user-perceived network performance could be improved by an overlay routing mechanism. The effectiveness of overlay routing is ...
Go Hasegawa, Yuichiro Hiraoka, Masayuki Murata