Approximation algorithm for avoiding hotspot formation of sensor networks for temperature sensitive environments

  • Authors:

  • Nibedita Das;Pavel Ghosh;Arunabha Sen

  • Affiliations:

  • Computer Science and Engineering Department, Arizona State University, Tempe, AZ;Computer Science and Engineering Department, Arizona State University, Tempe, AZ;Computer Science and Engineering Department, Arizona State University, Tempe, AZ

  • Venue:
  • GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Sensing and transmission phenomena of an implanted sensor dissipates energy which results in rise in temperature of its surroundings. Simultaneous operation of such multiple active sensors increases the temperature of the surrounding environment causing hotspots. Such hotspots are highly undesirable as they may cause damage to the environment as well as to the sensor network, posing a challenge for deployment of sensors. The problem is further enhanced for a temperature sensitive environment, as the allowable threshold temperature for such environments is less. Here we investigate the formation of hotspots in such temperature sensitive environments due to the heat dissipation of multiple active sensors and try to achieve a maximum coverage of such networks avoiding hotspots. We formulate this as a variation of the maximum independent set problem for hypergraphs. We devise an Integer Linear Program to achieve the optimal solution for the problem. We also provide a greedy heuristic solution for the problem. For a special case of this problem, where the hotspots are formed due to pairs of sensors only, we prove a 5-approximation bound for the greedy solution. Experimental results show that our algorithm achieves near-optimal solutions in almost all the test cases.