625 search results - page 13 / 125 » Approximating Travel Times Using Opportunistic Networking |
TWC
2008
14 years 9 months ago
2008
Abstract--In this paper, the flow-level performance of opportunistic scheduling in orthogonal frequency division multiplexing (OFDM) networks is studied. The analysis accounts for ...
SIGCOMM
2005
ACM
15 years 3 months ago
2005
ACM
This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of...
MOBICOM
2009
ACM
15 years 4 months ago
2009
ACM
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
183
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
72
Voted
HUC
2010
Springer
14 years 10 months ago
2010
Springer
Opportunistic activity and context recognition systems do not presume a static sensor infrastructure that is defined at the design time of a system. They also do not have a fixed ...