A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://eudl.eu/pdf/10.4108/pwsn.2007.2286">the original URL</a>. The file type is <code>application/pdf</code>.
HEAP: A Hierarchical Energy Aware Protocol for Routing and Aggregation in Sensor Networks
<span title="">2007</span>
<i title="ICST">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/waqoqpgjmjflhh2anipfmv5qom" style="color: black;">Proceedings of the 3rd International ICSTConference on Wireless Internet</a>
</i>
Applications requiring monitoring such as medical and habitat monitoring, pose a great challenge to sensor network protocols. Power consumption in wireless sensor networks is largely constrained in each node of the network due to the size and the availability of the energy resources. Therefore, having an enhanced scheme that can save transmission energy is ideal. This paper presents an energy efficient and fault tolerant algorithm for routing in wireless sensor networks, which meets sensor
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4108/pwsn.2007.2286">doi:10.4108/pwsn.2007.2286</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wicon/MoazeniV07.html">dblp:conf/wicon/MoazeniV07</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xvfslljajnd7lfldghhhvoxmxy">fatcat:xvfslljajnd7lfldghhhvoxmxy</a>
</span>
more »
... rks requirements for monitoring systems that huge amount of events are sensed in them. The algorithm constructs a hierarchy tree over the network and maintains the distribution of energy by restructuring the hierarchy tree over time. The proposed idea was implemented using PARSEC and compared to the HPEQ protocol. Evaluations showed that the proposed algorithm is proper solution for systems with high amount of data sensed because of efficient energy distribution in the network and the ability to aggregate iterative data hierarchically.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430231509/https://eudl.eu/pdf/10.4108/pwsn.2007.2286" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/5b/f3/5bf399c50358e9b4ed4eef52e70fa74dd7d788d9.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4108/pwsn.2007.2286">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
Publisher / doi.org
</button>
</a>