625 search results - page 27 / 125 » Approximating Travel Times Using Opportunistic Networking |
158
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
116
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
The routing performance of delay tolerant networks (DTN) is highly correlated with the distribution of inter-contact times (ICT), the time period between two successive contacts o...
SIAMCOMP
2008
14 years 11 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
98
Voted
PERCOM
2010
ACM
14 years 10 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
105
click to vote
CSFW
2009
IEEE
15 years 6 months ago
2009
IEEE
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...