1096 search results - page 209 / 220 » Gathering-Load-Balanced Tree Protocol for Wireless Sensor Ne... |
PERCOM
2005
ACM
14 years 7 months ago
2005
ACM
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
ESAS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
SAC
2003
ACM
14 years 1 months ago
2003
ACM
Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems wit...
EWSN
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...