<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Optimization Model of Structurally Functional Self- Organization of Multi-Radio Multi-Channel Mesh- Networks Using Hypergraphs</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Poltava University of Economics and Trade</institution>
          ,
          <addr-line>Poltava, 3, Koval St.</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>A mathematical model with use hypergraph representation for the optimization of multi-radio multi-channel mesh networks of standard IEEE 802.11 is proposed. Thanks to the use of hypergraphs, it was possible not only to analyze in detail the configurations of the mesh network together with all its elements, but also to distribute non-overlapping frequency channels when solving the routing problem. Thus, using the hypergraph representation of the mesh network, the problem of distributing non-overlapping frequency channels and streaming routing was consistently solved.</p>
      </abstract>
      <kwd-group>
        <kwd>Optimization</kwd>
        <kwd>Hypergraphs</kwd>
        <kwd>Multi-radio multi-channel meshnetwork</kwd>
        <kwd>Flow routing model</kwd>
        <kwd>Non-overlapping frequency channels</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Currently ongoing protocol upgrading in the IEEE 802.11 family of standards is
aimed at improving the performance of Wireless Local Access Networks (WLAN).
At the same time, active efforts are being made to develop and implement a new
IEEE 802.11a standard for constructing WLANs. A significant increase in the
performance of IEEE 802.11ac networks is achieved due to the use of wider channels,
improved modulation efficiency (the method of transmitting data bits by
radiofrequency waves) and multi-user connections (Multi-User MIMO).</p>
      <p>
        Along with the introduction of new standards in WLAN technology, performance
improvements can be achieved using multi-hop wireless mesh networks (WMN) of
the IEEE 802.11 standard [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The highest result with increasing the performance of a
wireless network (up to 2-3 times) can be achieved using Multi-Radio Multi-Channel
Wireless Mesh Networks (MR MC WMN) [
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2-4</xref>
        ], which implies implementation of
both one and several radio interfaces on each mesh station adjusted to different
nonoverlapping frequency channels (FCs). The high claimed capabilities of the MR MC
WMN of the IEEE 802.11 standard are provided, on the one hand, by efficient
solutions to the problem of the allocation of non-overlapping FCs, and on the other hand,
they impose rigid requirements on the effectiveness of network resource management
tools and, in particular, on traffic management and routing protocols.
      </p>
      <p>
        Analysis of known solutions for the allocation of non-overlapping FCs [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref4 ref5 ref6 ref7 ref8 ref9">4-12</xref>
        ] and
routing [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], it is established that they are all based on using the graphical image of
WMN, while not ensuring adequate consideration of their features due to the
formation of the mesh network domain structure. Thus, when simulation MR MC WMN,
must use existing, more effective methods of topological representation of a mesh
network [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. To solve the problems of allocation of non-overlapping FCs and routing
in MR MC WMN, the approach based on the hypergraph image of the mesh network
has proved itself [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ].
      </p>
      <p>
        Within the framework of a hypergraph image, there is a possibility of MR MC
WMN mathematical description from the point of view of solving the distribution
problem of non-overlapping frequency channels [
        <xref ref-type="bibr" rid="ref17 ref19">17, 19</xref>
        ] (structural self-organization)
and the routing problem [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] (functional self-organization) using a hypergraph image
of the mesh network. It should be noted that these tasks of structural and functional
self-organization of MR MC WMN using models [
        <xref ref-type="bibr" rid="ref17 ref18 ref19">17-19</xref>
        ] are solved separately at the
data link and network layers of the OSI model, while not ensuring their consistency.
However, a rather large source of WMN performance lies in increasing the level of
consistency in solving the distribution problems of non-overlapping FCs and routing,
which can only be achieved by using a unified mathematical description. Therefore,
the actual task is to develop a model of structurally functional self-organization of
multi-radio multi-channel mesh-networks using hypergraphs that provide consistent
solutions for the allocation of non-overlapping frequency channels and routing.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Hypergraph WMN</title>
    </sec>
    <sec id="sec-3">
      <title>Image of</title>
    </sec>
    <sec id="sec-4">
      <title>Multi-Radio</title>
    </sec>
    <sec id="sec-5">
      <title>Multi-Channel</title>
      <p>
        Within the hypergraph image, as it has been shown in [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ], MR MC WMN is
associated with a hypergraph H  I , J; R , where I is the set of vertices; J is a set of
edges; R is a predicate determining the adjacency of stations with stable transmission
ranges (TRs). I  ni , i  1, N , where ni is the element of the set I modeling the
MR MC WMN mesh stations; N is their total number in the mesh network.
J  z j , j  1, Z , where z j is the element of the set J modeling the stable
transmission range; Z is their total number in MR MC WMN. The predicate R being the
incidentor of the hypergraph determines whether the i th station belongs to the stable
transmission range. Therefore, in the case, if the i th mesh station involved in shaping
of the
j th stable transmission range, then the predicate
R ni , z j   1 ,
else R ni , z j   0 . Thus, the specification of MR MC WMN can be produced using a
hypergraph H  I , J ; R composed of a pair of vertex I  ni , i  1, N and edges
J  z j , j  1, Z sets together with a binary predicate R  R ni , z j  defined for all
ni  I and z j  J [
        <xref ref-type="bibr" rid="ref14 ref15 ref16">14-16</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-6">
      <title>Model of Multi-Radio</title>
    </sec>
    <sec id="sec-7">
      <title>Overlapping FCs Allocation</title>
    </sec>
    <sec id="sec-8">
      <title>Multi-Channel WMN Non</title>
      <p>
        Based on the hypergraph image of MR MC WMN (Fig.1 and Fig.2), the initial data
for the problem of the allocation of non-overlapping FCs solved using the
mathematical model [
        <xref ref-type="bibr" rid="ref17 ref18 ref19 ref20">17-20</xref>
        ] are presented as:
1. I  ni , i  1, N is a set of mesh-stations where N is their total number in the
mesh-network;
2. T  kt , t 1, K is a set of non-overlapping FCs where kt is an element of the set
T modelling the t th non-overlapping FCs; K is their total number depending on
the used standard of wireless communication. (according to standard of
IEEE 802.11b/g technology only 3 or 4 non-overlapping FCs is available, in IEEE
802.11а – 12 FCs, and in IEEE 802.11ac is up to 19 non-overlapping FCs);
3. J  z j , j  1, Z  is a set of stable transmission ranges, where Z is the total
number of stable transmission ranges in the mesh network;
4. N (z j )  NH (z j )   ni  I / R(ni , z j )  is station size of the j th stable
transmission range of the mesh-network, that is the number of mesh stations included into
the j th TR;
5. mn*i is an integer parameter characterizing the minimum required number of
included MRs at the i th mesh station. In other words, a station is considered to be
working if it has one radio interface enabled, thus, parameter mni*  1 ; mni is a
number of MRs supported on the i th mesh station is equal from 1 to 3. So,
meshstation can work simultaneously on one, two or three radio interfaces, due to its
technical characteristics.
Within the framework of the hypergraph image, it is possible to uniquely formalize
the rules for the formation of the matrix of stable transmission ranges (TR) introduced
in [
        <xref ref-type="bibr" rid="ref17 ref18 ref19 ref20">17-20</xref>
        ] using the hypergraph incidence matrix H
      </p>
      <p>AH   az j,ni ,
(1)
where azj ,ni  0, otherwise, i.e. R(ni , z j )  0.</p>
      <p>1, if ith station is included into the jth TR, i.e. R(ni , z j )  1;
Given the expression (1), the TR-matrix is rectangular, the number of rows of which
corresponds to the number of stable transmission ranges J , and the number of
columns corresponds to the total number of mesh stations I in the network.</p>
      <p>In the framework of the model, in the process of solving the problem of
distribution FCs among mesh stations of the network, it is necessary to ensure computation of
the Boolean control variable,
xni ,kt 0,1 ( i  1, N ; t  1, K ),
tK1 xni ,kt  mn*i ( i  1, N ),
tK1 xni ,kt  mni ( i  1, N ).</p>
      <p>1, if the tth FC on the ith mesh station is allocated only to one of the MRs;
where xni ,kt  </p>
      <p>0, otherwise.
the result of xni ,kt 0,1 solving the problem of the allocation of non-overlapping
FCs should be the partitioning of the mesh network and of each stable transmission
range into connected collision domains, in which the stations operate on the same FC.
3.1</p>
      <p>Conditions of Constraints for Solving the Problem of the Allocation
of Non-Overlapping FCs
When calculating the desired variables xni ,kt in each separately considered j th stable
transmission range, it is important to observe a number of important conditions of
constraints:</p>
      <p>1. The condition of including the i th mesh station in the network:
where 1  mn*i  mni , tK1 xni ,kt is the number of FCs distributed to the interfaces of a
single mesh station.</p>
      <p>2. The condition for distributing a number of FCs that does not exceed the number
of its MRs to the i th mesh station:
(2)
(3)
(4)
(5)
xni ,kt  sN1 xns ,kt ( R(ni , z j )  R(ns , z j )  1; j  1, Z ; t  1, K ),</p>
      <p>si
where sN1 xns ,kt is the number of the mesh station in the j th stable transmission range
si
(without consideration of the mesh network analyzed), which operates on the t th FC.</p>
      <p>5. The connectivity condition of the mesh network (collision domains) in each
stable transmission range:
tK1 iN1 xni ,kt  NH (z j )  K 1 b ( j  1, Z ; R(ni , z j )  1 ),
(7)
K  N , if K  INT  niN1 mni  / 2;
provided b  </p>
      <p>0, otherwise.</p>
      <p>The expression INT  iN1 mni  / 2 in the restriction condition (7) determines the
maximum number of non-overlapping FCs that can be worked in the RI of the mesh
stations.</p>
      <p>Fulfillment of the condition (7) ensures that the number of used FCs in the j th
stable transmission range can be distributed among the RIs of mesh stations included
in its structure.</p>
      <p>6. The condition for the absence of the effect of a “hidden station”, i.e. a mesh
station that belongs simultaneously to several stable transmission ranges should not
operate on the same FC with mesh stations of different stable TRs:
az j ,ni azq ,ni xni ,kt R(ns ,zq )1 xns ,kt R(nr ,zq )1 xnr ,kt  0 ,</p>
      <p>R(ns ,z j )0 R(nr ,z j )0
provided i  1, N ; t  1, K ; j, q  1, Z ; j  q ; i  s  r .</p>
      <p>7. The condition for operation of one of the sets of mesh stations located at the
overlapping of several stable transmission ranges and using at least two FCs with
mesh stations of different stable TRs:
az j ,ni azq,ni xni ,kt xni ,kh  N az j ,ns xns ,kt  N az j ,ns xns ,kh  N azq,nr xnr ,kt  N azq,nr xnr ,kh   0;
  s1 s1  r1 r1 
az j ,ns azq,ns  0;

az j ,nr azq,nr  0;

provided t, h  1, K ; t  h ; j  q ; i  s  r . For example, fulfilling the condition
azj ,ns azq ,ns  0 means that the s th station is not at the overlap between the j th and
q th stable transmission ranges.</p>
      <p>8. The operation condition for at least one of the many mesh stations located with
the overlap of several stable TRs on more than one FC:</p>
      <p>K N az j ,ni azq ,ni xni ,kt   N az j ,ni azq ,ni  1
t 1 i1 i1
( j, q  1, Z ; j  q ),
where tK1iN 1azj ,ni azq ,ni xni ,kt  is the number of included RIs at the mesh stations that are
at the overlap between the j th and q th zones of stable transmission ranges;
iN1azj ,ni azq ,ni  is the number of mesh stations located at the overlap between the j th
and q th stable transmission ranges.</p>
      <p>Fulfillment of the condition (10) together with (7)-(9) guarantees that the number
of included RIs taking into account the number of mesh stations and the
nonoverlapping FCs supported in wireless communication technology will ensure the
coherence of the multi-channel mesh network.</p>
      <p>
        When choosing the optimality criterion, it is necessary, for example, to minimize
the interference level, to increase the connectivity of the mesh network and to
eliminate the effect of the "hidden" station [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] in order to solve the problem of the
allocation of non-overlapping FCs. In [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], an approach was proposed to increase the
overall performance of a wireless mesh network based on minimizing the sum of quadratic
forms from the number of stations forming the collision domains within a particular
TR,
min Z
z1 kK1 nN1 xn,k dn,z 
2
(11)
taking into account the restriction conditions (2)-(10). The use of this criterion will
allow to get rid of redundancy when solving the problem of distributing a FC in a
multi-radio multi-channel mesh network. The indicated redundancy is expressed in
the distributing of the FC for the RI of mesh stations in the network, which might not
be used. Using this optimization criterion allows minimizing the number of stations in
the collision domains thereby reducing the level of interference and the probability of
the collisions themselves [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>An example of a mesh network resulting from the solution of the problem of
allocation of non-overlapping FCs using a model (2)-(11) is shown in Fig. 3, and its
hypergraph image is given in Fig. 4.
The configuration of MR MC WMN consists of five stable transmission ranges
( Z  5 ), formed by twenty-five mesh stations ( N  25 ). The indicated configuration
of the mesh network corresponds to the hypergraph H  I , J ; R shown in Fig. 4 with a
set of vertices a set of stable transmission
ranges J  z1, z2 ,</p>
      <p>,z5 and a predicate R  ni , z j  determining whether a certain station
belongs to one of the stable TRs.</p>
      <p>n1
d1
n23
d13
n3</p>
      <p>d2
n2
n24
n25
d12
d11
n22
n21
n4</p>
      <p>n5
d3
n7
n20
n18</p>
      <p>n6
d10</p>
      <p>d4
n12
n17
n19
n8
d5
n9</p>
      <p>d6
n15
n16
d9
n10</p>
      <p>n11
d8
n14
d7
n13
Thus, the hypergraph image MR MC WMN obtained as a result of solving the
distribution problem of non-overlapping FCs has allowed describing in more complete and
detailed form possible configurations of the whole mesh network in general, as well
as of its individual elements represented as vertices and edges of the hypergraph. In
addition, the mesh network partitioning into collision domains obtained as a result of
solving the distribution problem of non-overlapping FCs can be used as a basis for
solving the routing problem. However, when solving the routing problem, it becomes
necessary to take into account not only the structural, but also the functional
characteristics of the multi-radio multi-channel mesh network. Therefore, there is a need to
formalize the routing task in MR MC WMN presented as a hypergraph.
4</p>
    </sec>
    <sec id="sec-9">
      <title>Conclusion</title>
      <p>The model of structural and functional self-organization with the consistent solution
of the distribution problems of non-overlapping frequency channels and flow routing
in MR MC WMN of the IEEE 802.11 standard using hypergraphs is proposed. If in
the solutions given above the problem of the allocation of non-overlapping FCs has
been oriented to obtaining a connected and balanced by the bandwidths of the mesh
network structure, in the framework of the proposed model, the solution of these tasks
is subject to a single common goal: to improve the end-to-end quality of service in
terms of performance due to the coordinated use of network resources of multi-radio
multi-channel mesh-networks, which has been especially manifested with an increase
in the degree of overlap between the stable transmission ranges, the number of radio
interfaces on mesh stations and the number of supported non-overlapping frequency
channels in the network.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Raniwala</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gopalan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chiueh</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks</article-title>
          .
          <source>ACM SIGMOBILE Mobile Computing and Communications Review</source>
          .
          <volume>8</volume>
          ,
          <fpage>50</fpage>
          -
          <lpage>62</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Shin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bagchi</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>An optimization framework for monitoring multi-channel multi-radio wireless mesh networks</article-title>
          .
          <source>Ad Hoc Networks</source>
          .
          <volume>11</volume>
          ,
          <fpage>926</fpage>
          -
          <lpage>943</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Skalli</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghosh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzini</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions</article-title>
          .
          <source>IEEE Communications Magazine</source>
          .
          <volume>45</volume>
          ,
          <fpage>86</fpage>
          -
          <lpage>95</lpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Channel allocation in multi-channel wireless mesh networks</article-title>
          .
          <source>Computer Communications</source>
          .
          <volume>34</volume>
          ,
          <fpage>803</fpage>
          -
          <lpage>815</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Collins</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Wireless networks</article-title>
          .
          <source>McGraw Hill Professional</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Methley</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Essentials of Wireless Mesh Networking. Cambridge: Cambridge University Press (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Saini</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sohi</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Interference Aware, Topology, Power and Flow Control Channel Assignment Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks</article-title>
          .
          <source>International Journal of Computer Sciences and Engineering</source>
          .
          <volume>6</volume>
          ,
          <fpage>939</fpage>
          -
          <lpage>947</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kyasanur</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jungmin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chereddi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vaidya</surname>
          </string-name>
          , N.:
          <article-title>Multichannel mesh networks: challenges and protocols</article-title>
          .
          <source>IEEE Wireless Communications</source>
          .
          <volume>13</volume>
          ,
          <fpage>30</fpage>
          -
          <lpage>36</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Gogolieva</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garkusha</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abed</surname>
            ,
            <given-names>A.H.:</given-names>
          </string-name>
          <article-title>A mathematical model of channel distribution in multichannel mesh networks 802.11</article-title>
          . In: 11th
          <source>International Conference The Experience of Designing and Application, CAD Systems in Microelectronics (CADSM)</source>
          , pp.
          <fpage>71</fpage>
          -
          <lpage>73</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Sridhar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jha</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Channel assignment in multi-radio wireless mesh networks: A graph-theoretic approach</article-title>
          .
          <source>In.: First International Communication Systems and Networks and Workshops</source>
          , Bangalore, pp.
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pongaliur</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Channel allocation and routing in hybrid multichannel multiradio wireless mesh networks</article-title>
          .
          <source>Mobile Computing, IEEE Transactions 12(2)</source>
          ,
          <fpage>206</fpage>
          -
          <lpage>218</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A channel assignment algorithm for multi-radio multi-channel in wireless mesh networks</article-title>
          .
          <source>In: International Conference on Intelligent Computing and Integrated Systems</source>
          , Guilin,
          <fpage>902</fpage>
          -
          <lpage>905</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Shreenidhi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Puttamadappa</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Distributed Efficient Channel Allocation Technique for Multi-Radio Multichannel Interference-aware Multipath Routing Protocol in Wireless Mesh Networks</article-title>
          .
          <source>International Journal of Engineering Research</source>
          .
          <volume>4</volume>
          ,
          <fpage>426</fpage>
          -
          <lpage>432</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Gálvez</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Efficient rate allocation, routing and channel assignment in wireless mesh networks supporting dynamic traffic flows</article-title>
          .
          <source>Ad Hoc Networks</source>
          .
          <volume>11</volume>
          ,
          <fpage>1765</fpage>
          -
          <lpage>1781</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Park</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jung</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jung</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Robust Channel Allocation with Heterogeneous Requirements for Wireless Mesh Backbone Networks</article-title>
          .
          <source>Sensors</source>
          .
          <volume>18</volume>
          ,
          <issue>2687</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Berge</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Hypergraphs: The Theory of Finite Sets</article-title>
          . North-Holland, Amsterdam (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Garkusha</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yevdokymenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Classification and Analysis of Methods of the Distribution Channels in Multichannel Mesh Networks IEEE 802.11</article-title>
          . In: XI International Conference Modern Problems of Radio Engineering, Telecommunications, and Computer Science (TCSET). pp.
          <fpage>273</fpage>
          -
          <lpage>274</lpage>
          .
          <string-name>
            <surname>Lviv</surname>
          </string-name>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Larjomaa</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popa</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The Min-Max Edge q-Coloring Problem</article-title>
          .
          <source>Journal of Graph Algorithms and Applications</source>
          .
          <volume>19</volume>
          ,
          <fpage>507</fpage>
          -
          <lpage>528</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Harkusha</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harkusha</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ievdokymenko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Hypergraph representations of topological model mesh-network IEEE 802.11</article-title>
          . In: International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET), Lviv, Ukraine, pp.
          <fpage>876</fpage>
          -
          <lpage>878</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Gogolieva</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Mathematical model of distribution of frequency channels in multichannel Mesh-networks</article-title>
          . In: International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET), Lviv, Ukraine, pp.
          <fpage>31</fpage>
          -
          <lpage>31</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>