Almost Delaunay triangulation routing in wireless sensor networks

Abstract

To obtain a satisfactory performance in the wireless sensor network, optimal routing is the most important aspect. The lifetime of the sensor network depends mostly on the routing topology. In order to route the data in an efficient way, we propose an almost Delaunay triangulation routing approach, which could be generated locally. This routing graph is generated only once and can be used during the whole lifetime of the wireless sensor network.