Cart (Loading....) | Create Account
Close category search window
 

Continuous Data Collection Capacity of Dual-Radio Multichannel Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shouling Ji ; Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA, USA ; Zhipeng Cai ; Yingshu Li ; Xiaohua Jia

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+c3 ρ+c4)/H⌉) when Δe ≤ 12 or (nW/MΔe⌈(3.63ρ2+c3 ρ+c4)/H⌉) when Δe >;12, where n is the number of the sensors, M is a constant value and usually M ≪ n, Δ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, rho is the ratio of the interference radius over the transmission radius, c3 = (8π/√(3)) + π + 2, and c4 = (8π/√(3)) + 2π + 6. Extensive simulation results indicate that the proposed algorithms improve network capacity significantly compared with existing works.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:23 ,  Issue: 10 )

Date of Publication:

Oct. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.