An efficient scheme for reducing overhead in data-centric storage sensor networks

In Data-Centric Storage sensor networks where numerous sensors collaborate to monitor and report occurrences of environmental events, GPSR routing algorithm can be used to route event and query packets efficiently. However, the routing algorithm usually routes packets completely around perimeters enclosing destination locations. In this paper, we show that such perimeter walks cause significant overhead in many practical settings of sensor networks. We then propose an efficient pruning scheme to reduce overhead of perimeter walks. Our algorithm incurs no additional communications overhead; only requires the knowledge of node transmission range; but can significantly reduce overhead of insertions and queries.