{"title":"支持无线自组织网络移动性的虚拟骨干网局部重构","authors":"P. Teymoori, N. Yazdani","doi":"10.1109/ISTEL.2008.4651332","DOIUrl":null,"url":null,"abstract":"Constructing a connected dominating set (CDS) has been widely used as a topology control method and a virtual backbone to reduce energy consumption and communication overhead. Previous works emphasize on constructing the minimum CDS (MCDS) and do not consider node mobility and CDS reconstruction where energy balancing is required. In this paper, we propose a CDS reconstruction algorithm which is able to reconfigure the CDS locally in the presence of mobility and energy balancing without the need for reconstructing the whole CDS. The algorithm does not increase the approximation factor of the algorithm which has constructed the CDS already and it has O(Delta log Delta) and O(Delta) time and message complexity, respectively, which is a great improvement in comparison with the other approaches, where Delta is the maximum degree of the network graph.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"75 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Local reconstruction of virtual backbone to support mobility in wireless ad hoc networks\",\"authors\":\"P. Teymoori, N. Yazdani\",\"doi\":\"10.1109/ISTEL.2008.4651332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Constructing a connected dominating set (CDS) has been widely used as a topology control method and a virtual backbone to reduce energy consumption and communication overhead. Previous works emphasize on constructing the minimum CDS (MCDS) and do not consider node mobility and CDS reconstruction where energy balancing is required. In this paper, we propose a CDS reconstruction algorithm which is able to reconfigure the CDS locally in the presence of mobility and energy balancing without the need for reconstructing the whole CDS. The algorithm does not increase the approximation factor of the algorithm which has constructed the CDS already and it has O(Delta log Delta) and O(Delta) time and message complexity, respectively, which is a great improvement in comparison with the other approaches, where Delta is the maximum degree of the network graph.\",\"PeriodicalId\":133602,\"journal\":{\"name\":\"2008 International Symposium on Telecommunications\",\"volume\":\"75 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTEL.2008.4651332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2008.4651332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Local reconstruction of virtual backbone to support mobility in wireless ad hoc networks
Constructing a connected dominating set (CDS) has been widely used as a topology control method and a virtual backbone to reduce energy consumption and communication overhead. Previous works emphasize on constructing the minimum CDS (MCDS) and do not consider node mobility and CDS reconstruction where energy balancing is required. In this paper, we propose a CDS reconstruction algorithm which is able to reconfigure the CDS locally in the presence of mobility and energy balancing without the need for reconstructing the whole CDS. The algorithm does not increase the approximation factor of the algorithm which has constructed the CDS already and it has O(Delta log Delta) and O(Delta) time and message complexity, respectively, which is a great improvement in comparison with the other approaches, where Delta is the maximum degree of the network graph.