Optimized Group Channel Assignment Using Computational Geometry over Wireless Mesh Networks

Algorithm 4

Interference Matrix construction.

Leaders in the graph , where = , <

Number of radios per node , where = // depends on the product

Number of -orthogonal channels , where = //depends on the frequency spectrum of the radios

//associated radios of incident links in

//rows = link vertices in and columns = available orthogonal channels

Input: Multi-radio Connectivity Graph and C-MMCG

Output: Interference Matrix

  Identify its corresponding link vertex in //arbitrary selection

   //using (7)

  INL = set of link vertices incident to

    = Identify the associated radios in

  End for

  Identify the triangles formed with other radios in with reference to

   Check the necessary condition //using Thales theorem

   Compute skewness //using (8)

    sides of the triangle

    if //Assign same channel to all the links

      to

        // may be assigned any arbitrary value between 1 to

      End for

     End for

    elseif

      to

        =

      End for

     End for

    End if

   End for

  End for

 End for

End for