Routing Restriction

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 1497 Experts worldwide ranked by ideXlab platform

Gökbayrak Kağan - One of the best experts on this subject based on the ideXlab platform.

  • Joint gateway selection, transmission slot assignment, Routing and power control for wireless mesh networks
    Elsevier, 2015
    Co-Authors: Yıldırım, Emre Alper, Gökbayrak Kağan
    Abstract:

    Wireless mesh networks (WMNs) provide cost effective solutions for setting up a communications network over a certain geographic area. In this paper, we study strategic problems of WMNs such as selecting the gateway nodes along with several operational problems such as Routing, power control, and transmission slot assignment. Under the assumptions of the physical interference model and the tree-based Routing Restriction for traffic flow, a mixed integer linear programming (MILP) formulation is presented, in which the objective is to maximize the minimum service level provided at the nodes. A set of valid inequalities is derived and added to the model in an attempt to improve the solution quality. Since the MILP formulation becomes computationally infeasible for larger instances, we propose a heuristic method that is aimed at solving the problem in two stages. In the first stage, we devise a simple MILP problem that is concerned only with the selection of gateway nodes. In the second stage, the MILP problem in the original formulation is solved by fixing the gateway nodes from the first stage. Computational experiments are provided to evaluate the proposed models and the heuristic method.Scientific and Technological Research Council of Turkey (TUBITAK); TUBA-GEBI

Alper E Yıldırım - One of the best experts on this subject based on the ideXlab platform.

  • Joint gateway selection, transmission slot assignment, Routing and power control for wireless mesh networks
    2020
    Co-Authors: Kagan $ Gokbayrak, Alper E Yıldırım
    Abstract:

    a b s t r a c t Wireless mesh networks (WMNs) provide cost effective solutions for setting up a communications network over a certain geographic area. In this paper, we study strategic problems of WMNs such as selecting the gateway nodes along with several operational problems such as Routing, power control, and transmission slot assignment. Under the assumptions of the physical interference model and the tree-based Routing Restriction for traffic flow, a mixed integer linear programming (MILP) formulation is presented, in which the objective is to maximize the minimum service level provided at the nodes. A set of valid inequalities is derived and added to the model in an attempt to improve the solution quality. Since the MILP formulation becomes computationally infeasible for larger instances, we propose a heuristic method that is aimed at solving the problem in two stages. In the first stage, we devise a simple MILP problem that is concerned only with the selection of gateway nodes. In the second stage, the MILP problem in the original formulation is solved by fixing the gateway nodes from the first stage. Computational experiments are provided to evaluate the proposed models and the heuristic method

Yıldırım, Emre Alper - One of the best experts on this subject based on the ideXlab platform.

  • Joint gateway selection, transmission slot assignment, Routing and power control for wireless mesh networks
    Elsevier, 2015
    Co-Authors: Yıldırım, Emre Alper, Gökbayrak Kağan
    Abstract:

    Wireless mesh networks (WMNs) provide cost effective solutions for setting up a communications network over a certain geographic area. In this paper, we study strategic problems of WMNs such as selecting the gateway nodes along with several operational problems such as Routing, power control, and transmission slot assignment. Under the assumptions of the physical interference model and the tree-based Routing Restriction for traffic flow, a mixed integer linear programming (MILP) formulation is presented, in which the objective is to maximize the minimum service level provided at the nodes. A set of valid inequalities is derived and added to the model in an attempt to improve the solution quality. Since the MILP formulation becomes computationally infeasible for larger instances, we propose a heuristic method that is aimed at solving the problem in two stages. In the first stage, we devise a simple MILP problem that is concerned only with the selection of gateway nodes. In the second stage, the MILP problem in the original formulation is solved by fixing the gateway nodes from the first stage. Computational experiments are provided to evaluate the proposed models and the heuristic method.Scientific and Technological Research Council of Turkey (TUBITAK); TUBA-GEBI

Kagan $ Gokbayrak - One of the best experts on this subject based on the ideXlab platform.

  • Joint gateway selection, transmission slot assignment, Routing and power control for wireless mesh networks
    2020
    Co-Authors: Kagan $ Gokbayrak, Alper E Yıldırım
    Abstract:

    a b s t r a c t Wireless mesh networks (WMNs) provide cost effective solutions for setting up a communications network over a certain geographic area. In this paper, we study strategic problems of WMNs such as selecting the gateway nodes along with several operational problems such as Routing, power control, and transmission slot assignment. Under the assumptions of the physical interference model and the tree-based Routing Restriction for traffic flow, a mixed integer linear programming (MILP) formulation is presented, in which the objective is to maximize the minimum service level provided at the nodes. A set of valid inequalities is derived and added to the model in an attempt to improve the solution quality. Since the MILP formulation becomes computationally infeasible for larger instances, we propose a heuristic method that is aimed at solving the problem in two stages. In the first stage, we devise a simple MILP problem that is concerned only with the selection of gateway nodes. In the second stage, the MILP problem in the original formulation is solved by fixing the gateway nodes from the first stage. Computational experiments are provided to evaluate the proposed models and the heuristic method