Revisiting blacklisting and justifying the unit disk graph model for energy-efficient position-based routing in wireless sensor networks

The unit disk graph model is widely used in conjunction with position-based routing. Past research has suggested that this leads to inefficient routing strategies and improved metrics have been proposed that combine packet reception rate and progress. In this paper we revisit the earlier analysis and show that a blacklisting scheme based on packet reception rate is more energy efficient. We also show that the unit disk graph model is a close approximation to this energy efficient routing scheme.