Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
Authors:
- 1 June 2015
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 26 (04) , 499-522
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- On the exploration of time-varying networksTheoretical Computer Science, 2013
- Time-varying graphs and dynamic networksInternational Journal of Parallel, Emergent and Distributed Systems, 2012
- Searching for Black Holes in SubwaysTheory of Computing Systems, 2011
- Mobility models for vehicular ad hoc networks: a survey and taxonomyIEEE Communications Surveys & Tutorials, 2009
- The computational power of population protocolsDistributed Computing, 2007
- Computation in networks of passively mobile finite-state sensorsDistributed Computing, 2006
- Building a reference combinatorial model for MANETsIEEE Network, 2004
- The node distribution of the random waypoint mobility model for wireless ad hoc networksIEEE Transactions on Mobile Computing, 2003
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKSInternational Journal of Foundations of Computer Science, 2003
- Termination detection for diffusing computationsInformation Processing Letters, 1980