Title: Anycasting with Guaranteed Delivery in Wireless Sensor and Actor Networks

Abstract: The problem of delivering packet from sensor
to any actor in the Wireless Sensor and Actor Networks, also known as
anycasting problem, and a solution are presented. The objective is to
develop the anycasting algorithm with guaranteed delivery. The
anycasting algorithm presented is a generalization of a well-known
greedy-face-greedy (GFG) routing. It is applied to unit disk graphs,
and face recovery runs on Gabriel planar sub-graphs. Within these
assumptions the algorithm guarantees delivery of messages from a sensor
to any actor. A program was developed to simulate the application of
the anycasting algorithm on random unit disk graphs. Simulation
results are presented.