Quality of Information Maximization in Lifetime-Constrained Wireless Sensor Networks

被引:8
|
作者
Du, Pengfei [1 ,2 ]
Yang, Qinghai [1 ,2 ]
Shen, Zhong [1 ,2 ]
Kwak, Kyung Sup [3 ]
机构
[1] Xidian Univ, Sch Telecommun, Engn, State Key Lab ISN, Xian 710071, Peoples R China
[2] Xidian Univ, Collaborat Innovat Ctr Informat Sensing & Underst, Xian 710071, Peoples R China
[3] Inha Univ, Dept Informat & Commun Engn, Inchon 22212, South Korea
关键词
Wireless sensor networks; quality of information; network lifetime; data rate; power control; ALLOCATION; TRADEOFF; POWER;
D O I
10.1109/JSEN.2016.2597439
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:7278 / 7286
页数:9
相关论文
共 50 条
  • [31] LSDC A Lossless approach to lifetime maximization in wireless sensor networks
    Roy, Arpan
    Mtra, Adway
    Khan, Arijit
    Nasipuri, Mita
    Saha, Debashis
    2008 IEEE SENSORS APPLICATIONS SYMPOSIUM, 2008, : 166 - 171
  • [32] Bounds for lifetime maximization with multiple sinks in wireless sensor networks
    Shah-Mansouri, Vahid
    Wong, Vincent W. S.
    2007 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS 1 AND 2, 2007, : 82 - 85
  • [33] Lifetime Maximization Based on Coverage and Connectivity in Wireless Sensor Networks
    Tong Zhao
    Qing Zhao
    Journal of Signal Processing Systems, 2009, 57 : 385 - 400
  • [34] A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks
    Yetgin, Halil
    Cheung, Kent Tsz Kan
    El-Hajjar, Mohammed
    Hanzo, Lajos
    IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (02): : 828 - 854
  • [35] Cross-Layer Aware Routing Approaches for Lifetime Maximization in Rate-Constrained Wireless Sensor Networks
    Ehsan, Samina
    Hamdaoui, Bechir
    Guizani, Mohsen
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [36] Lifetime maximization of wireless sensor networks while ensuring intruder detection
    Corapsiz, Muhammed Fatih
    SOFT COMPUTING, 2024, 28 (5) : 4197 - 4215
  • [37] An Energy Efficient Clustering Protocol for Lifetime Maximization in Wireless Sensor Networks
    Wang, Ning
    Zhou, Yuan
    Xiang, Wei
    2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
  • [38] A Decentralized Lifetime Maximization Algorithm for Distributed Applications in Wireless Sensor Networks
    Pilloni, Virginia
    Franceschelli, Mauro
    Atzori, Luigi
    Giua, Alessandro
    2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2012,
  • [39] Lifetime maximization by cross-layer interaction in wireless sensor networks
    Kong, IY
    Hwang, WJ
    8TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY, VOLS 1-3: TOWARD THE ERA OF UBIQUITOUS NETWORKS AND SOCIETIES, 2006, : U2055 - U2060
  • [40] Optimal energy allocation in heterogeneous wireless sensor networks for lifetime maximization
    Li, Keqin
    Li, Jie
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2012, 72 (07) : 902 - 916