{"title":"无线网络中的干扰最小化","authors":"H. Aslanyan, J. Rolim","doi":"10.1109/EUC.2010.73","DOIUrl":null,"url":null,"abstract":"Interference minimization problem in wireless sensor and ad-hoc networks are considered. That is to assign a transmission radius to each node of a network, to make it connected and at the same time to minimize the maximum number of overlapping transmission ranges on each node of a network. Additional means of topology control besides the connectivity is blocking the long line connections at the receiver level. We propose a polynomial time approximation algorithm which finds a connected network with at most $O((opt\\ln{n})^{2})$ interference where $opt$ is the minimal interference of the given network of $n$ nodes. The lower bound for this problem, where a general distance function is considered, has been proven to be $O(\\ln{n})$. The algorithm is known which finds a network where the maximum interference is bounded by $O(\\sqrt{n})$.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Interference Minimization in Wireless Networks\",\"authors\":\"H. Aslanyan, J. Rolim\",\"doi\":\"10.1109/EUC.2010.73\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Interference minimization problem in wireless sensor and ad-hoc networks are considered. That is to assign a transmission radius to each node of a network, to make it connected and at the same time to minimize the maximum number of overlapping transmission ranges on each node of a network. Additional means of topology control besides the connectivity is blocking the long line connections at the receiver level. We propose a polynomial time approximation algorithm which finds a connected network with at most $O((opt\\\\ln{n})^{2})$ interference where $opt$ is the minimal interference of the given network of $n$ nodes. The lower bound for this problem, where a general distance function is considered, has been proven to be $O(\\\\ln{n})$. The algorithm is known which finds a network where the maximum interference is bounded by $O(\\\\sqrt{n})$.\",\"PeriodicalId\":265175,\"journal\":{\"name\":\"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUC.2010.73\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUC.2010.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Interference minimization problem in wireless sensor and ad-hoc networks are considered. That is to assign a transmission radius to each node of a network, to make it connected and at the same time to minimize the maximum number of overlapping transmission ranges on each node of a network. Additional means of topology control besides the connectivity is blocking the long line connections at the receiver level. We propose a polynomial time approximation algorithm which finds a connected network with at most $O((opt\ln{n})^{2})$ interference where $opt$ is the minimal interference of the given network of $n$ nodes. The lower bound for this problem, where a general distance function is considered, has been proven to be $O(\ln{n})$. The algorithm is known which finds a network where the maximum interference is bounded by $O(\sqrt{n})$.