632 search results - page 46 / 127 » On Routing in Circulant Graphs |
IFIP12
2009
14 years 7 months ago
2009
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
107
click to vote
NETWORKS
2002
14 years 9 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
CCCG
2010
14 years 11 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
LCN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identif...