Efficient algorithms for sensor detachment in WMSNs
by Li-Ling Hung
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 16, No. 3, 2014

Abstract: Target coverage is an important issue in wireless sensor networks (WSNs). This work copes with the target coverage problem which detaches a set of mobile sensors to targets efficiently. Given a set of disconnected targets with different quality of monitoring (QoM) and a set of mobile sensors which are distributed randomly in the networks, this paper develops two efficient algorithms for detaching mobile sensors to the targets such that the QoM of each target is satisfied. Performance study reveals that the proposed mechanisms outperform known mechanisms in terms of the satisfied QoMs of all targets and the movement cost of all mobile sensors as well as the life time of the wireless mobile sensor networks (WMSNs).

Online publication date: Mon, 25-Aug-2014

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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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