文献详情
Maximizing network lifetime using coverage sets scheduling in wireless sensor networks
文献类型：期刊
通讯作者：Li, DY (reprint author), Renmin Univ China, Sch Informat, Beijing 100872, Peoples R China.
期刊名称：AD HOC NETWORKS影响因子和分区
年：2020
卷：98
ISSN：1570-8705
关键词：Network lifetime; Wireless sensor network; Coverage sets scheduling; Approximation algorithm
所属部门：信息学院
摘要：In a Wireless Sensor Network (WSN), when a large amount of sensors are randomly deployed into a detection area, an efficient sleep/active scheduling for sensors to maximize the network lifetime of target (or detection area) coverage, which is called the coverage problem, is an important issue. The problem was proved NP-complete. Recently, many methods were proposed for solving the coverage problem, each of which can be divided into two phases: the first is to find as many as possible coverage se ...More
In a Wireless Sensor Network (WSN), when a large amount of sensors are randomly deployed into a detection area, an efficient sleep/active scheduling for sensors to maximize the network lifetime of target (or detection area) coverage, which is called the coverage problem, is an important issue. The problem was proved NP-complete. Recently, many methods were proposed for solving the coverage problem, each of which can be divided into two phases: the first is to find as many as possible coverage sets from the sensors and the other is to schedule the coverage sets got from the first phase. Therefore, all coverage problems involve the scheduling process of the coverage sets to maximize the network lifetime. In this paper, we investigate the Maximum Coverage Sets Scheduling (MCSS) problem: given a coverage set collection in which each coverage set covers all targets (or the whole detection area) in WSN, the problem is to find a feasible scheduling for the coverage set collection to maximize the network lifetime. Firstly, we prove the MCSS problem is NP-hard. Secondly, we formulate the problem as an integer linear programming problem. Thirdly, we first propose a greedy algorithm, called Greedy-MCSS, to solve the MCSS problem. Then based on the Greedy-MCSS algorithm, we propose an approximation algorithm, MCSS Algorithm (MCSSA) for solving the MCSS problem, which gives the theoretical performance guarantee. Finally, extensive simulation results are shown to further verify the performance of our algorithms. (C) 2019 Elsevier B.V. All rights reserved. ...Hide

DOI：10.1016/j.adhoc.2019.102037
百度学术：Maximizing network lifetime using coverage sets scheduling in wireless sensor networks
语言：外文
基金：National Natural Science Foundation of ChinaNational Natural Science Foundation of China [11671400, 61672524]; General Project of Science and Technology Plan of Beijing Municipal Education Commission [KM201910017006]
作者其他论文



A New Greedy Algorithm for Constructing the Minimum Size Connected Dominating Sets in Wireless Networks.Luo, Chuanwen, Wang, Yongcai, Yu, Jiguo, et al. .WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2017. 2017, 10251, 109-114.
Fair Multi-influence Maximization in Competitive Social Networks.Yu, Ying, Jia, Jinglan, Li, Deying, et al. .WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2017. 2017, 10251, 253-265.
WCS: Weighted Component Stitching for Sparse Network Localization.Sun, Tianyuan, Wang, Yongcai, Li, Deying, et al. .IEEE-ACM TRANSACTIONS ON NETWORKING. 2018, 26(5), 2242-2253.
Robust Component-based Network Localization with Noisy Range Measurements.Sun, Tianyuan, Wang, Yongcai, Li, Deying, et al. .2018 27TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN). 2018.
Robust Passive Location in Zero-Calibrated Environment Using Smoothed Ordinal Constraints.Ye, Xuehan, Lei, Zhixian, Wang, Yongcai, et al. .2017 14TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS AND NETWORKS & 2017 11TH INTERNATIONAL CONFERENCE ON FRONTIER OF COMPUTER SCIENCE AND TECHNOLOGY & 2017 THIRD INTERNATIONAL SYMPOSIUM OF CREATIVE COMPUTING (ISPAN-FCST-ISCC). 2017