{"title":"能源高效的最小连接控制集算法","authors":"Chakradhar P Research, P Yogesh","doi":"10.1109/ICRTIT.2013.6844215","DOIUrl":null,"url":null,"abstract":"In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node's mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Energy efficient minimum connected dominating set algorithm for MANETs\",\"authors\":\"Chakradhar P Research, P Yogesh\",\"doi\":\"10.1109/ICRTIT.2013.6844215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node's mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].\",\"PeriodicalId\":113531,\"journal\":{\"name\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTIT.2013.6844215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2013.6844215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Energy efficient minimum connected dominating set algorithm for MANETs
In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node's mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].