Sciweavers

683 search results - page 73 / 137
» Graph Annotations in Modeling Complex Network Topologies
Sort
View
WSC
2008
15 years 2 days ago
Measuring the effectiveness of the s-metric to produce better network models
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
Isabel Beichl, Brian Cloteaux
WCNC
2008
IEEE
15 years 4 months ago
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models
—In performance studies of vehicular ad hoc networks (VANETs), the underlying mobility model plays an important role. Since conventional mobile ad hoc network (MANET) routing pro...
Pei'en Luo, Hongyu Huang, Wei Shu, Minglu Li, Min-...
STACS
2012
Springer
13 years 5 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
ICDCIT
2005
Springer
15 years 3 months ago
Self-stabilizing Deterministic TDMA for Sensor Networks
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
Mahesh Arumugam, Sandeep S. Kulkarni
PVLDB
2010
152views more  PVLDB 2010»
14 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...