On The Scalability of Sensor Network Routing and Compression Algorithms

John D. Owens
University of California, Davis
Computer Engineering Research Laboratory
Technical Report ECE-CE-2004-1, Computer Engineering Research Laboratory, University of California, Davis, 2004.

Abstract:

Recent advances in sensor networks have developed routing algorithms and compression and aggregation schemes that allow these networks to use their limited resources, particularly power, most efficiently. As sensor networks mature and sensor nodes become cheaper, deployed sensor networks will feature more nodes. This work examines the scalability behavior of routing and compression algorithms as the number of nodes in a sensor network increases. We demonstrate the longer lifetimes of clustered routing algorithms as they increase in size, the superior spatial distribution of node deaths in hierarchical clustered and high-compression multihop routing algorithms, and the characteristics of optimal cluster head distribution in clustered routing algorithms.

Reference

John D. Owens. "On The Scalability of Sensor Network Routing and Compression Algorithms". Technical Report ECE-CE-2004-1, Computer Engineering Research Laboratory, University of California, Davis, 2004.

BibTeX entry

@TechReport{Owens:2004:OTS,
  author =	 {John D. Owens},
  title =	 {On The Scalability of Sensor Network Routing and
                  Compression Algorithms},
  institution =	 {Computer Engineering Research Laboratory, University
                  of California, Davis},
  year =	 2004,
  number =	 {ECE-CE-2004-1},
  note =
                  {\url{http://www.ece.ucdavis.edu/cerl/techreports/2004-1/}},
}

John Owens