Ganesan2002

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

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

Ramesh Govindan
ramesh@icsi.berkley.edu
International Computer Science Institute, Berkeley

Scott Shenker
deepak@cs.ucla.edu
ACIRI, Berkley

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

ACM Mobile Computing and Communcations Review (MC2R) Vol. 1, No. 2
ACM, 2002

Citeseer:


Paper:


See [Ganesan2001] for initial paper and [Ganesan2001a] as Best Poster Paper

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(Ganesan2002,
   AUTHOR = {Deepak Ganesan and Ramesh Govidan and Scott Skenker and Deborah Estrin},
   TITLE = {Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks},
   JOURNAL = {ACM Mobile Computing and Communcations Review (MC2R)},
   VOLUME = {1},
   NUMBER = {2},
   YEAR = {2002},
   URL = {http://lecs.cs.ucla.edu/Publications/papers/Deepak-Multipath-MC2R.pdf},
   FILE = {Estrin-MC2R.pdf}
)

"Ganesan2002" is mentioned on: Ad-Hoc-Papers | Ganesan2001 | Ganesan2001a