58 search results - page 5 / 12 » Distance distribution of nodes in star graphs |
100
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
DIALM
1999
ACM
15 years 1 months ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
AINA
2009
IEEE
15 years 4 months ago
2009
IEEE
—Topology control in a wireless sensor network is useful for ensuring that the network remains connected in the presence of nodes that exhaust their energy or become altogether d...
WAW
2007
Springer
15 years 3 months ago
2007
Springer
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...