3122 search results - page 549 / 625 » A Theory of Network Equivalence |
196
click to vote
JACM
2002
15 years 6 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
177
click to vote
TMC
2010
15 years 4 months ago
2010
—Many wireless sensor networks require sufficient sensing coverage over long periods of time. To conserve energy, a coverage maintenance protocol achieves desired coverage by act...
182
click to vote
TON
2010
15 years 29 days ago
2010
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
239
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
164
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...