Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network

  • Authors:
  • Mitali Singh;Viktor K. Prasanna

  • Affiliations:
  • -;-

  • Venue:
  • PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

A large number of sensor networked together form self-organizing pervasive systems that provide the basis for implementation of several applications involving distributed, collaborative computations. Energy dissipation is a critical issue for these networks, as their life-time is limited by the battery power of the sensors. In this paper, we focus on design of an energy-balanced, energy-optimal algorithm for sorting in a single-hop sensor network. Energy optimality implies that the overall energy dissipation in the system is minimized. Energy-balancedness ensures that all the sensor spend asymptotically equivalent amount of energy in the system. Uniform energy dissipation is desirable as it enables the network to remain fully functional for the maximum time. We demonstrate that given a single-hop, single-channel network of n randomly distributed sensors, sorting can be performed in O(n log n) time and energy, with no sensor being awake for more than O(log n) time steps. In a p channel network, where p \leqslant n^{1 - \varepsilon} for 0