TY - JOUR
T1 - Continuous data collection capacity of dual-radio multichannel wireless sensor networks
AU - Ji, Shouling
AU - Cai, Zhipeng
AU - Li, Yingshu
AU - Jia, Xiaohua
PY - 2012
Y1 - 2012
N2 - The performance of data collection in Wireless Sensor Networks (WSNs) can be measured by network capacity. However, few existing works dedicatedly consider the Continuous Data Collection (CDC) capacity for WSNs under the protocol interference model. In this paper, we propose a multipath scheduling algorithm for SDC in single-radio multichannel WSNs and derive its network capacity which is a tighter lower bound compared with the previously best result [CHECK END OF SENTENCE]. We also propose a novel CDC method for dual-radio multichannel WSNs. It significantly speeds up the data collection process, and achieves a capacity of nW/12M⌈3.63ρ 2+c 3ρ +c 4/H⌉ when Δ≤ 12 or nW/MΔ e⌈(3. 63ρ 2+c 3ρ +c4)-H⌉ when Δ e >12, where n is the number of the sensors, M is a constant value and usually M \ll n, \Delta-e is the maximum number of the leaf nodes having a same parent in the data collection tree, W is the channel bandwidth, H is the number of available orthogonal channels, ρ is the ratio of the interference radius over the transmission radius, c 3 = 8π\√3 + π+ 2, and c 4 = 8π√3 + 2π + 6. Extensive simulation results indicate that the proposed algorithms improve network capacity significantly compared with existing works. © 2012 IEEE.
AB - The performance of data collection in Wireless Sensor Networks (WSNs) can be measured by network capacity. However, few existing works dedicatedly consider the Continuous Data Collection (CDC) capacity for WSNs under the protocol interference model. In this paper, we propose a multipath scheduling algorithm for SDC in single-radio multichannel WSNs and derive its network capacity which is a tighter lower bound compared with the previously best result [CHECK END OF SENTENCE]. We also propose a novel CDC method for dual-radio multichannel WSNs. It significantly speeds up the data collection process, and achieves a capacity of nW/12M⌈3.63ρ 2+c 3ρ +c 4/H⌉ when Δ≤ 12 or nW/MΔ e⌈(3. 63ρ 2+c 3ρ +c4)-H⌉ when Δ e >12, where n is the number of the sensors, M is a constant value and usually M \ll n, \Delta-e is the maximum number of the leaf nodes having a same parent in the data collection tree, W is the channel bandwidth, H is the number of available orthogonal channels, ρ is the ratio of the interference radius over the transmission radius, c 3 = 8π\√3 + π+ 2, and c 4 = 8π√3 + 2π + 6. Extensive simulation results indicate that the proposed algorithms improve network capacity significantly compared with existing works. © 2012 IEEE.
KW - capacity analysis
KW - continuous data collection
KW - snapshot data collection
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=84865680178&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84865680178&origin=recordpage
U2 - 10.1109/TPDS.2011.286
DO - 10.1109/TPDS.2011.286
M3 - RGC 21 - Publication in refereed journal
SN - 1045-9219
VL - 23
SP - 1844
EP - 1855
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
IS - 10
M1 - 6095527
ER -