A Cross-Layer Design for a Multihop, Self-Healing, and Self-Forming Tactical Network

Algorithm 1

CL-TDMA slot allocation algorithm.

Input: Topology, Node that breaks silence, No of slots in a frame

Output: Slot allocation vector.

Declare an array ‘B’.

x=for all RREPs(HopCount+1%30

sort RREPs in each node with respect to RREP IDs

   For each RREP perform the following steps to find the slot numbers to occupy

(a) Declare an array ‘A’ of size [hopCount+1]

Note: (hopCount from RREP)

(b) If this node is originator then

(i) Allocate the first slot in ‘A’

(c) Else If this node is receiver then

(i) Allocate this slot in ‘A’ to the node

(ii) Update hopCount as [hopCount()+1]+1

Note: () represents hopCount from RREP received from destination)

(d) Else If this node is relaying, two slots will be allocated, one for forward communication and one for backward

communication)

(i) Allocate forward slot in ‘A’ by [hopCount()+1]+1

Note: () represents hopCount from originator/source)

(ii) Allocate backward slot in ‘A’ by

[hopCount()+1]+[hopCount()+1]+1

Note: () hopCount to destination from routing table and () represents hopCount from RREP)

(iii) Allocate backward slot in ‘A’ by

[hopCount()+1]+[hopCount()+1]+1

Note: () hopCount to destination from routing table and () represents hopCount from RREP)

(e) Append array ‘A’ to array ‘B’ and clear A.