13214 search results - page 98 / 2643 » Pseudorandomness for network algorithms |
184
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
184
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
179
click to vote
INFOCOM
2008
IEEE
16 years 24 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
206
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing ...
175
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...