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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00384046
Contributor : Nathalie Mitton <>
Submitted on : Thursday, May 14, 2009 - 10:58:45 AM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Thursday, June 10, 2010 - 8:25:17 PM

File

final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00384046, version 1

Collections

Citation

Nathalie Mitton, David Simplot-Ryl, Ivan Stojmenovic. Guaranteed delivery for geographical anycasting in wireless multi-sink sensor and sensor-actor networks.. In Proc. 28th Annual IEEE Conf. on Computer Communications (INFOCOM 2009), Apr 2009, Rio de Janeiro, Brazil. pp.000. ⟨hal-00384046⟩

Share

Metrics

Record views

298

Files downloads

217