Spreadable Connected Autonomic Networks (SCAN)
A Spreadable Connected Autonomic Network (SCAN) is a mobile network that automatically maintains its own connectivity as its constituent nodes move. We envision SCANs to be the foundation for a diverse set of applications such as self-spreading mesh networks and robotic search and rescue systems.
Our work explores how a we can enable SCANs while imposing minimal constraints on the mobility of both the network as a whole, and its member nodes.
We investigate techniques to ensure global connectivity through distributed mobility decisions based purely on local information.
We have developed a constrained mobility algorithm that allows nodes to move freely until such time as their movement may disconnect the network's global connectivity graph, and do so utilizing information restricted to the local (2-hop radius) topology.
We are currently investigating the application of our algorithm to:
- mobile mesh networks that adaptively spread across a space to provide backbone infrastructure coverage
- search and rescue scenarios in which individual nodes should be allowed to investigate areas on their own initiative, unless this could sever network connectivity
Publications:
- Joshua Reich, Vishal Misra, Dan Rubenstein and Gil Zussman, Spreadable Connected Autonomic Networks (SCAN), Columbia University, Number CUCS-016-08, 2008.
[Paper]
[BibTeX]
This applet demonstrates our algorithm for constrained mobility for network connectivity.
Each node independently decides to move or freeze - moving by default, and freezing if it shares less than
k neighbors in common with any of its neighbors.
To use this applet, first press "setup", then "go", feel free to play with the sliders.
This demo was written using NetLogo - demo copyright © Joshua Reich, 2007
