Abstract
One of the major applications of sensor networks is guiding navigation whose goal is to find a way to guide moving objects across a region covered by sensors. Sensor networks maintain safe paths by which the moving objects can be guided safely to exits. In this thesis, we propose a distributed protocol for constructing area-to-area optimal guiding paths that do not traverse through the dangerous areas and use the localized Delaunay triangulation method [2, 3] to divide the region covered by a sensor network into many small triangular areas. Moreover, we propose a load-balance algorithm including an additional AP layer for moving objects registration and path assignment in multi-exits scenario. Hence, the moving objects can be properly dispersed to multiple paths leading to exits to avoid congestion.