Connected P-Percent Coverage in Wireless Sensor Networks based on Degree Constraint Dominating Set Approach

被引：7

作者：

Mostafaei, Habib ^{[1
]}

Chowdhury, Morshed U. ^{[2
]}

Islam, Rafiqul ^{[3
]}

Gholizadeh, Hojjat ^{[4
]}

机构：

[1] Islamic Azad Univ, Dept Comp Engn, Orumiyeh, Iran

[2] Deakin Univ, Sch Informat Technol, Melbourne, Vic, Australia

[3] Charles Sturt Univ, Sch Comp & Math, Bathurst, NSW 2795, Australia

[4] Amirkabir Univ Technol, Dept Comp Engn & IT, Tehran, Iran

来源：

MSWIM'15: PROCEEDINGS OF THE 18TH ACM INTERNATIONAL CONFERENCE ON MODELING, ANALYSIS AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS | 2015年

关键词：

Connected P-percent Coverage; Degree-constrained Connected Dominating Set; Learning Automata(LA); Wireless Sensor Networks(WSNs); ALGORITHM;

D O I：

10.1145/2811587.2811625

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we propose an algorithm for connected p-percent coverage problem in Wireless Sensor Networks(WSNs) to improve the overall network life time. In this work, we investigate the p-percent coverage problem(PCP) in WSNs which requires p% of an area should be monitored correctly and to find out any additional requirements of the connected p-percent coverage problem. We propose pDCDS algorithm which is a learning automaton based algorithm for PCP. pDCDS is a Degree-constrained Connected Dominating Set based algorithm which detect the minimum number of nodes to monitor an area. The simulation results demonstrate that pDCDS can remarkably improve the network lifetime.

引用

页码：156 / 159

页数：4

共 50 条

[1] p-Percent Coverage in Wireless Sensor Networks
Wu, Yiwei
Ai, Chunyu
Gao, Shan
Li, Yingshu
[J]. WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, PROCEEDINGS, 2008, 5258 : 200 - 211
[2] Sensor scheduling for p-percent coverage in wireless sensor networks
Yingshu Li
Chunyu Ai
Zhipeng Cai
Raheem Beyah
[J]. Cluster Computing, 2011, 14 : 27 - 40
[3] p-Percent Coverage Schedule in Wireless Sensor Networks
Gao, Shan
Wang, Xiaoming
Li, Yingshu
[J]. 2008 PROCEEDINGS OF 17TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, VOLS 1 AND 2, 2008, : 548 - +
[4] Sensor scheduling for p-percent coverage in wireless sensor networks
Li, Yingshu
Ai, Chunyu
Cai, Zhipeng
Beyah, Raheem
[J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2011, 14 (01): : 27 - 40
[5] PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks
Du, Hongwei
Ye, Qiang
Zhong, Jioafei
Wang, Yuexuan
Lee, Wonjun
Park, Haesun
[J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT 1, 2010, 6508 : 252 - +
[6] Connected dominating set algorithms for wireless sensor networks
Al-Nabhan, Najla
Al-Rodhaan, Mznah
Al-Dhelaan, Abdullah
Cheng, Xiuzhen
[J]. INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2013, 13 (02) : 121 - 134
[7] Two Connected Dominating Set Algorithms for Wireless Sensor Networks
Al-Nabhan, Najla
Zhang, Bowu
Al-Rodhaan, Mznah
Al-Dhelaan, Abdullah
[J]. WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2012, 2012, 7405 : 705 - 713
[8] Three connected dominating set algorithms for wireless sensor networks
Al-Nabhan, Najla
Zhang, Bowu
Cheng, Xiuzhen
Al-Rodhaan, Mznah
Al-Dhelaan, Abdullah
[J]. INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2016, 21 (01) : 53 - 66
[9] Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set
Mohanty, Jasaswi Prasad
Mandal, Chittaranjan
Reade, Chris
Das, Ariyam
[J]. AD HOC NETWORKS, 2016, 42 : 61 - 73
[10] A novel approach to partial coverage in wireless sensor networks via the roman dominating set
Ghaffari, Fatemeh
Bahrak, Behnam
Shariatpanahi, Seyed P.
[J]. IET NETWORKS, 2022, 11 (02) : 58 - 69

← 1 2 3 4 5 →