By Topic

REACA: An Efficient Protocol Architecture for Large Scale Sensor Networks (Corrected)*

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

3 Author(s)
Zhi Quan ; Univ. of California, Los Angeles ; Subramanian, A. ; Sayed, A.H.

The emergence of wireless sensor networks has imposed many challenges on network design such as severe energy constraints, limited bandwidth and computing capabilities. This kind of networks necessitates network protocol architectures that are robust, energy-efficient, scalable, and easy for deployment. This paper proposes a robust energy-aware clustering architecture (REACA) for large-scale wireless sensor networks. We analyze the performance of the REACA network in terms of quality-of-service, asymptotic throughput capacity, and power consumption. In particular, we study how the throughput capacity scales with the number of nodes and the number of clusters. We show that by exploiting traffic locality, clustering can achieve performance improvement both in capacity and in power consumption over general-purpose ad hoc networks. We also explore the fundamental trade-off between throughput capacity and power consumption for single-hop and multi-hop routing schemes in cluster-based networks. The protocol architecture and performance analysis developed in this paper provide useful insights for practical design and deployment of large-scale wireless sensor network.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:6 ,  Issue: 10 )