Performance analysis and evaluation of random walk algorithms on wireless networks

DOI10.1142/S0129054112400369zbMATH Open1255.68048OpenAlexW2147044520MaRDI QIDQ4902878FDOQ4902878

Authors: 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

Recommendations

• A robust and energy efficient protocol for random walk in ad hoc networks with IEEE 802.11
• The power of choice in random walks: An empirical study
• A Random Graph Model of Mobile Wireless Networks
• Cover time and mixing time of random walks on dynamic graphs
• Performance of random walks in one-hop replication networks

zbMATH Keywords

random graphwireless networkcover timerandom walk algorithmdynamic graphmobile network

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Unit disk 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
• Title not available (Why is that?)
• Space graphs and sphericity
• On the cover time and mixing time of random geometric graphs

Cited In (1)

• A robust and energy efficient protocol for random walk in ad hoc networks with IEEE 802.11

This page was built for publication: Performance analysis and evaluation of random walk algorithms on wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902878)