Guaranteed Delivery for Geographical Anycasting in Wireless Multi-Sink Sensor and Sensor-Actor Networks

Abstract

In the anycasting problem, a sensor wants to report event information to one of sinks or actors. We describe the first localized anycasting algorithms that guarantee delivery for connected multi-sink sensor-actor networks. Let S(x) be the closest actor/sink to sensor x, and |xS(x)| be distance between them. In greedy phase, a node s forwards the packet to its neighbor v that minimizes the ratio of cost cost(|sv|) of sending packet to v (here we specifically apply hop-count and power consumption metrics) over the reduction in distance (|sS(s)|−|vS(v)|) to the closest actor/sink. A variant is to forward to the first neighbor on the shortest weighted path toward v. If none of neighbors reduces that distance then recovery mode is invoked. It is done by face traversal toward the nearest connected actor/sink, where edges are replaced by paths optimizing given cost. A hop count based and two variants of localized power aware anycasting algorithms are described. We prove guaranteed delivery property analytically and experimentally.

Energy Efficient k-Anycast Routing in Multi-sink Wireless Networks with Guaranteed Delivery

“…Message is sent to node v with parameters k a and S a which will run KanGuRou again (Line 19) and so on till k a sinks have been reached in this branch. As shown in [5], this ensures the packet delivery as soon as the network is connected.…”

“…KanGuRou is an extension of the anycasting protocol proposed in [5] to the k anycasting. In [5], authors describe EEGPA the first localized anycasting algorithms that guarantee delivery for connected multi-sink sensor networks based on a GFG approach. Let S(x) be the closest actor/sink to sensor x, and |xS(x)| be distance between them.…”

“…Greedy mode is similar to the one used in [5]. When node s runs greedy algorithm toward Sink a, it computes the subtree sT (T (s), a) of T (s) rooted in a.…”

“…When k = 1, the 1-MST computed by s running KanGuRou comes to finding CT S (s), i.e. the closest sink to s. KanGuRou comes to EEGDA [5], been proven to guarantee packet delivery as long as the underlying network is connected. Induction step.…”

“…Unlike [11], it does not maintain any routing table and does not need to add any information neither on nodes nor in the message, which makes it scalable regardless of the number of sinks/nodes. It inspires from energy-efficient anycast EEGDA algorithm [5] and the splitting techniques of MSTEAM [4], proposing a new tree construction to ensure reaching k sinks. At each step, the current node s computes a spanning tree over k sinks with minimal cost.…”