Sciweavers

Share
655 search results - page 1 / 131
» Approximating Travel Times Using Opportunistic Networking
Sort
View
AINA
2009
IEEE
8 years 11 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
MOBIWAC
2009
ACM
9 years 8 months ago
The sociable traveller: human travelling patterns in social-based mobility
Understanding how humans move is a key factor for the design and evaluation of networking protocols and mobility management solutions in mobile networks. This is particularly true...
Chiara Boldrini, Marco Conti, Andrea Passarella
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
9 years 3 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
FORTE
2004
9 years 2 months ago
How Synchronisation Strategy Approximation in PEPA Implementations Affects Passage Time Performance Results
Passage time densities are useful performance measurements in stochastic systems. With them the modeller can extract probabilistic quality-of-service guarantees such as: the proba...
Jeremy T. Bradley, Stephen T. Gilmore, Nigel Thoma...
books