Open-source distributed systems
Ad-hoc Computing Framework
Experiment with distributed algorithms where the network matters.
An event-driven Python component model for teaching and experimenting with distributed algorithms over wireless and ad-hoc networks.
View on GitHub
Overview
AHC bridges communication engineering and software development. It provides composable, asynchronous components for building distributed algorithms while retaining the network effects that general concurrency tools often hide.
Researchers and students can model wireless channels, packet collisions, contention, error control, topology changes and multi-hop transport in a reusable experimentation environment.
Core capabilities
Event-driven components
Compose distributed behavior from clear asynchronous Python building blocks.
Wireless constraints
Represent channel characteristics, contention, collisions and transmission effects.
Protocol experimentation
Explore topology, multi-hop transport, reliability and distributed coordination.
Education-ready design
Connect algorithm concepts with observable network behavior in the classroom.
Open-source foundation
Inspect, reproduce and extend the framework for new research questions.
Designed outcomes
Built to create practical value.
- Faster prototyping of wireless distributed algorithms
- A shared language for communication and software engineers
- More reproducible experiments and teaching material
- A practical foundation for further research
