Data quality maximization in sensor networks with a mobile sink

Xu Xu; Weifa Liang; Tim Wark

doi:10.1109/DCOSS.2011.5982160

Data quality maximization in sensor networks with a mobile sink

Xu Xu
, Weifa Liang
, Tim Wark

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

35 Citations (Scopus)

Abstract

In this paper we consider a wireless sensor network with a mobile sink moving along a fixed trajectory without stop to collect data. We assume that a few powerful and high-capacity sensors deployed nearby the trajectory are the gateways, which are able to communicate with the sink directly when the sink is within their transmission ranges. Gateways play the role of relay nodes for the other sensors in the network. We also assume that the time of data uploading from the gateways to the mobile sink is limited. Thus, data from only a subset of sensors, called packet nodes, can be collected and used to estimate those of the others. The data quality is measured by the estimation accuracy. The upper bound on the number of packet nodes for a gateway is defined as the gateway quota. We formulate the optimization problem with the objective to identify the set of packet nodes, allocate them to gateways subject to gateway quotas, and devise an energy-efficient routing protocol, such that the sink can efficiently collect data generated from packet nodes with the maximum quality. Due to the NP-hardness of this problem, we propose a heuristic with low computation complexity. We also conduct extensive experiments by simulation to evaluate the performance of the proposed heuristic. © 2011 IEEE.

Original language	English
Title of host publication	2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11
DOIs	https://doi.org/10.1109/DCOSS.2011.5982160
Publication status	Published - 2011
Externally published	Yes
Event	7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11 - Barcelona, Spain Duration: 27 Jun 2011 → 29 Jun 2011

Publication series

Name	2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11

Conference

Conference	7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11
Place	Spain
City	Barcelona
Period	27/06/11 → 29/06/11

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Access Output

10.1109/DCOSS.2011.5982160

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{09ed8328914144c180a03976261a5fbd,

title = "Data quality maximization in sensor networks with a mobile sink",

abstract = "In this paper we consider a wireless sensor network with a mobile sink moving along a fixed trajectory without stop to collect data. We assume that a few powerful and high-capacity sensors deployed nearby the trajectory are the gateways, which are able to communicate with the sink directly when the sink is within their transmission ranges. Gateways play the role of relay nodes for the other sensors in the network. We also assume that the time of data uploading from the gateways to the mobile sink is limited. Thus, data from only a subset of sensors, called packet nodes, can be collected and used to estimate those of the others. The data quality is measured by the estimation accuracy. The upper bound on the number of packet nodes for a gateway is defined as the gateway quota. We formulate the optimization problem with the objective to identify the set of packet nodes, allocate them to gateways subject to gateway quotas, and devise an energy-efficient routing protocol, such that the sink can efficiently collect data generated from packet nodes with the maximum quality. Due to the NP-hardness of this problem, we propose a heuristic with low computation complexity. We also conduct extensive experiments by simulation to evaluate the performance of the proposed heuristic. {\textcopyright} 2011 IEEE.",

author = "Xu Xu and Weifa Liang and Tim Wark",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected]. ; 7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11 ; Conference date: 27-06-2011 Through 29-06-2011",

year = "2011",

doi = "10.1109/DCOSS.2011.5982160",

language = "English",

isbn = "9781457705137",

series = "2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11",

booktitle = "2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11",

}

Xu, X, Liang, W & Wark, T 2011, Data quality maximization in sensor networks with a mobile sink. in 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11., 5982160, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11, 7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11, Barcelona, Spain, 27/06/11. https://doi.org/10.1109/DCOSS.2011.5982160

Data quality maximization in sensor networks with a mobile sink. / Xu, Xu; Liang, Weifa; Wark, Tim.
2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11. 2011. 5982160 (2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Data quality maximization in sensor networks with a mobile sink

AU - Xu, Xu

AU - Liang, Weifa

AU - Wark, Tim

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2011

Y1 - 2011

N2 - In this paper we consider a wireless sensor network with a mobile sink moving along a fixed trajectory without stop to collect data. We assume that a few powerful and high-capacity sensors deployed nearby the trajectory are the gateways, which are able to communicate with the sink directly when the sink is within their transmission ranges. Gateways play the role of relay nodes for the other sensors in the network. We also assume that the time of data uploading from the gateways to the mobile sink is limited. Thus, data from only a subset of sensors, called packet nodes, can be collected and used to estimate those of the others. The data quality is measured by the estimation accuracy. The upper bound on the number of packet nodes for a gateway is defined as the gateway quota. We formulate the optimization problem with the objective to identify the set of packet nodes, allocate them to gateways subject to gateway quotas, and devise an energy-efficient routing protocol, such that the sink can efficiently collect data generated from packet nodes with the maximum quality. Due to the NP-hardness of this problem, we propose a heuristic with low computation complexity. We also conduct extensive experiments by simulation to evaluate the performance of the proposed heuristic. © 2011 IEEE.

AB - In this paper we consider a wireless sensor network with a mobile sink moving along a fixed trajectory without stop to collect data. We assume that a few powerful and high-capacity sensors deployed nearby the trajectory are the gateways, which are able to communicate with the sink directly when the sink is within their transmission ranges. Gateways play the role of relay nodes for the other sensors in the network. We also assume that the time of data uploading from the gateways to the mobile sink is limited. Thus, data from only a subset of sensors, called packet nodes, can be collected and used to estimate those of the others. The data quality is measured by the estimation accuracy. The upper bound on the number of packet nodes for a gateway is defined as the gateway quota. We formulate the optimization problem with the objective to identify the set of packet nodes, allocate them to gateways subject to gateway quotas, and devise an energy-efficient routing protocol, such that the sink can efficiently collect data generated from packet nodes with the maximum quality. Due to the NP-hardness of this problem, we propose a heuristic with low computation complexity. We also conduct extensive experiments by simulation to evaluate the performance of the proposed heuristic. © 2011 IEEE.

UR - https://www.scopus.com/pages/publications/80052459618

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-80052459618&origin=recordpage

U2 - 10.1109/DCOSS.2011.5982160

DO - 10.1109/DCOSS.2011.5982160

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781457705137

T3 - 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11

BT - 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11

T2 - 7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11

Y2 - 27 June 2011 through 29 June 2011

ER -

Data quality maximization in sensor networks with a mobile sink

Abstract

Publication series

Conference

Bibliographical note

UN SDGs

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this