<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-computer-science-and-technology</journal-id>
<journal-title-group>
<journal-title>Global Journal of Computer Science and Technology</journal-title>
</journal-title-group>
<issn publication-format="print">0975-4350</issn>
<issn publication-format="electronic">0975-4172</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/74022.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">74022</article-id>
<title-group>
<article-title>QoS Routing Protocols and Privacy in Wireless Sensor Networks</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>praveen</surname><given-names>Dr. phani</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Babu</surname><given-names>B. Sukumar</given-names></name></contrib>
</contrib-group>
<aff id="aff1">INDIA</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2012-05-15">
<day>15</day>
<month>05</month>
<year>2012</year>
</pub-date>
<volume>12</volume>
<issue>4</issue>
<fpage>33</fpage>
<lpage>39</lpage>
<abstract><p>Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a challenging problem due to the conditions imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). This proposed paper consists of two algorithms IRL algorithm and data privacy mechanism that addresses this problem. The proposed system provides additional trustworthiness, less computation power, less storage space and more reliability. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>Anonymity; eavesdropping; hop-by-hop trace back; privacy; routing; wireless sensor networks</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume12/5-Qos-Routing-Protocols-and-Privacy.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/qos-routing-protocols-and-privacy-in-wireless-sensor-networks/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>Full network level privacy has often been categorized into four sub-categories: Identity, Route,  Location and Data privacy. Achieving full network level privacy is a challenging problem due to the conditions  imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility  and topology) and QoS issues (e.g., packet reach-ability and timeliness). This proposed paper consists of two  algorithms IRL algorithm and data privacy mechanism that  addresses this problem. The proposed system  provides additional trustworthiness, less computation power, less storage space and more reliability. Also, we  proved that our proposed solutions provide protection against various privacy disclosure attacks, such as  eavesdropping and hop-by-hop trace back attacks.</p>
</sec>
</body>
</article>