Quality of Information Maximization in Lifetime-Constrained Wireless Sensor Networks

In this paper, we investigate the quality of information (QoI) maximization problem by jointly optimizing the data rate and transmit power in lifetime-constrained wireless sensor networks. The QoI at the sink node is characterized by the virtue of the network utility, which quantifies the aggregated...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE sensors journal Ročník 16; číslo 19; s. 7278 - 7286
Hlavní autori: Du, Pengfei, Yang, Qinghai, Shen, Zhong, Kwak, Kyung Sup
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.10.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Approximation algorithms
Data communication
Data models
data rate
network lifetime
power control
quality of information
Resource management
Routing
Sensors
Wireless sensor networks
ISSN:1530-437X, 1558-1748
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we investigate the quality of information (QoI) maximization problem by jointly optimizing the data rate and transmit power in lifetime-constrained wireless sensor networks. The QoI at the sink node is characterized by the virtue of the network utility, which quantifies the aggregated value of the data gathered from different sensor nodes. Then, a network utility maximization (NUM) problem is formulated to maximize the QoI subject to the constraints of the network lifetime and the link capacity. To avoid oscillation among optimal solutions resulted from the usage of multipath routing, the NUM problem is converted into an equivalent problem by exploiting the proximal optimization approach. Correspondingly, the transformed problem can be solved by the proposed proximal approximation-based resource allocation algorithm (PARA), which has good features of fast convergence and low complexity. Moreover, we develop a successive convex approximation-based algorithm (SCAA) to settle a nonlinear nonconvex difference of convex functions programming in the PARA. Simulation results demonstrate the advantages of the proposed algorithms.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1530-437X
1558-1748
DOI:10.1109/JSEN.2016.2597439