Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication. (2nd March 2011)

• Record Type: Journal Article
• Authors: Haider, Md. Bahlul; Imahori, Shinji; Sugihara, Kokichi
• Is Part Of: International journal of sensor networks. Volume 9:Number 2(2011)
• Page Start: 69
• Page End: 75
• Publication Date: 2011-03-02
• Subjects: wireless sensor networks -- WSNs -- routing strategy -- Delaunay triangulation -- Voronoi polygon -- cluster head -- wireless networks -- non-uniform distribution -- sensor nodes -- energy efficiency -- planar graphs; Sensor networks -- Periodicals; 681.2
• Languages: English
• ISSNs: 1748-1279

Abstract

This paper proposes a routing strategy for wireless sensor networks that is valid even when the sensor nodes are distributed non-uniformly. Energy efficiency is the most important consideration in wireless sensor networks; hence, global communication should be achieved by combinations of local messages. We first propose a new underlying graph called the almost Delaunay planar net, which can be calculated from information local to the sensor nodes. We statistically analyse the efficiency of existing routing strategies in the almost Delaunay planar net. We also propose a new routing strategy that always guarantees the reachability on planar graphs, including the almost Delaunay planar net. We show that the proposed routing strategy exhibits good performance if the underlying graph in the sensor network is the almost Delaunay planar net.