Ganesan2001a

Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks

Deepak Ganesan
Computer Science Department, UCLA
deepak@cs.ucla.edu

Ramesh Govindan
International Computer Science Institute, Berkeley
govindan@isi.edu

Scott Shenker
ACIRI, Berkeley
shenker@aciri.org

Deborah Estrin
Computer Science Department, UCLA
destrin@cs.ucla.edu

ACM SIGMOBILE
Mobile Computing and Communications Review
Volume 5, Issue 4
Best Poster Paper from MOBIHOC2001
pp. 11-25
ACM, October 2001

Paper:
see [Ganesan2001] for original poster and [Ganesan2002] for updated version

Abstract

Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kinds of multipaths to enable energy efficient recovery from failure of the shortest path between source and sink. Disjoint multipath has been studied in the literature. We propose a novel braided multipath scheme, which results in several partially disjoint multipath schemes. We find that braided multipaths are a viable alternative for energy-efficient recovery from isolated and patterned failures.

BibTex

@ARTICLE(Gansean2001a,
   TITLE = {Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks},
   AUTHOR = {Deepak Ganesan and Ramesh Govidan and Scott Skenker and Deborah Estrin},
   JOURNAL = {ACM SIGMOBILE Mobile Computing and Communications Review},
   VOLUME = {5},
   NUMBER = {4},
   PAGES = {11-15},
   YEAR = {2001},
   MONTH = {October},
   NOTE = {Best poster paper from MOBILHOC2001})

"Ganesan2001a" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc-Papers | Ganesan2001 | Ganesan2002