Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks

Xu Xu; Weifa Liang; Xiaohua Jia; Wenzheng Xu

doi:10.1145/2491288.2491315

Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks

Xu Xu
, Weifa Liang
, Xiaohua Jia
, Wenzheng Xu

Department of Computer Science

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

3 Citations (Scopus)

Abstract

In this paper we consider the use of a link-unreliable wireless sensor network for remote monitoring, where the monitoring center is geographically located far away from the region of the deployed sensor network. The sensing data is transferred to the monitoring center by the third party communication service, which incurs service cost. We first formulate a novel optimization problem of maximizing the network throughput with minimal service cost, which is shown to be NP-hard. We then develop approximation algorithms. We finally evaluate the performance of the proposed algorithms by simulations. Experimental results demonstrate that the solutions delivered by proposed algorithms are fractional to the optimum. Copyright 2013 ACM.

Original language	English
Title of host publication	Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Subtitle of host publication	MobiHoc'13
Publisher	Association for Computing Machinery
Pages	245-248
ISBN (Electronic)	9781450321938
DOIs	https://doi.org/10.1145/2491288.2491315
Publication status	Published - Jul 2013
Event	14th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2013) - Bangalore, India Duration: 29 Jul 2013 → 1 Aug 2013

Conference

Conference	14th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2013)
Place	India
City	Bangalore
Period	29/07/13 → 1/08/13

Research Keywords

Combinatorial optimization problem
Load-balanced forest
Unreliable data transmission

Access Output

10.1145/2491288.2491315

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{5f1bbd2e848b43fcba8acaf1342135cf,

title = "Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks",

abstract = "In this paper we consider the use of a link-unreliable wireless sensor network for remote monitoring, where the monitoring center is geographically located far away from the region of the deployed sensor network. The sensing data is transferred to the monitoring center by the third party communication service, which incurs service cost. We first formulate a novel optimization problem of maximizing the network throughput with minimal service cost, which is shown to be NP-hard. We then develop approximation algorithms. We finally evaluate the performance of the proposed algorithms by simulations. Experimental results demonstrate that the solutions delivered by proposed algorithms are fractional to the optimum. Copyright 2013 ACM.",

keywords = "Combinatorial optimization problem, Load-balanced forest, Unreliable data transmission",

author = "Xu Xu and Weifa Liang and Xiaohua Jia and Wenzheng Xu",

year = "2013",

month = jul,

doi = "10.1145/2491288.2491315",

language = "English",

pages = "245--248",

booktitle = "Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing",

publisher = "Association for Computing Machinery",

address = "United States",

note = "14th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2013) ; Conference date: 29-07-2013 Through 01-08-2013",

}

Xu, X, Liang, W , Jia, X & Xu, W 2013, Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks. in Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing: MobiHoc'13. Association for Computing Machinery, pp. 245-248, 14th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2013), Bangalore, India, 29/07/13. https://doi.org/10.1145/2491288.2491315

Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks. / Xu, Xu; Liang, Weifa ; Jia, Xiaohua et al.
Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing: MobiHoc'13. Association for Computing Machinery, 2013. p. 245-248.

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

TY - GEN

T1 - Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks

AU - Xu, Xu

AU - Liang, Weifa

AU - Jia, Xiaohua

AU - Xu, Wenzheng

PY - 2013/7

Y1 - 2013/7

N2 - In this paper we consider the use of a link-unreliable wireless sensor network for remote monitoring, where the monitoring center is geographically located far away from the region of the deployed sensor network. The sensing data is transferred to the monitoring center by the third party communication service, which incurs service cost. We first formulate a novel optimization problem of maximizing the network throughput with minimal service cost, which is shown to be NP-hard. We then develop approximation algorithms. We finally evaluate the performance of the proposed algorithms by simulations. Experimental results demonstrate that the solutions delivered by proposed algorithms are fractional to the optimum. Copyright 2013 ACM.

AB - In this paper we consider the use of a link-unreliable wireless sensor network for remote monitoring, where the monitoring center is geographically located far away from the region of the deployed sensor network. The sensing data is transferred to the monitoring center by the third party communication service, which incurs service cost. We first formulate a novel optimization problem of maximizing the network throughput with minimal service cost, which is shown to be NP-hard. We then develop approximation algorithms. We finally evaluate the performance of the proposed algorithms by simulations. Experimental results demonstrate that the solutions delivered by proposed algorithms are fractional to the optimum. Copyright 2013 ACM.

KW - Combinatorial optimization problem

KW - Load-balanced forest

KW - Unreliable data transmission

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

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

U2 - 10.1145/2491288.2491315

DO - 10.1145/2491288.2491315

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

SP - 245

EP - 248

BT - Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

PB - Association for Computing Machinery

T2 - 14th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2013)

Y2 - 29 July 2013 through 1 August 2013

ER -

Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this