By Topic

Minimizing communication costs in hierarchically clustered networks of wireless sensors

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

2 Author(s)
Bandyopadhyay, S. ; Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA ; Coyle, E.J.

This paper develops a technique for quantifying and minimizing the energy required to gather data from all sensors in a multi-hop wireless sensor network The technique combines analytical results from stochastic geometry with a distributed, randomized algorithm for generating clusters. The minimum communication energy achieved by this approach is significantly lower than the energy costs incurred in non-clustered networks and in clustered networks produced by such algorithms as the max-min d-cluster algorithm.

Published in:

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE  (Volume:2 )

Date of Conference:

20-20 March 2003