TY - JOUR
T1 - Remote monitoring cost minimization for an unreliable sensor network with guaranteed network throughput
AU - Xu, Xu
AU - Liang, Weifa
AU - Xu, Zichuan
N1 - Publisher Copyright:
© 2014 China Agricultural University
PY - 2014/12/1
Y1 - 2014/12/1
N2 - In this paper we consider a link-unreliable remote monitoring scenario where the monitoring center is geographically located far away from the region of the deployed sensor network, and sensing data by the sensors in the network will be transferred to the remote monitoring center through a third party telecommunication service. A cost associated with this service will be incurred, which will be determined by the number of gateways employed and the cumulative volume of data successfully received within a specified monitoring period. For this scenario, we first formulate a novel constrained optimization problem with an objective to minimize the service cost while a pre-defined network throughput is guaranteed. We refer to this problem as the throughput guaranteed service cost minimization problem and prove that it is NP-complete. We then propose a heuristic for it. The key ingredients of the heuristic include identifying gateways and finding an energy-efficient forest of routing trees rooted at the gateways. We also perform theoretical analysis on the solution obtained. Finally, we conduct experiments by simulations to evaluate the performance of the proposed algorithm. Experimental results demonstrate the proposed algorithm outperforms other algorithms in terms of both the service cost and the network lifetime.
AB - In this paper we consider a link-unreliable remote monitoring scenario where the monitoring center is geographically located far away from the region of the deployed sensor network, and sensing data by the sensors in the network will be transferred to the remote monitoring center through a third party telecommunication service. A cost associated with this service will be incurred, which will be determined by the number of gateways employed and the cumulative volume of data successfully received within a specified monitoring period. For this scenario, we first formulate a novel constrained optimization problem with an objective to minimize the service cost while a pre-defined network throughput is guaranteed. We refer to this problem as the throughput guaranteed service cost minimization problem and prove that it is NP-complete. We then propose a heuristic for it. The key ingredients of the heuristic include identifying gateways and finding an energy-efficient forest of routing trees rooted at the gateways. We also perform theoretical analysis on the solution obtained. Finally, we conduct experiments by simulations to evaluate the performance of the proposed algorithm. Experimental results demonstrate the proposed algorithm outperforms other algorithms in terms of both the service cost and the network lifetime.
KW - Algorithm design and analysis
KW - Constrained optimization
KW - Remote sensing monitoring
KW - Service cost minimization
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85016977950&partnerID=8YFLogxK
U2 - 10.1016/j.inpa.2014.10.001
DO - 10.1016/j.inpa.2014.10.001
M3 - Article
SN - 2214-3173
VL - 1
SP - 83
EP - 94
JO - Information Processing in Agriculture
JF - Information Processing in Agriculture
IS - 2
ER -