Spatio-temporal sampling rates and energy efficiency in wireless sensor networks

A multi-hop network of wireless sensors can be used to gather spatio-temporal samples of a physical phenomenon and transmit these samples to a processing center. This paper addresses an important issue in the design of such networks: determining the spatio-temporal sampling rate of the network under conditions of minimum energy usage. A new collision-free protocol for gathering sensor data is used to obtain analytical results that characterize the tradeoffs among sensor density, energy usage, throughput, delay, temporal sampling rates and spatial sampling rates in wireless sensor networks. We also show that the lower bound on the delay incurred in gathering data is O(k/sup 2/n) in a clustered network of n sensors with at most k hops between any sensor and its clusterhead (CH). Simulation results on the tradeoff between the achievable spatial sampling rates and the achievable temporal sampling rates when IEEE 802.11 distributed coordination function (DCF) is used as the media access scheme are provided and compared with the analytical results obtained in this paper.

[1]  Deborah Estrin,et al.  Center for Embedded Networked Sensing , 2006 .

[2]  Imrich Chlamtac,et al.  Energy Efficient Design of Wireless Ad Hoc Networks , 2002, NETWORKING.

[3]  BandyopadhyaySeema,et al.  Spatio-temporal sampling rates and energy efficiency in wireless sensor networks , 2005 .

[4]  Deborah Estrin,et al.  Adaptive beacon placement , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[5]  Massimo Franceschetti,et al.  Lower bounds on data collection time in sensory networks , 2004, IEEE Journal on Selected Areas in Communications.

[6]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[7]  Kannan Ramchandran,et al.  Distributed Sampling for Dense Sensor Networks: A "Bit-Conservation Principle" , 2003, IPSN.

[8]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[9]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.

[10]  Gabor Karsai,et al.  Smart Dust: communicating with a cubic-millimeter computer , 2001 .

[11]  Alfred O. Hero,et al.  Multi-target Sensor Management Using Alpha-Divergence Measures , 2003, IPSN.

[12]  Urbashi Mitra,et al.  Estimating inhomogeneous fields using wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Deborah Estrin,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Fine-grained Network Time Synchronization Using Reference Broadcasts , 2022 .

[14]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[17]  Peter Kruus,et al.  CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY , 2000 .

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

[19]  Joseph M. Kahn,et al.  Wireless Communications for Smart Dust , 1998 .

[20]  Frank Morgan,et al.  Hexagonal Economic Regions Solve the Location Problem , 2002, Am. Math. Mon..

[21]  Edward J. Coyle,et al.  Spatio-temporal sampling rates and energy efficiency in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[22]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[23]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .

[24]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

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

[26]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[27]  Deborah Estrin,et al.  Medium access control with coordinated adaptive sleeping for wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[28]  Mani B. Srivastava,et al.  Topology management for sensor networks: exploiting latency and density , 2002, MobiHoc '02.

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

[30]  Kristofer S. J. Pister,et al.  Smart Dust: Communicating with a Cubic-Millimeter Computer , 2001, Computer.

[31]  Rick S. Blum,et al.  Delay limited capacity of ad hoc networks: asymptotically optimal transmission and relaying strategy , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[32]  Di Yuan,et al.  Resource optimization of spatial TDMA in ad hoc radio networks: a column generation approach , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[33]  Z. Ignjatovic,et al.  An energy conservation method for wireless sensor networks employing a blue noise spatial sampling technique , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[34]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[35]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[36]  Deborah Estrin,et al.  Scalable Coordination for Wireless Sensor Networks: Self-Configuring Localization Systems , 2001 .

[37]  Edward J. Coyle,et al.  Minimizing communication costs in hierarchically-clustered networks of wireless sensors , 2004, Comput. Networks.

[38]  G. Sharma,et al.  On Achievable Delay / Capacity Trade-offs in Mobile Ad Hoc Networks , 2004 .

[39]  Mani B. Srivastava,et al.  Optimizing Sensor Networks in the Energy-Latency-Density Design Space , 2002, IEEE Trans. Mob. Comput..

[40]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[41]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[42]  Robert J. McEliece,et al.  Packets distribution algorithms for sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[44]  Nael B. Abu-Ghazaleh,et al.  Infrastructure tradeoffs for sensor networks , 2002, WSNA '02.