Efficient routing in carrier-based mobile networks

DOI10.1016/J.TCS.2013.01.025zbMath1358.68049DBLPjournals/tcs/BrejovaDKV13OpenAlexW1978580066WikidataQ57689834 ScholiaQ57689834MaRDI QIDQ392206

Broňa Brejová, Rastislav Královič, Stefan Dobrev, Tomáš Vinař

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.025

zbMATH Keywords

online algorithmsdelay tolerant networksopportunistic routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Distributed exploration of dynamic rings ⋮ Exploration of carrier-based time-varying networks: the power of waiting ⋮ On the expressivity of time-varying graphs

Cites Work

• Distributed computation in dynamic networks
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Exploration of Periodically Varying Graphs
• Connectivity and inference problems for temporal networks

This page was built for publication: Efficient routing in carrier-based mobile networks