By Topic

Distributed data collection and its capacity in asynchronous 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
$33 $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

2 Author(s)
Shouling Ji ; Department of Computer Science, Georgia State University, Atlanta, 30303, USA ; Zhipeng Cai

Most of the existing works studying the data collection capacity issue have an ideal assumption that the network time is slotted and the entire network is strictly synchronized explicitly or implicitly. Such an assumption is mainly for centralized synchronous WSNs. However, WSNs are more likely to be distributed asynchronous systems. Thus, in this paper, we investigate the achievable data collection capacity of realistic distributed asynchronous WSNs. To the best of our knowledge, this is the first work to study the data collection capacity issue for distributed asynchronous WSNs. Our main contributions are threefold. First, to avoid data transmission collisions/interference, we derive an R0-Proper Carrier-sensing Range (R0-PCR) under the generalized physical interference model for the nodes in a data collection WSN, where R0 is the satisfied threshold data receiving rate. Taking R0-PCR as its carrier-sensing range, any node can initiate a data transmission with a guaranteed data receiving rate. Second, based on the obtained R0-PCR, we propose a Distributed Data Collection (DDC) algorithm with fairness consideration for asynchronous WSNs. Theoretical analysis of DDC surprisingly shows that its asymptotic achievable network capacity is ℂ = Ω(1/(26βκ+1)·W), where βκ+1 is a constant value depends on R0 and W is the bandwidth of a wireless communication channel, which is order optimal and independent of network size. Thus, DDC is scalable. Finally, we conduct extensive simulations to validate the performance of DDC. Simulation results demonstrate that DDC can achieve comparable data collection capacity as that of the most recently published centralized and synchronized data collection algorithm.

Published in:

INFOCOM, 2012 Proceedings IEEE

Date of Conference:

25-30 March 2012