Sciweavers

2808 search results - page 132 / 562
» Routing betweenness centrality
Sort
View
ICCSA
2004
Springer
15 years 11 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
LCN
2003
IEEE
15 years 11 months ago
Regional Gossip Routing for Wireless Ad Hoc Networks
Abstract—Many routing protocols have been proposed for wireless ad hoc networks, and most of them are based on some variants of flooding. Thus many routing messages are propagat...
Xiang-Yang Li, Kousha Moaveninejad, Ophir Frieder
ICPADS
2002
IEEE
15 years 11 months ago
Self-Stabilizing Wormhole Routing on Ring Networks
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
Ajoy Kumar Datta, Maria Gradinariu, Anthony B. Ken...
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
15 years 7 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
WCE
2007
15 years 7 months ago
QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing
—Ad hoc networking will become a major technology for wireless connectivity beside the multimedia necessity within the next few years. There are too many applications where one-t...
Vida Lashkari B. O., Mehdi Dehghan