Dispatching design for storage-centric wireless sensor networks

  • Authors:
  • Minming Li;Qin Liu;Jianping Wang;Yingchao Zhao

  • Affiliations:
  • Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong;School of Computing, Wuhuan University, Wuhan, P.R. China;Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong;Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong

  • Venue:
  • Journal of Combinatorial Optimization
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a large-scale storage-centric wireless sensor network (SWSN) where data from different clusters are archived at distributed storage nodes, the dispatching design problem is to determine one or multiple storage nodes for each cluster. To achieve high data fidelity in SWSNs, the dispatching design should aim to reduce the data loss due to the network congestion and, at the same time, to prolong the network lifetime by avoiding sending excessive traffic to some particular storage nodes in order to achieve energy consumption balance among the relaying sensors around the storage node. In this paper, we propose an h-peak dispatching design for SWSN. Under such a design, regular traffic volume from each cluster will receive guaranteed data fidelity, and over-expectation traffic will receive best-effort data fidelity. We use an h-peak model to characterize the traffic deviation which assumes that at most h clusters may have over-expectation traffic simultaneously at a storage node. By incorporating h into the dispatching decision rather than assuming that all clusters may reach their traffic spikes simultaneously, the proposed h-peak dispatching design can achieve high data fidelity in SWSNs.