Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fast randomized LOGSPACE algorithm for graph connectivity
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
On the impossibility of group membership
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A new look at membership services (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Computer networks (3rd ed.)
Mobile data and wireless LAN technologies
Mobile data and wireless LAN technologies
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Mobile Computing
The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
An Efficient Communication Strategy for Ad-hoc Mobile Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Agents, Distributed Algorithms, and Stabilization
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Self-Stabilizing Agent Traversal
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Easy Stabilization with an Agent
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Communication Adaptive Self-Stabilizing Group Membership Service
IEEE Transactions on Parallel and Distributed Systems
A tight upper bound on the cover time for random walks on graphs
Random Structures & Algorithms
A tight lower bound on the cover time for random walks on graphs
Random Structures & Algorithms
Self-stabilizing and self-orgenizing mobile networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Expert Systems with Applications: An International Journal
Tutorial Abstract Virtual Infrastructure
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A knowledge-based inference multicast protocol using adaptive fuzzy Petri nets
Expert Systems with Applications: An International Journal
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Proceedings of the 28th ACM symposium on Principles of distributed computing
A random walk model for infection on graphs
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Effects of mobility in hierarchical mobile ad hoc networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Two algorithms for network size estimation for master/slave ad hoc networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Best-effort group service in dynamic networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Robot swarm MANET cooperation based on mobile agent
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Random walk with jumps in large-scale random geometric graphs
Computer Communications
Chameleon-MAC: adaptive and self-algorithms for media access control in mobile ad hoc networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
Discrete Event Dynamic Systems
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Price stabilization in networks: what is an appropriate model?
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
Journal of the ACM (JACM)
Exploring unknown paths in networks based on multiple random walks
IScIDE'12 Proceedings of the third Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
Spanders: Distributed spanning expanders
Science of Computer Programming
| Hi-index | 0.01 |
We introduce a self-stabilizing group communication system for ad hoc networks. The system design is based on a mobile agent, collecting and distributing information, during a random walk. Three possible settings for modeling the location of the mobile nodes (processors) in the ad hoc network are presented: slow location change, complete random change, and neighbors with probability. The group membership algorithm is based on a mobile agent collecting and distributing information. The new techniques support group membership and multicast, and also support resource allocation.