441 search results - page 25 / 89 » Betweenness centrality and resistance distance in communicat... |
110
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
NETGAMES
2004
ACM
15 years 3 months ago
2004
ACM
Today’s Multi-player Online Games (MOGs) are challenged by infrastructure requirements, because of their server-centric nature. Peer-to-peer networks are an interesting alternat...
107
click to vote
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— The wormhole attack is one of the most severe security attacks in wireless ad hoc networks. In this paper, we analyze the effect of the wormhole attack in shortest path routing...
104
click to vote
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we present a sensor inter-vehicle communication protocol based on geographical routing. Sensors installed in cars continuously gather important information about: ai...
INFOCOM
1993
IEEE
15 years 1 months ago
1993
IEEE
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...