Research Article

# An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks

## Algorithm 1

Outline of broadcast scheduling algorithm.
 Input:   FSM table of network Output:   ${\Re }_{m}$ - Optimum cover (1) From FSM table of network, generate all compatible (incompatible) pairs; If (no compatibles)  $\left\{$ ${\Re }_{m}$   ← set of states $\epsilon ;$ stop;  $\right\}$ else Find maximal compatibles ${\mathrm{\Omega }}_{m}$ and incompatibles ${\mathrm{\Omega }}_{i};$ (2) Find the tight lower bound L and the bound incompatible ${\text{IC}}_{b};$ (3) Form compatible groups CG with respect to ${\text{IC}}_{b};$ (4) Let limit = min $\left(|{\text{CG}}_{1}|,100\right);$   $j=1;$  Let ${s}_{1}$be the first state in ${\text{IC}}_{b};$ (5)  while (j$<$ limit) $\left\{$ Include in schedule $\Re \left(j\right),$ compatible ${\text{C}}_{j}\in \text{CG(}{s}_{1}\text{)};$ for (every state ${s}_{i}\in {\text{IC}}_{b}$ where ${s}_{i}$ ≠ ${s}_{1}$) $\left\{$ (a) Apply selection criteria and include a compatible ${\text{C}}_{n}\in \text{CG(}{s}_{i}\text{)}$ in $\Re \left(j\right);$ (b)  for (every state ${s}_{k}\in {\text{C}}_{n}$) Increment utility factor $\mu \left({s}_{k}\right);$   $\right\}$ for (every state ${s}_{i}\mid {s}_{i}\in \epsilon ,{s}_{i}\notin \Re \left(j\right)$) Include in $\Re$(j) largest cardinality compatible covering the state ${s}_{i};$ $j=j+1;$   $\right\}$ (6)  for (every $\Re$(j)) compute the performance indices and choose ${\Re }_{m}.$

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.