An approximation algorithm for dominating nodes selection in multi-channel multi-radio wireless sensor networks
by Deying Li; Lin Liu; Hongwei Du
International Journal of Sensor Networks (IJSNET), Vol. 11, No. 1, 2012

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.

Online publication date: Sun, 22-Jan-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com