Sciweavers

478 search results - page 33 / 96
» Diameter and Center Computations in Networks
Sort
View
ICNP
2005
IEEE
15 years 5 months ago
Landmark Guided Forwarding
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
Menghow Lim, Adam Chesterfield, Jon Crowcroft, Jul...
IPPS
2008
IEEE
15 years 6 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
ISPA
2005
Springer
15 years 5 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
IPSN
2007
Springer
15 years 6 months ago
Exact distributed Voronoi cell computation in sensor networks
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
Boulat A. Bash, Peter Desnoyers
IADIS
2004
15 years 1 months ago
Challenges for Network Computer Games
Interactive entertainment and specifically computer games has grown into a multi-billion industry in the last few years and continues to grow. This expansion has fueled a number o...
Yusuf Pisan