关键词: 传感网 局部Delaunay三角剖分 几何路由协议

Abstract:

Geometric routing protocols benefit from localized Delaunay triangulation, which guarantees the delivery of packets and bounds the length of routes. I n this paper we propose a localized algorithm to build the Delaunay triangulation in wireless sensor networks. The algorithm considers not only stationary situation but also the dynamic situation in which nodes dynamically ioin and leave the network. In both situations, the communication cost of the alg orithm is O（nlogn） hits. Therefore our algorithm is applicable in wireless sensor networks, in which nodes dynamically join and leave the network. We   also prove the correctness of the algorithm

Key words: （wireless sensor network;localized Delaunay triangulation, geometric routing protocol）