On the public citation graph
Random walk for self-stabilizing group communication in ad hoc networks
0 signed · 131 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240060106openalex-snapshot
A tight upper bound on the cover time for random walks on graphs
inferredcites →https://doi.org/10.1002/rsa.3240060406openalex-snapshot
A tight lower bound on the cover time for random walks on graphs
inferredcites →https://doi.org/10.1007/3-540-44968-x_24openalex-snapshot
Agents, Distributed Algorithms, and Stabilization
inferredcites →https://doi.org/10.1007/3-540-45414-4_20openalex-snapshot
An Efficient Communication Strategy for Ad-hoc Mobile Networks
inferredcites →https://doi.org/10.1007/3-540-45438-1_11openalex-snapshot
Self-Stabilizing Agent Traversal
inferredcites →https://doi.org/10.1007/3-540-45438-1_3openalex-snapshot
Easy Stabilization with an Agent
inferredcites →https://doi.org/10.1007/3-540-58179-0_49openalex-snapshot
On the random walk method for protocol testing
inferredcites →https://doi.org/10.1007/bfb0056495openalex-snapshot
The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
inferredcites →https://doi.org/10.1016/s0304-3975(01)00398-xopenalex-snapshot
The Bancomat problem: an example of resource allocation in a partitionable asynchronous system
inferredcites →https://doi.org/10.1016/s0304-3975(96)00118-1openalex-snapshot
A fast randomized LOGSPACE algorithm for graph connectivity
inferredcites →https://doi.org/10.1109/icdcs.1993.287668openalex-snapshot
Fast message ordering and membership using a logical token-passing ring
inferredcites →https://doi.org/10.1109/infcom.1997.631180openalex-snapshot
A highly adaptive distributed routing algorithm for mobile wireless networks
inferredcites →https://doi.org/10.1109/reldis.1989.72752openalex-snapshot
A token-based protocol for reliable, ordered multicast communication
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1109/tpds.2003.1214322openalex-snapshot
Communication adaptive self-stabilizing group membership service
inferredcites →https://doi.org/10.1137/0406029openalex-snapshot
Collisions Among Random Walks on a Graph
inferredcites →https://doi.org/10.1145/203095.203101openalex-snapshot
Efficient fault-tolerant algorithms for distributed resource allocation
inferredcites →https://doi.org/10.1145/248052.248120openalex-snapshot
On the impossibility of group membership
inferredcites →https://doi.org/10.1145/248052.248121openalex-snapshot
A new look at membership services (extended abstract)
inferredcites →https://doi.org/10.1145/305619.305649openalex-snapshot
Fundamental control algorithms in mobile networks
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/377769.377776openalex-snapshot
Specifying and using a partitionable group communication service
inferredcites →https://doi.org/10.1145/383962.384053openalex-snapshot
An efficient communication strategy for ad-hoc mobile networks
inferredcites →https://doi.org/10.1145/503112.503113openalex-snapshot
Group communication specifications
inferredcites →https://doi.org/10.1145/800141.804654openalex-snapshot
Fast allocation of nearby resources in a distributed system
inferredcites →https://doi.org/10.1145/93385.93409openalex-snapshot
Token management schemes and random walks yield self-stabilizing mutual exclusion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20461openalex-snapshot
A model of self‐avoiding random walks for searching complex networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-0754-6_17openalex-snapshot
TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-29029-0_16openalex-snapshot
Opportunistic Communication by Pedestrians with Roadside Units as Message Caches
inferred← citeshttps://doi.org/10.1007/978-3-030-39746-3_41openalex-snapshot
Human Mobility and Message Caching in Opportunistic Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-44041-1_46openalex-snapshot
Performance Evaluation of Nomadic Lévy Walk on Unit Disk Graphs Using Hierarchical Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-57811-4_8openalex-snapshot
A Cost Analysis of Routing Algorithms in Pedestrian-Based Delay Tolerant Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_19openalex-snapshot
Self-stabilizing Uniform Reliable Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-031-14314-4_9openalex-snapshot
The Probability of Encounters of Mutual Search Using Lévy Walk on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-46784-4_2openalex-snapshot
The Probability of Encounters of Nomadic Lévy Walk on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-28183-4_7openalex-snapshot
Towards Predictable Vehicular Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_5openalex-snapshot
Self-stabilizing Reconfiguration
inferred← citeshttps://doi.org/10.1007/978-3-319-65521-5_70openalex-snapshot
Collecting Data in Sensor Networks Using Homesick Lévy Walk
inferred← citeshttps://doi.org/10.1007/978-3-319-75928-9_84openalex-snapshot
Performance Evaluation of Lévy Walk on Message Dissemination in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-89335-6_21openalex-snapshot
Tutorial Abstract Virtual Infrastructure
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_35openalex-snapshot
Tight Bounds for the Cover Time of Multiple Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_20openalex-snapshot
Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_6openalex-snapshot
Theoretical Aspects of Graph Models for MANETs
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_37openalex-snapshot
Chameleon-MAC: Adaptive and Self-⋆ Algorithms for Media Access Control in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-24550-3_22openalex-snapshot
Price Stabilization in Networks — What Is an Appropriate Model ?
inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_14openalex-snapshot
Self-stabilizing End-to-End Communication in (Bounded Capacity, Omitting, Duplicating and non-FIFO) Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-36669-7_29openalex-snapshot
Exploring Unknown Paths in Networks Based on Multiple Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-642-39247-4_21openalex-snapshot
Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-45049-9_62openalex-snapshot
On Directional Bias for Network Coverage
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_23openalex-snapshot
Random Walks on Evolving Graphs with Recurring Topologies
inferred← citeshttps://doi.org/10.1007/s00446-007-0027-zopenalex-snapshot
Peer counting and sampling in overlay networks based on random walks
inferred← citeshttps://doi.org/10.1007/s00446-007-0038-9openalex-snapshot
HyperTree for self-stabilizing peer-to-peer systems
inferred← citeshttps://doi.org/10.1007/s00446-015-0246-7openalex-snapshot
Efficient distributed computation of distance sketches in networks
inferred← citeshttps://doi.org/10.1007/s10586-011-0153-zopenalex-snapshot
A distributed clustering algorithm for large-scale dynamic networks
inferred← citeshttps://doi.org/10.1007/s10626-010-0092-5openalex-snapshot
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
inferred← citeshttps://doi.org/10.1007/s11265-008-0277-4openalex-snapshot
Using Heterogeneity to Enhance Random Walk-based Queries
inferred← citeshttps://doi.org/10.1007/s12065-018-0189-6openalex-snapshot
Message broadcasting by opportunistic communication on unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.01.026openalex-snapshot
Random walk with jumps in large-scale random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.10.006openalex-snapshot
Performance of random walks in one-hop replication networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.04.008openalex-snapshot
Resource location based on precomputed partial random walks in dynamic networks
inferred← citeshttps://doi.org/10.1016/j.eswa.2007.10.035openalex-snapshot
Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.eswa.2008.10.045openalex-snapshot
A knowledge-based inference multicast protocol using adaptive fuzzy Petri nets
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.10.006openalex-snapshot
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.01.002openalex-snapshot
Efficient random walk sampling in distributed networks
inferred← citeshttps://doi.org/10.1016/j.scico.2012.10.001openalex-snapshot
Spanders: Distributed spanning expanders
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.006openalex-snapshot
Quiescence of self-stabilizing gossiping among mobile agents in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.010openalex-snapshot
Tight bounds for the cover time of multiple random walks
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.044openalex-snapshot
Distributed computation in dynamic networks via random walks
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114387openalex-snapshot
Self-stabilizing indulgent zero-degrading binary consensus
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114886openalex-snapshot
Self-stabilizing multivalued consensus in asynchronous crash-prone systems
inferred← citeshttps://doi.org/10.1017/s0963548311000125openalex-snapshot
Many Random Walks Are Faster Than One
inferred← citeshttps://doi.org/10.1080/17445760903313415openalex-snapshot
A multiple random walks based self-stabilizingk-exclusion algorithm in ad hoc networks
inferred← citeshttps://doi.org/10.1109/aina.2017.102openalex-snapshot
Message Dissemination Using Lévy Flight on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1109/aina.2018.00034openalex-snapshot
Resource Exploration Using Levy Walk on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1109/ants.2009.5409896openalex-snapshot
Two algorithms for network size estimation for master/slave ad hoc networks
inferred← citeshttps://doi.org/10.1109/ccnc.2009.4784895openalex-snapshot
Effects of Mobility in Hierarchical Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/comst.2014.2354398openalex-snapshot
A Survey of Distributed Data Aggregation Algorithms
inferred← citeshttps://doi.org/10.1109/edcc53658.2021.00023openalex-snapshot
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems
inferred← citeshttps://doi.org/10.1109/icc.2012.6364456openalex-snapshot
Geo-dissemination in vehicular ad hoc networks
inferred← citeshttps://doi.org/10.1109/icdcsw.2009.81openalex-snapshot
An Adapting Random Walk for Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062122openalex-snapshot
RADcast: Enabling Reliability Guarantees for Content Dissemination in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195727openalex-snapshot
Near-optimal random walk sampling in distributed networks
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567062openalex-snapshot
Horizon on the move: Geocast in intermittently connected vehicular ad hoc networks
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536491openalex-snapshot
A robust and energy efficient protocol for random walk in ad hoc networks with IEEE 802.11
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00114openalex-snapshot
Self-Stabilizing Supervised Publish-Subscribe Systems
inferred← citeshttps://doi.org/10.1109/iscc.2010.5546612openalex-snapshot
Managing clusters among distributed dynamic environments
inferred← citeshttps://doi.org/10.1109/ispdc.2008.70openalex-snapshot
Token Loss Detection for Random Walk based Algorithm
inferred← citeshttps://doi.org/10.1109/iwcmc.2008.189openalex-snapshot
An Efficient Biasing Strategy for Random Walk in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/mass.2010.5663954openalex-snapshot
On the coverage process of random walk in wireless ad hoc and sensor networks
inferred← citeshttps://doi.org/10.1109/qest.2008.30openalex-snapshot
On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/robio.2009.5420763openalex-snapshot
Robot swarm MANET cooperation based on mobile agent
inferred← citeshttps://doi.org/10.1109/sahcn.2009.5168944openalex-snapshot
Lukewarm Potato Forwarding: A Biased Random Walk Routing Protocol for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/srds.2009.16openalex-snapshot
A Partition-Tolerant Manycast Algorithm for Disaster Area Networks
inferred← citeshttps://doi.org/10.1109/tim.2010.2058584openalex-snapshot
Preventing the Collision of Requests From Slave Clocks in the Precision Time Protocol (PTP)
inferred← citeshttps://doi.org/10.1109/tmc.2005.25openalex-snapshot
Distributed token circulation in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/tmc.2008.151openalex-snapshot
Biased Random Walks in Uniform Wireless Networks
inferred← citeshttps://doi.org/10.1109/tmc.2010.131openalex-snapshot
A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol
inferred← citeshttps://doi.org/10.1109/tnet.2010.2103321openalex-snapshot
Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks
inferred← citeshttps://doi.org/10.1109/twc.2014.2317703openalex-snapshot
Message Dissemination in Intermittently Connected D2D Communication Networks
inferred← citeshttps://doi.org/10.1109/wimob.2014.6962227openalex-snapshot
A cyber-physical system for continuous monitoring of Water Distribution Systems
inferred← citeshttps://doi.org/10.1142/s012905410500284xopenalex-snapshot
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
inferred← citeshttps://doi.org/10.1145/1073970.1074004openalex-snapshot
Autonomous virtual mobile nodes
inferred← citeshttps://doi.org/10.1145/1080810.1080821openalex-snapshot
Autonomous virtual mobile nodes
inferred← citeshttps://doi.org/10.1145/1378533.1378557openalex-snapshot
Many random walks are faster than one
inferred← citeshttps://doi.org/10.1145/1400863.1400869openalex-snapshot
Self-stabilizing and self-orgenizing mobile networks
inferred← citeshttps://doi.org/10.1145/1582716.1582745openalex-snapshot
Fast distributed random walks
inferred← citeshttps://doi.org/10.1145/1810479.1810525openalex-snapshot
Best-effort group service in dynamic networks
inferred← citeshttps://doi.org/10.1145/2312005.2312060openalex-snapshot
Efficient computation of distance sketches in distributed networks
inferred← citeshttps://doi.org/10.1145/3007592.3007600openalex-snapshot
Self-stabilizing Reconfiguration
inferred← citeshttps://doi.org/10.1145/3427796.3427836openalex-snapshot
Self-Stabilizing Indulgent Zero-degrading Binary Consensus
inferred← citeshttps://doi.org/10.1155/2013/264383openalex-snapshot
Improved Message Diffusion Model for Node Coverage Problem of Ad Hoc Network Based on Node Visit Times
inferred← citeshttps://doi.org/10.32657/10356/58914openalex-snapshot
Random walks in distributed networks and their applications
inferred← citeshttps://doi.org/10.3390/s18041287openalex-snapshot
How to Stop Disagreeing and Start Cooperatingin the Presence of Asymmetric Packet Loss
inferred← citeshttps://doi.org/10.3929/ethz-a-010596095openalex-snapshot
Anonymous Distributed Computing: Computability, Randomization and Checkability
inferred← citeshttps://doi.org/10.4108/icst.valuetools2009.7447openalex-snapshot
A random walk model for infection on graphs
inferred← citeshttps://doi.org/10.4108/inter-perf.2007.2112openalex-snapshot
Random Walk Based Routing Protocol for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0810.3836openalex-snapshot
Best-effort Group Service in Dynamic Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1009.1132openalex-snapshot
Efficient Collaborative Application Monitoring Scheme for Mobile Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1011.2953openalex-snapshot
A Distributed Clustering Algorithm for Dynamic Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1210openalex-snapshot
Efficient Computation of Distance Sketches in Distributed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1201.1363openalex-snapshot
Near-Optimal Random Walk Sampling in Distributed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5762openalex-snapshot
A macro-level model for investigating the effect of directional bias on network coverage
inferred← citeshttps://doi.org/10.48550/arxiv.1606.00195openalex-snapshot
Self-stabilizing Reconfiguration
inferred← citeshttps://doi.org/10.7717/peerj-cs.1445openalex-snapshot
Consensus-based clustering and data aggregation in decentralized network of multi-agent systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.