@InProceedings{6952008,
  author = {M. Elwekeil and M. Alghoniemy and O. Muta and A. Abdel-Rahman and H. Furukawa and H. Gacanin},
  booktitle = {2014 22nd European Signal Processing Conference (EUSIPCO)},
  title = {A maxmin model for solving channel assignment problem in IEEE 802.11 networks},
  year = {2014},
  pages = {146-150},
  abstract = {In this paper, an optimization model for solving the channel assignment problem in multi-cell WLANs is proposed. This model is based on maximizing the minimum distance between access points (APs) that work on the same channel. The proposed model is formulated in the form of a mixed integer linear program (MILP). The main advantage of the proposed algorithm is that it ensures non-overlapping channel assignment with no overhead power measurements. The proposed channel assignment algorithm can be implemented within practical time frames for different topology sizes. Simulation results indicate that the proposed algorithm exhibits better performance than that of the pick-first greedy algorithm and the single channel assignment method.},
  keywords = {cellular radio;channel allocation;integer programming;linear programming;wireless LAN;maxmin model;channel assignment problem;IEEE 802.11 networks;optimization model;multicell WLAN;minimum distance maximization;access points;AP;mixed integer linear program;MILP;nonoverlapping channel assignment;time frame;topology size;pick-first greedy algorithm;single-channel assignment method;Abstracts;Indexes;Companies;Integrated optics;Buildings;WLAN;IEEE 802.11;channel assignment;integer programming;maxmin problem},
  issn = {2076-1465},
  month = {Sep.},
  url = {https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569924143.pdf},
}

{"_id":"bAvpZzHmx2iXsJYAD","bibbaseid":"elwekeil-alghoniemy-muta-abdelrahman-furukawa-gacanin-amaxminmodelforsolvingchannelassignmentprobleminieee80211networks-2014","authorIDs":[],"author_short":["Elwekeil, M.","Alghoniemy, M.","Muta, O.","Abdel-Rahman, A.","Furukawa, H.","Gacanin, H."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["M."],"propositions":[],"lastnames":["Elwekeil"],"suffixes":[]},{"firstnames":["M."],"propositions":[],"lastnames":["Alghoniemy"],"suffixes":[]},{"firstnames":["O."],"propositions":[],"lastnames":["Muta"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["Abdel-Rahman"],"suffixes":[]},{"firstnames":["H."],"propositions":[],"lastnames":["Furukawa"],"suffixes":[]},{"firstnames":["H."],"propositions":[],"lastnames":["Gacanin"],"suffixes":[]}],"booktitle":"2014 22nd European Signal Processing Conference (EUSIPCO)","title":"A maxmin model for solving channel assignment problem in IEEE 802.11 networks","year":"2014","pages":"146-150","abstract":"In this paper, an optimization model for solving the channel assignment problem in multi-cell WLANs is proposed. This model is based on maximizing the minimum distance between access points (APs) that work on the same channel. The proposed model is formulated in the form of a mixed integer linear program (MILP). The main advantage of the proposed algorithm is that it ensures non-overlapping channel assignment with no overhead power measurements. The proposed channel assignment algorithm can be implemented within practical time frames for different topology sizes. Simulation results indicate that the proposed algorithm exhibits better performance than that of the pick-first greedy algorithm and the single channel assignment method.","keywords":"cellular radio;channel allocation;integer programming;linear programming;wireless LAN;maxmin model;channel assignment problem;IEEE 802.11 networks;optimization model;multicell WLAN;minimum distance maximization;access points;AP;mixed integer linear program;MILP;nonoverlapping channel assignment;time frame;topology size;pick-first greedy algorithm;single-channel assignment method;Abstracts;Indexes;Companies;Integrated optics;Buildings;WLAN;IEEE 802.11;channel assignment;integer programming;maxmin problem","issn":"2076-1465","month":"Sep.","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569924143.pdf","bibtex":"@InProceedings{6952008,\n author = {M. Elwekeil and M. Alghoniemy and O. Muta and A. Abdel-Rahman and H. Furukawa and H. Gacanin},\n booktitle = {2014 22nd European Signal Processing Conference (EUSIPCO)},\n title = {A maxmin model for solving channel assignment problem in IEEE 802.11 networks},\n year = {2014},\n pages = {146-150},\n abstract = {In this paper, an optimization model for solving the channel assignment problem in multi-cell WLANs is proposed. This model is based on maximizing the minimum distance between access points (APs) that work on the same channel. The proposed model is formulated in the form of a mixed integer linear program (MILP). The main advantage of the proposed algorithm is that it ensures non-overlapping channel assignment with no overhead power measurements. The proposed channel assignment algorithm can be implemented within practical time frames for different topology sizes. Simulation results indicate that the proposed algorithm exhibits better performance than that of the pick-first greedy algorithm and the single channel assignment method.},\n keywords = {cellular radio;channel allocation;integer programming;linear programming;wireless LAN;maxmin model;channel assignment problem;IEEE 802.11 networks;optimization model;multicell WLAN;minimum distance maximization;access points;AP;mixed integer linear program;MILP;nonoverlapping channel assignment;time frame;topology size;pick-first greedy algorithm;single-channel assignment method;Abstracts;Indexes;Companies;Integrated optics;Buildings;WLAN;IEEE 802.11;channel assignment;integer programming;maxmin problem},\n issn = {2076-1465},\n month = {Sep.},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569924143.pdf},\n}\n\n","author_short":["Elwekeil, M.","Alghoniemy, M.","Muta, O.","Abdel-Rahman, A.","Furukawa, H.","Gacanin, H."],"key":"6952008","id":"6952008","bibbaseid":"elwekeil-alghoniemy-muta-abdelrahman-furukawa-gacanin-amaxminmodelforsolvingchannelassignmentprobleminieee80211networks-2014","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569924143.pdf"},"keyword":["cellular radio;channel allocation;integer programming;linear programming;wireless LAN;maxmin model;channel assignment problem;IEEE 802.11 networks;optimization model;multicell WLAN;minimum distance maximization;access points;AP;mixed integer linear program;MILP;nonoverlapping channel assignment;time frame;topology size;pick-first greedy algorithm;single-channel assignment method;Abstracts;Indexes;Companies;Integrated optics;Buildings;WLAN;IEEE 802.11;channel assignment;integer programming;maxmin problem"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2014url.bib","creationDate":"2021-02-13T17:43:41.580Z","downloads":0,"keywords":["cellular radio;channel allocation;integer programming;linear programming;wireless lan;maxmin model;channel assignment problem;ieee 802.11 networks;optimization model;multicell wlan;minimum distance maximization;access points;ap;mixed integer linear program;milp;nonoverlapping channel assignment;time frame;topology size;pick-first greedy algorithm;single-channel assignment method;abstracts;indexes;companies;integrated optics;buildings;wlan;ieee 802.11;channel assignment;integer programming;maxmin problem"],"search_terms":["maxmin","model","solving","channel","assignment","problem","ieee","802","networks","elwekeil","alghoniemy","muta","abdel-rahman","furukawa","gacanin"],"title":"A maxmin model for solving channel assignment problem in IEEE 802.11 networks","year":2014,"dataSources":["A2ezyFL6GG6na7bbs","oZFG3eQZPXnykPgnE"]}