@article{ wood2002,
  author = "Anthony D. Wood and John A. Stankovic",
  title = "Denial of Service in Sensor Networks",
  journal = "{IEEE} Computer",
  volume = 35,
  number = 10,
  month = oct,
  year = 2002,
  pages = "54--62",
  annote = {
    Gives a good overview of security issues in sensor networks.
    In particular, it gives various ways in which a malicious
    node can disrupt a sensor network.  Mostly concerned with
    routing issue; does not mention corrupting the sensor
    value themselves.},
  url = "citeseer.nj.nec.com/wood02denial.html"
}

@incollection{ johnson96dynamic,
  author = "David B Johnson and David A Maltz",
  title = "Dynamic Source Routing in Ad Hoc Wireless Networks",
  booktitle = "Mobile Computing",
  volume = "353",
  publisher = "Kluwer Academic Publishers",
  editor = "Imielinski and Korth",
  year = "1996",
  url = "citeseer.nj.nec.com/johnson96dynamic.html" 
}


@inproceedings{ ahnr02,
  author = {Baruch Awerbuch and David Holmer and Cristina Nita-Rotaru and 
    Herbert Rubens},
  title = {An On-Demand Secure Routing Protocol Resilient to Byzantine 
    Failures},
  booktitle = {ACM Workshop on Wireless Security (WiSe)},
  year = {2002},
  address = {Atlanta, Georgia},
  month = {September},
  annote = {Proposes a secure routing protocol tolerant of faulty 
    or malicious nodes.  They consider malicious nodes that tries
    to create routing loops, misdirects packets, or selectively drops 
    packets.  Their algorithm detects malicious links after $\log n$
    faults where $n$ is the length of the path.
    Since the protocol relies on packet acks to determine whether
    the node has reached the destination, the applicability to 
    low-energy sensor network may be limited. }, 
  abstract = { 
    An ad hoc wireless network is an autonomous self-organizing system of
    mobile nodes connected by wireless links where nodes not in direct
    range can communicate via intermediate nodes. A common technique used
    in routing protocols for ad hoc wireless networks is to establish the
    routing paths on-demand, as opposed to continually maintaining a
    complete routing table. A significant concern in routing is the
    ability to function in the presence of byzantine failures which
    include nodes that drop, modify, or mis-route packets in an attempt to
    disrupt the routing service.

    We propose an on-demand routing protocol for ad hoc wireless networks
    that provides resilience to byzantine failures caused by individual or
    colluding nodes. Our adaptive probing technique detects a malicious
    link after $\log n$ faults have occurred, where $n$ is the length of
    the path. These links are then avoided by multiplicatively increasing
    their weights and by using an on-demand route discovery protocol that
    finds a least weight path to the destination.}, 
  url = {citeseer.nj.nec.com/awerbuch02demand.html} 
}

@inproceedings{ park97highly,
    author = "Vincent D. Park and M. Scott Corson",
    title = "A Highly Adaptive Distributed Routing Algorithm for Mobile 
      Wireless Networks",
    booktitle = "{INFOCOM} (3)",
    pages = "1405--1413",
    year = "1997",
    annote = {Proposes a multipath routing protocol highly adaptive to
    changing topology.  This is too expensive for a sensor network with
    fixed nodes to implement, but may be applicable to sensor networks 
    with moving nodes.},
    url = "citeseer.nj.nec.com/park97highly.html" 
}

@misc{ nasipuri99demand,
  author = "A. Nasipuri and S. Das",
  title = "On-Demand Multipath Routing for Mobile Ad Hoc Networks",
  booktitle = "Proceedings of the 8 th Annual IEEE International Conference on
    Computer Communications and Networks (ICCCN)", 
  month = oct, 
  year = 1999,
  pages = "64--70", 
  url = "citeseer.nj.nec.com/nasipuri99demand.html"
}

@inproceedings{ madden02aggregate, 
  author = "Samuel Madden and Robert Szewczyk and Michael J. Franklin and 
  David Culler", 
  title = "Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks", 
  booktitle = "Workshop on Mobile Computing and Systems Applications", 
  year = 2002, 
  annote = {
    This paper describes the current state of the aggregation service
    offered by TinyDB.  It discusses routing tree setup and pipelined
    stream aggregation.  It also points out how a multipath aggregation
    can improve reliability, but does not mention faulty sensor nodes.
  }
}

@inproceedings{ madden02tag, 
  author = "Sam Madden and Michael J. Franklin and Joseph M. Hellerstein 
    and Wei Hong", 
  title = "TAG: A Tiny Aggregation Service for ad hoc Sensor Networks", 
  booktitle = "OSDI", 
  month = dec, 
  year = 2002, 
  annote = {
    This paper has the ad-hoc routing protocol in section 2.1.  The
    language seems to imply it is multipathed, or if nodes leave, join the
    network, they will find how to fit into the network.  It is most likely
    implemented in Nido, so we just need to fix it if it does not handle
    multipaths.
  },
  url = "http://www.cs.berkeley.edu/~madden/madden_tag.pdf" 
}

@inproceedings{ chen01span,
    author = "Benjie Chen and Kyle Jamieson and Hari Balakrishnan 
    and Robert Morris",
    title = "Span: An energy-efficient coordination algorithm for 
    topology maintenance in Ad Hoc wireless networks",
    booktitle = "Mobile Computing and Networking",
    pages = "85--96",
    year = "2001",
    url = "citeseer.nj.nec.com/chen02span.html" 
}

@inproceedings{ hellerstein97online,
    author = "Joseph M. Hellerstein and Peter J. Haas and Helen J. Wang",
    title = "Online aggregation",
    pages = "171--182",
    year = "1997",
    booktitle = "Proceedings of the ACM SIGMOD", 
    url = "citeseer.nj.nec.com/hellerstein97online.html" 
}

@inproceedings{ intanagonwiwat00directed,
    author = "Chalermek Intanagonwiwat and Ramesh Govindan and Deborah Estrin",
    title = "Directed diffusion: a scalable and robust communication 
    paradigm for sensor networks",
    booktitle = "Mobile Computing and Networking",
    pages = "56--67",
    year = "2000",
    url = "citeseer.nj.nec.com/intanagonwiwat00directed.html" 
}

@inproceedings{ heidemann01building,
    author = "John S. Heidemann and Fabio Silva and Chalermek Intanagonwiwat and Ramesh Govindan and Deborah Estrin and Deepak Ganesan",
    title = "Building Efficient Wireless Sensor Networks with Low-Level Naming",
    booktitle = "Symposium on Operating Systems Principles",
    pages = "146-159",
    year = "2001",
    url = "citeseer.nj.nec.com/heidemann01building.html" 
}

@article{ shekhar-detecting,
  author = "Shashi Shekhar and Chang-Tien Lu and Pusheng Zhang",
  title = "Detecting Graph-based Spatial Outliers",
  journal = "Intelligent Data Analysis",
  volume = 6,
  number = 5,
  year = "2002", 
  pages = "451--468", 
  annote = {
    Paper presents a nice simple statistical method of finding outliers in a
    data mining application. It relies on a graph of the data being
    constructed a head of time (which is possible in our application) and a
    threshold (or tolerance) value that is passed into the algorithm. This
    will work if we can pass it in through the query. However the problem
    with this algorithm is that it prone to small data sets. That is, the
    smaller the data set the less accurate the detection, which might be a
    problem since each parent will only have a small number of children. 
  }, 
  url = "citeseer.nj.nec.com/shekhar02detecting.html" 
}

@techreport{ intanagonwiwat01impact,
  author = "C. Intanagonwiwat and D. Estrin and R. Govindan and J. Heidemann",
  title = "Impact of network density on data aggregation in wireless 
  sensor networks",
  number = "01-750", 
  year = 2001, 
  month = nov, 
  institution = "University of Southern California", 
  annote = {
    This paper proposes a different form of aggregation, called 
    greedy aggregation that achieves better energy savings when node
    density is high.  It works by adjusting aggregation points to
    increase path sharing and to reduce the number of messages.
    While we are not implementing this aggregation technique, some
    energy saving technique may be applicable since we are looking at
    high density networks (to detect and prune or report outliers).
  }, 
  url = "citeseer.nj.nec.com/article/intanagonwiwat01impact.html" 
}

@article{ ganesan02highlyresilient,
  author = "Deepak Ganesan and Ramesh Govindan and 
    Scott Shenker and Deborah Estrin",
  title = "Highly-Resilient, Energy-Efficient Multipath Routing in 
    Wireless Sensor Networks",
  journal = "Mobile Computing and Communications Review", 
  volume = 1, 
  number = 2, 
  year = 2002,
  annote = {
    This paper has two different multipath routing techniques.  The first one,
    disjoint multipaths involves alternative path reinforcements when primary
    path fails.  Braided multipaths, the second approach, is more energy
    efficient when computing the alternative paths.  The drawback to both
    algorithms is that they work for single source and sink.}, 
  url = "citeseer.nj.nec.com/ganesan01highlyresilient.html" 
}

@misc{ romer02temporal, 
  author = {Kay R\"omer},
  title = "Temporal Message Ordering in Wireless Sensor Networks", 
  note = {Submitted for publication, December 2002.  Available at
  {\tt http://www.inf.ethz.ch/vs/publ/papers/temporder.ps}}
}

@techreport{ dulman02multipath, 
  author = "Stefan Dulman and Tim Nieberg and Paul Havinga and Pieter Hartel",
  title = "Multipath Routing for Data Dissemination in Energy Efficient 
    Sensor Networks",
  institution = "Center for Telematics and Information Technology (CTIT)", 
  number = "TR-CTIT-02-20",
  month = jul, 
  year = 2002,
  annote = {
    The short two page paper that describes energy efficient modification to
    the R\"omer algorithm \cite{romer02temporal}.
  },
  url = "citeseer.nj.nec.com/535597.html" 
}

@techreport{ papadimitriou02loci, 
  author = "Spiros Papadimitriou and Hiro Kitawaga and Phillip B. Gibbons 
  and Christos Faloutsos", 
  title = "LOCI: Fast Outlier Detection Using the Local Correlation Integral", 
  institution = "Intel Research Laboratory, Pittsburgh", 
  number = "IRP-TR-02-09", 
  year = 2002, 
  month = jul, 
  annote = {
    Presents an algorithm that doesn't need thresholds to be passed in, nor
    does it need a very large data set to get accurate results. It bases is
    algorithm on identifying a neighborhood from a certain node, and then
    how far the nodes that lie outside that neighborhood deviate from the
    nodes at the edge of the neighborhood. The approximation solution runs
    in linear time, so it might be a feasible solution for our detection. 
  },
  url = "http://www.intel-research.net/Publications/Pittsburgh/081620021325_99.pdf"
  }

@book{ barnett84outliers, 
  author = "Vic Barnett and Toby Lewis", 
  title = "Outliers in Statistical Data", 
  year = 1984, 
  publisher = "Wiley", 
  address = "New York", 
  annote = {
    A good book that contains a lot of information on outliers and how to
    find them. However the problem with many of the solutions is that they
    rely on large data sets or an understood distribution of the data. It is
    a great mathematical reference.  Still need to look into the third
    edition to see if it has any more applicable results.
  }
}

@inproceedings{ breunig99optics,
  author = "Markus M. Breunig and Hans-Peter Kriegel and 
    Raymond T. Ng and Jorg Sander",
  title = "{OPTICS}-{OF}: Identifying Local Outliers",
  booktitle = "Principles of Data Mining and Knowledge Discovery",
  pages = "262--270",
  year = "1999",
  url = "citeseer.nj.nec.com/242188.html" }

@article{ knorr00distancebased,
    author = "Edwin M. Knorr and Raymond T. Ng and Vladimir Tucakov",
    title = "Distance-Based Outliers: Algorithms and Applications",
    journal = "VLDB Journal: Very Large Data Bases",
    volume = "8",
    number = "3--4",
    pages = "237--253",
    year = "2000",
    url = "citeseer.nj.nec.com/knorr00distancebased.html" 
}

@misc{ tinyos, 
  key = {TinyOS}, 
  title = {{TinyOS}}, 
  note = {{\tt http://webs.cs.berkeley.edu/tos/}}
}

@inproceedings{ hill00system,
    author = "Jason Hill and Robert Szewczyk and Alec Woo and Seth Hollar and David E. Culler and Kristofer S. J. Pister",
    title = "System Architecture Directions for Networked Sensors",
    booktitle = "Architectural Support for Programming Languages and Operating Systems",
    pages = "93-104",
    year = "2000",
    url = "citeseer.nj.nec.com/382595.html" 
}

@inproceedings{ bonnet02sensor, 
  author = "Phillipe Bonnet and J. E. Gehrke and Praveen Seshadri", 
  title = "Towards sensor database systems.", 
  booktitle = "Proceedings of the Second International Conference on 
  Mobile Data Management", 
  address = "Hong Kong", 
  year = "2001", 
  month = jan, 
  annote = {
    Discusses database queries over sensor networks.  Does not specifically
    mention aggregation in the network, but has examples of how one
    can detect anomalies through selection operators.  However, this selection
    is based either on global threshold or predetermined positions of the
    nodes (known $x, y$, and $z$ coordinate).  We attempt to extend this
    mechanism to move outlier detection in the aggregation phase inside 
    the sensor network, using local connectivity and history information.
  }
}