<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-19T22:26:24Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81848" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81848</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Nahrstedt, Klara</dc:contributor>
          <dc:creator>He, Wenbo</dc:creator>
          <dc:date>2015-09-25T20:20:40Z</dc:date>
          <dc:date>2015-09-25T20:20:40Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2008</dc:date>
          <dc:date>2008</dc:date>
          <dc:description>To show the efficacy and efficiency of the proposed schemes, I present simulation results of our schemes and compare their performance to a typical data aggregation scheme, Tiny Aggregation protocol (TAG), where no privacy preservation and integrity protection is provided. We explore multiple dimensions in design space, and investigate the tradeoffs in protocol design. To the best of our knowledge, this dissertation is among the first network protocols to preserve privacy and integrity in data aggregation for wireless sensor networks.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:20:40Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3347392.pdf: 4466335 bytes, checksum: 2fef53c65192d7b55553d80101c1cd63 (MD5)
  Previous issue date: 2008</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 83129
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>94 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81848</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3347392</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Achieving Privacy and Integrity of Data Aggregation in Wireless Sensor Networks</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
