The simple implementation of routing algorithm in flooding manner. Its purpose is only for learning.
If a source node want to send a packet to a sink, the packet is broadcasted to node neighbors -- intermediate nodes. Expectedly, the packet will be forwarded through intermediates, and, finally meeting the sink.
In case a packet is remembered that it was passed, an intermidiate will discard -- no forwarding it.
- Change directory into "motelib", then
source motelib-vars.sh
. - Build the project with
make
. - Run the simulator with Python 2.7:
python sim-tri2sink-flood.py
, to learn the routing mechnism.
The lastest test is the result of sim-tri2sink-flood.py.