Journal of Computer Networks and Communications / 2008 / Article / Alg 1

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:  m - Optimum cover
(1)From FSM table of network, generate all compatible (incompatible) pairs;
If (no compatibles){
m set of states ε;
stop;}
else Find maximal compatibles Ωm and incompatibles Ωi;
(2)Find the tight lower bound L and the bound incompatible ICb;
(3)Form compatible groups CG with respect to ICb;
(4)Let limit = min (|CG1|,100);j=1;Let s1be the first state in ICb;
(5)while (j< limit) {
Include in schedule (j), compatible CjCG(s1);
for (every state siICb where sis1) {
(a)Apply selection criteria and include a compatible CnCG(si) in (j);
(b)for (every state skCn) Increment utility factor μ(sk);}
for (every state sisiε,si(j))
Include in (j) largest cardinality compatible covering the state si;
j=j+1;}
(6)for (every (j))
compute the performance indices and choose 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.