Order-optimal data collection in wireless sensor networks: delay and capacity

  • Authors:
  • Siyuan Chen;Yu Wang;Xiang-Yang Li;Xinghua Shi

  • Affiliations:
  • Department of Computer Science, University of North Carolina at Charlotte, Charlotte, North Carolina;Department of Computer Science, University of North Carolina at Charlotte, Charlotte, North Carolina;Department of Computer Science, Illinois Institute of Technology, Chicago, Illinois;Department of Computer Science, University of Chicago, Chicago, Illinois

  • Venue:
  • SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data collection is one of the most important functions provided by wireless sensor networks. In this paper, we study theoretical limitations of data collection and data aggregation in terms of delay and capacity for a wireless sensor network where n sensors are randomly deployed. We consider different communication scenarios (single sink or multiple sinks, regularly-deployed or randomly-deployed sinks, with or without aggregation) under protocol interference model. For each scenario, we first propose a new collection/aggregation method and analyze its performance in terms of delay and capacity, then theoretically prove that our method can achieve the optimal order (i.e., its performance is within a constant factor of the optimal). Particularly, with a single sink, the capacity of data collection is in order of Θ(W) where W is the fixed data-rate on individual links. With k sinks, the capacity of data collection is increased to Θ(kW) when k = O(n/log n) or Θ(n/log n W) when k = Ω(n/log n). If each sensor can aggregate its receiving packets into a single packet to send, the capacity of data collection with a single sink is also increased to Θ(n/log n W).