A Distributed Voronoi Polygon Construction Strategy for Wireless Sensor Networks

• Main Authors: Chien-Pang Chen, 陳建邦
• Other Authors: Rei-Heng Cheng
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/50809504553336595865

碩士 === 玄奘大學 === 資訊管理學系碩士班 === 98 === Voronoi polygon (Vp) is the area closer to a sensor than to any other sensors in wireless sensor network (WSN). This area has many natural interpretations in sensor networks such as to determine the detection range of responsibility of each sensor. The computation of Vp is a standard problem in computational geometry. However, it is much less understood in the distributed setting of sensor networks. The methods currently advocated for distributed Vp computation in sensor networks are heuristic approximations that can introduce significant inaccuracies that are difficult to rigorously quantify or need more messaging overhead to guarantee the correctness. In this paper, we refer to a decision process at each sensor by building its corresponding Vp that makes use of only information for a neighborhood within its acceptable detection range. Our approach focuses on adjusting the detection range of each sensor in order to reduce the overlaps among detection ranges while keeping the detection ability above a predefined threshold. Simulation and testing results show the viability and effectiveness of the methods.