METHOD FOR PRUNING PERIMETER WALKS IN DATA-CENTRIC STORAGE SENSOR NETWORKS

Abstract

A method for pruning perimeter walks includes: hashing a name or attributes of an event, when the event occurs, to figure out a destination location of the event; performing greedy forwarding of geographic routing so as to send a packet of the event towards the destination location; checking a distance D between the destination location and a current node where a packet transmission using greedy forwarding mode is impossible, when the packet reaches the current node; checking distances between the destination location and respective neighboring nodes of the current node to obtain a neighboring node having a minimum distance M, when the distance D between the current node and the destination location is same or less than half of radio transmission range; comparing the minimum distance M to the distance D; and determining which node is a rendezvous node, according to the comparison result.