Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Overhaul of ieee 802.11 modeling and simulation in ns-2
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
The structure of information pathways in a social communication network
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Catch-up: a data aggregation scheme for vanets
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
A fuzzy logic based approach for structure-free aggregation in vehicular ad-hoc networks
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Assessing the VANET's local information storage capability under different traffic mobility
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We propose using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. Specifically, we derive a vehicular ad hoc network model from a large corpus of position data generated by San Francisco-area taxicabs. Unlike previous work, our model does not assume global connectivity or eventual stability. Instead, we assume only that some subset of processes might be connected through transient paths (e.g., paths that exist over time). We use this model to study the problem of prioritized gossip, in which processes attempt to disseminate messages of different priority. We present CabChat, a distributed prioritized gossip algorithm that leverages an interesting connection to the classic Tower of Hanoi problem to schedule the broadcast of packets of different priorities. Whereas previous studies of gossip leverage strong connectivity or stabilization assumptions to prove the time complexity of global termination, in our model, with its weak assumptions, we instead analyze CabChat with respect to its ability to deliver a high proportion of high priority messages over the transient paths that happen to exist in a given execution.