410 search results - page 26 / 82 » Upgrading Shortest Paths in Networks |
PDCAT
2007
Springer
15 years 7 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
151
click to vote
JPDC
2006
15 years 1 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the short...
123
click to vote
ICPP
2009
IEEE
15 years 8 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
112
click to vote
ISCIS
2004
Springer
15 years 6 months ago
2004
Springer
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...