S. Koubar, J. Ugon, A. Kruger, A. Rubinov, P. Branch
{"title":"一种基于非光滑优化技术的无线局域网接入点布局新算法","authors":"S. Koubar, J. Ugon, A. Kruger, A. Rubinov, P. Branch","doi":"10.1109/ICACT.2005.245869","DOIUrl":null,"url":null,"abstract":"In wireless local area network (WLAN), signal coverage is obtained by proper placement of access points (APs). The impact of incorrect placement of APs is significant. If they are placed too far apart, they generate a coverage gap but if they are too close to each other, this leads to excessive co-channel interferences. In this paper, we describe a mathematical model we have developed to find the optimal number and location of APs. To solve the problem, we use an optimization algorithm developed at the University of Ballarat called discrete gradient algorithm. Results indicate that our model is able to solve optimal coverage problems for different numbers of users","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A new algorithm for the placement of WLAN access points based on nonsmooth optimization technique\",\"authors\":\"S. Koubar, J. Ugon, A. Kruger, A. Rubinov, P. Branch\",\"doi\":\"10.1109/ICACT.2005.245869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless local area network (WLAN), signal coverage is obtained by proper placement of access points (APs). The impact of incorrect placement of APs is significant. If they are placed too far apart, they generate a coverage gap but if they are too close to each other, this leads to excessive co-channel interferences. In this paper, we describe a mathematical model we have developed to find the optimal number and location of APs. To solve the problem, we use an optimization algorithm developed at the University of Ballarat called discrete gradient algorithm. Results indicate that our model is able to solve optimal coverage problems for different numbers of users\",\"PeriodicalId\":293442,\"journal\":{\"name\":\"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.\",\"volume\":\"2015 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACT.2005.245869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2005.245869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new algorithm for the placement of WLAN access points based on nonsmooth optimization technique
In wireless local area network (WLAN), signal coverage is obtained by proper placement of access points (APs). The impact of incorrect placement of APs is significant. If they are placed too far apart, they generate a coverage gap but if they are too close to each other, this leads to excessive co-channel interferences. In this paper, we describe a mathematical model we have developed to find the optimal number and location of APs. To solve the problem, we use an optimization algorithm developed at the University of Ballarat called discrete gradient algorithm. Results indicate that our model is able to solve optimal coverage problems for different numbers of users