TY - GEN
T1 - Minimizing remote monitoring cost of wireless sensor networks
AU - Xu, Xu
AU - Liang, Weifa
AU - Xu, Zichuan
PY - 2013
Y1 - 2013
N2 - In this paper we consider a remote monitoring scenario where the monitoring center is geographically located far away from the region of the deployed sensor network, and the sensing data by the sensors is transmitted to the monitoring center through a third party telecommunication service, thus a cost associated with this service will be incurred, which is related to the amount of data successfully received by the monitoring center within a specified period. For this scenario, we first formulate a novel optimization problem, namely, the throughput guaranteed service cost minimization problem with an objective to minimize the service cost while the specified network throughput requirement is guaranteed. We show that the problem 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. Finally, we conduct experiments by simulation to evaluate the performance of the proposed heuristic. The experimental results demonstrate the proposed algorithm outperforms other two mentioned algorithms in terms of both service cost and the network lifetime.
AB - In this paper we consider a remote monitoring scenario where the monitoring center is geographically located far away from the region of the deployed sensor network, and the sensing data by the sensors is transmitted to the monitoring center through a third party telecommunication service, thus a cost associated with this service will be incurred, which is related to the amount of data successfully received by the monitoring center within a specified period. For this scenario, we first formulate a novel optimization problem, namely, the throughput guaranteed service cost minimization problem with an objective to minimize the service cost while the specified network throughput requirement is guaranteed. We show that the problem 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. Finally, we conduct experiments by simulation to evaluate the performance of the proposed heuristic. The experimental results demonstrate the proposed algorithm outperforms other two mentioned algorithms in terms of both service cost and the network lifetime.
UR - https://www.scopus.com/pages/publications/84881597546
U2 - 10.1109/WCNC.2013.6554781
DO - 10.1109/WCNC.2013.6554781
M3 - Conference Paper
SN - 9781467359399
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 1476
EP - 1481
BT - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
T2 - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
Y2 - 7 April 2013 through 10 April 2013
ER -