【作者单位】3: Department of Computer Science and Technology, Harbin Insitute of Technology Shenzhen Graduate School Shenzhen, Shenzen 518055, ChinSchool of Information, Renmin University of China, Beijing 100872, China1: Key Laboratory of Data Engineering and Knowledge Engineering, Ministry of Education, Renmin University of China, Beijing 100872, Chin2: School of Information, Renmin University of China, Beijing 100872, China
【摘 要】 In this paper, we study the dominating selection optimisation problem with multiple channels and multiple radios in wireless sensor networks. The objective is to maximise the number of targets covered while selecting at most k nodes and at most k i ... 更多 >> In this paper, we study the dominating selection optimisation problem with multiple channels and multiple radios in wireless sensor networks. The objective is to maximise the number of targets covered while selecting at most k nodes and at most k i channels with each selected node v i . Our problem is a general case of the maximum coverage problem. We propose two algorithms: the first one is based on linear programming and PIPAGE rounding, in which its approximation ratio is 1/K(1−(1−1/m) m ), where m is the number of the dominating nodes and K = max k i . The second algorithm is based on greedy strategy with low time complexity. The simulation shows that the both two algorithms have good performance. << 收起
