PERFORMANCE ANALYSIS AND EVALUATION OF RANDOM WALK ALGORITHMS ON WIRELESS NETWORKS

DOI10.1142/S0129054112400369zbMath1255.68048OpenAlexW2147044520MaRDI QIDQ4902878

Keqin Li

Publication date: 18 January 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054112400369

zbMATH Keywords

wireless networkrandom graphcover timerandom walk algorithmdynamic graphmobile network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Random walks on graphs (05C81)

Cites Work

• Space graphs and sphericity
• Unit disk graphs
• On the cover time and mixing time of random geometric graphs
• A tight upper bound on the cover time for random walks on graphs
• A tight lower bound on the cover time for random walks on graphs
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Unnamed Item
• Unnamed Item

This page was built for publication: PERFORMANCE ANALYSIS AND EVALUATION OF RANDOM WALK ALGORITHMS ON WIRELESS NETWORKS