Date Added: Jul 2010
Cluster based routing protocols has been shown to reduce routing information overhead at high node densities. This paper documents the design process of a cluster based routing protocol. A simulation was created to implement the protocol. It is shown how the cost to maintain the cluster structure, can be reduced further by decreasing the number of nodes that transmit routing information. The formation of clusters is illustrated and the roles of different nodes are described, due to their place in the network topology. A mechanism for the fast detection of broken routes is presented. Basic congestion control is implemented with token scheduling. Performance is measured by a separate module for easier aggregate simulation time measurements.