Efficient approximation of routing holes in wireless sensor networks

  • Authors:

  • Nguyen Phi Le;Bui Tien Quan;Nguyen Trung Hieu;Nguyen Khanh Van

  • Affiliations:

  • Ha Noi University of Science and Technology, Ha Noi, Viet Nam;Ha Noi University of Science and Technology, Ha Noi, Viet Nam;Ha Noi University of Science and Technology, Ha Noi, Viet Nam;Ha Noi University of Science and Technology, Ha Noi, Viet Nam

  • Venue:
  • Proceedings of the Second Symposium on Information and Communication Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Routing holes in wireless sensor networks (WSN) do occur due to several reasons, including cases caused by natural obstacles or disaster suffered areas. Computing the exact boundary of a hole is possible [5], but can be impractical with large holes. In this paper, we consider the problem of how to approximate a hole by a simplistic shape, covering polygon such that if demanded either the approximation error or the memory space needed for reporting this polygon shape can be made as small as desired. We present an efficient algorithmic scheme that can produce cost-effective and flexible solutions that can be customized to fit to specific situations. Based on the basic BoundHole algorithm for computing the exact hole boundary [5], we propose a two-folded approximation technique: (1) covering the hole with a minimal polygon with edges aligned to a given square grid; (2) dynamically trimming-off this polygon edges while minimizing loss in approximation preciseness. Such carefully constructed polygon covers can be useful for applications in routing in WSN with holes where limitation of resource at sensors causes challenging complicated problems, and possibly in other practical situations where one need to approximately identify a boundary of say, a large disaster suffered area. We also provide experimental results which prove the efficiency of our algorithm.