By Topic

Throughput Analysis of Randomized Sleep Scheduling with Constrained Connectivity in 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

3 Author(s)
Youngsang Kim ; Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX ; Changwoo Yang ; Chun-Hung Liu

In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity constraint. The unique optimal sleep probability maximizing the per-node throughput in the network is found. A sleep probability range in which the throughput monotonically increases along the sleep probability does exist, and it becomes a large portion of the total range when a network is heavy-traffic. This finding contradicts the common belief that throughput decreases along with the frequency of sleep of nodes. In addition, the connectivity confidence level for the optimal sleep probability is derived and proved to be bounded, and a distributed algorithm that makes each node achieve the maximum throughput is provided. Simulation results verify the aforementioned findings as well. For sensors allowed to choose their own sleep probability, an advisable policy is to choose as high probability as the connectivity constraint allows.

Published in:

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

Date of Conference:

Nov. 30 2008-Dec. 4 2008