Title: An approximation algorithm for dominating nodes selection in multi-channel multi-radio wireless sensor networks

Authors: Deying Li; Lin Liu; Hongwei Du

Addresses: Key Laboratory of Data Engineering and Knowledge Engineering, Ministry of Education, Renmin University of China, Beijing 100872, China; School of Information, Renmin University of China, Beijing 100872, China. ' School of Information, Renmin University of China, Beijing 100872, China. ' Department of Computer Science and Technology, Harbin Insitute of Technology Shenzhen Graduate School Shenzhen, Shenzen 518055, China

Abstract: 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.

Keywords: dominant node selection; multi-channel networks; multi-radio networks; wireless sensor networks; WSNs; approximation algorithm; optimisation.

DOI: 10.1504/IJSNET.2012.045034

International Journal of Sensor Networks, 2012 Vol.11 No.1, pp.57 - 65

Received: 04 May 2011
Accepted: 17 Jun 2011
Published online: 22 Jan 2012 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article