版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:School of Information Science and Engineering Qufu Normal University Rizhao 276826 China School of Computer Science and Technology Shandong University Qingdao 266510 China Department of Computer Science The George Washington University Washington DC 20052 USA
出 版 物:《Procedia Computer Science》 (计算机科学会议集)
年 卷 期:2019年第147卷
页 面:446-452页
学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:the connected dominating set the cognitive radio networks the maximum lifetime distributed algorithm
摘 要:Connected dominating set (CDS) is the most representative technology for constructing a virtual backbone in wireless networks and plays an important role in wireless applications including broadcasting, routing and so on. In a cognitive radio networks, the lifetime and efficiency are two important indices for measuring CDS algorithms due to the random activities of primary users (PUs). However, to the best of our knowledge, the existing algorithms for CDS construction in CRNs ignore the execution effectiveness instead of lifetime. In this paper, we propose a four-phase distributed algorithm to maximize the lifetime of CDS while guaranteeing the effectiveness of the algorithm. The proposed algorithm terminates in O(N 3 log N) timeslots, which is more effective than that of O(N 4 ).