REACA: An Efficient Protocol Architecture for Large Scale Sensor Networks

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.

[1]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[2]  J. Seaman Introduction to the theory of coverage processes , 1990 .

[3]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..

[4]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[5]  Ali H. Sayed,et al.  Fundamentals Of Adaptive Filtering , 2003 .

[6]  Sartaj Sahni,et al.  Power-aware routing in sensor networks , 2005 .

[7]  Jan M. Rabaey,et al.  Energy aware routing for low energy ad hoc sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[8]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[9]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[10]  A. Subramanian,et al.  Joint rate and power control algorithms for wireless networks , 2005, IEEE Transactions on Signal Processing.

[11]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[12]  A. Subramanian,et al.  Performance analysis of a class of clustered wireless networks , 2004, IEEE 5th Workshop on Signal Processing Advances in Wireless Communications, 2004..

[13]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[14]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[15]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[16]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[17]  Michel Loève,et al.  Probability Theory I , 1977 .

[18]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[19]  A. Subramanian,et al.  A probabilistic power-aware routing algorithm for wireless ad-hoc networks , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[20]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[21]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[22]  Gregory J. Pottie,et al.  Channel access algorithms with active link protection for wireless communication networks with power control , 2000, TNET.

[23]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).