• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • Tagged with
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Search Space Analysis and Efficient Channel Assignment Solutions for Multi-interface Multi-channel Wireless Networks

González Barrameda, José Andrés 12 August 2011 (has links)
This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.
2

Search Space Analysis and Efficient Channel Assignment Solutions for Multi-interface Multi-channel Wireless Networks

González Barrameda, José Andrés 12 August 2011 (has links)
This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.
3

Search Space Analysis and Efficient Channel Assignment Solutions for Multi-interface Multi-channel Wireless Networks

González Barrameda, José Andrés 12 August 2011 (has links)
This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.
4

Search Space Analysis and Efficient Channel Assignment Solutions for Multi-interface Multi-channel Wireless Networks

González Barrameda, José Andrés January 2011 (has links)
This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.

Page generated in 0.0611 seconds