Fabian Kuhn
- D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. In Proc. of 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 290--299, 2004. Google Scholar
Digital Library
- J. Aspnes and E. Ruppert. An introduction to population protocols. In B. Garbinato, H. Miranda, and L. Rodrigues, editors, Middleware for Network Eccentric and Mobile Applications, pages 97--120. Springer-Verlag, 2009.Google ScholarCross Ref
- C. Avin, M. Koucký, and Z. Lotker. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In Proc. of 35th Coll. on Automata, Languages and Programming (ICALP), pages 121--132, 2008. Google ScholarDigital Library
- R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. of Computer and System Sciences, 45(1):104--126, 1992. Google ScholarDigital Library
- H. Baumann, P. Crescenzi, and P. Fraigniaud. Parsimonious flooding in dynamic graphs. In Proc. of 28th ACM Symp. on Principles of Distributed Computing (PODC), pages 260--269, 2009. Google ScholarDigital Library
- C. Bettstetter, G. Resta, and P. Santi. The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2:257--269, 2003. Google ScholarDigital Library
- B. Bollobás. The diameter of random graphs. Trans. of the American Mathematical Society, 267(1):41--52, 1981.Google ScholarCross Ref
- E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer. Brahms: Byzantine resilient random membership sampling. Computer Networks, 53(13):2340--2359, 2009. Google ScholarDigital Library
- C. Busch and S. Tirthapura. Analysis of link reversal routing algorithms. SIAM J. on Computing, 35:305--326, 2005. Google ScholarDigital Library
- T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. Wireless Communication and Mobile Computing, 2(5):483--502, 2002.Google ScholarCross Ref
- A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-Markovian dynamic graphs. In Proc. of 27th ACM Symp. on Principles of Distributed Computing (PODC), pages 213--222, 2008. Google ScholarDigital Library
- A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. Journal of Computer and System Sciences, 75(4):213--230, 2009. Google ScholarDigital Library
- A. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. of Parallel and Distribited Computing, 64(1):89--96, 2004. Google ScholarDigital Library
- A. Clementi, A. Monti, and R. Silvestri. Fast flooding over Manhattan. In Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pages 375--383, 2010. Google ScholarDigital Library
- A. Clementi, F. Pasquale, A. Monti, and R. Silvestri. Information spreading in stationary Markovian evolving graphs. In Proc. of IEEE Symp. on Parallel & Distributed Processing (IPDPS), 2009. Google ScholarDigital Library
- S. Dolev. Self-stabilization. MIT Press, Cambridge, MA, USA, 2000. Google ScholarDigital Library
- A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network Magazine, 18(5):24--29, 2004. Google ScholarDigital Library
- A. Ferreira, A. Goldman, and J. Monteiro. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16(3):627--640, 2009. Google ScholarDigital Library
- E. M. Gafni and D. P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications, 29:11--18, 1981.Google ScholarCross Ref
- A. J. Ganesh, A.-M. Kermarrec, and L. Massoulié. SCAMP: Peer-to-peer lightweight membership service for large-scale group communication. Networked Group Communication, pages 44--55, 2001. Google ScholarDigital Library
- P. Grindrod and D. J. Higham. Evolving graphs: dynamical models, inverse problems and propagation. Proc. of the Royal Society A: Mathematical, Physical and Engineering Sciences, 466(2115):753--770, 2009.Google Scholar
- M. Gurevich and I. Keidar. Correctness of gossip-based membership under message loss. SIAM J. of Computing, 39(8):3830--3859, 2010. Google ScholarDigital Library
- S. Janson, T. ?uczak, and A. Rucinski. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.Google ScholarCross Ref
- D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, chapter 5, pages 153--181. Kluwer Academic, 1996.Google ScholarCross Ref
- R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. Proc. of 41st Symp. on Foundations of Computer Science (FOCS), pages 565--574, 2000. Google ScholarDigital Library
- F. Kuhn, C. Lenzen, T. Locher, and R. Oshman. Optimal gradient clock synchronization in dynamic networks. In Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pages 430--439, 2010. Google ScholarDigital Library
- F. Kuhn, N. Lynch, C. Newport, R. Oshman, and A. Richa. Broadcasting in unreliable radio networks. In Proc. of 29th ACM Symp. on Principles of Distributed Computing (PODC), pages 336--345, 2010. Google ScholarDigital Library
- F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proc. of 42nd Symp. on Theory of Computing (STOC), pages 513--522, 2010. Google ScholarDigital Library
- F. Kuhn, S. Schmid, and R. Wattenhofer. A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In Proc. of 4th Int. Workshop on Peer-To-Peer Systems (IPTPS), 2005. Google ScholarDigital Library
- J.-Y. Le Boudec and M. Vojnovic. The random trip model: Stability, stationarity regime, and perfect simulation. IEEE/ACM Transactions on Networking, 16(6):1153--1166, 2006. Google ScholarDigital Library
- C. Lenzen, T. Locher, and R. Wattenhofer. Tight bounds for clock synchronization. In Proc. of 28th ACM Symp. on Principles of Distributed Computing (PODC), pages 46--55, 2009. Google ScholarDigital Library
- X. Li, J. Misra, and C. G. Plaxton. Maintaining the ranch topology. J. of Parallel and Distributed Computing, 70(11):1142--1158, 2010. Google ScholarDigital Library
- P. Mahlmann and C. Schindelhauer. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In Proc. of 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 155--164, 2005. Google ScholarDigital Library
- R. O'Dell and R. Wattenhofer. Information dissemination in highly dynamic graphs. In Proc. of Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 104--110, 2005. Google ScholarDigital Library
- C. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. of 9th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 311--320, 1997. Google ScholarDigital Library
- I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001. Google ScholarDigital Library
- J. E.Walter, J. L.Welch, and N. H. Vaidya. A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks, 7:585--600, 2001. Google ScholarDigital Library
Index Terms
- Dynamic networks: models and algorithms
Recommendations
Performance Enhancement of TCP in Dynamic Bandwidth Wired and Wireless Networks
AbstractIn this paper, we propose a scheme that dynamically adjusts the slow start threshold (ssthresh) of TCP. The ssthresh estimation is used to set an appropriate ssthresh. A good ssthresh would improve the transmission performance of TCP. For the ...
Dynamic Multicast Routing for Mobile Networks
ICCNMC '03: Proceedings of the 2003 International Conference on Computer Networks and Mobile ComputingMulticast is a mechanism widely used in the Internet to disseminate information. Multicast delivery paths may need to be frequently restructured along with host migrations. But all existing multicast routing proposals implicitly assume static hosts when ...
Dynamic autoconfiguration in 4G networks: problem statement and preliminary solution
DIN '05: Proceedings of the 1st ACM workshop on Dynamic interconnection of networksThe Internet is characterized by the coexistence of two Internet Protocol (IP) versions and multiple autoconfiguration mechanisms which are deployed targeting specific communication scenarios. This heterogeneity requires user pre-configurations, namely ...
Comments