what would happen in one of these scenarios, but it is
probably a problem worth further investigating.
Moreover, a system like the one presented could
greatly take advantage of harvesting prediction mod-
els like (Lu et al., 2010), so that the best choice is
not computed locally as the one that instantly maxi-
mizes the cipher’s strength or the length of the out-
going queue in a greedy manner, but a more proactive
approach could be used to provide better performance
over a longer period of time. For example by know-
ing that soon a very good situation for the energy har-
vester will manifest (e.g. sun is rising, lots of sunlight
will be available for a long period) then the current
security suite could be kept unchanged even if that
wouldn’t be the optimal choice in the short run.
The idea proposed in the second work aims at pre-
computing data when the harvested energy is abun-
dant, and using it when the available amount is re-
duced to prolong the life of a node. Anyway, the
authors of the paper do not discuss matters like the
topology of the network and the shape and direction-
ality of the traffic. As discussed before, if the traf-
fic generated by one node is intended to another node
rather than the sink, it could be possible that the re-
cipient does not have enough energy to process it (i.e.
decrypt it, analyze its content and react). Again, in a
multihop network nodes are burdened with the addi-
tional task of forwarding packages. This could greatly
reduce the time available for a node to compute future
keystreams. Furthermore, for node to node communi-
cation the keystreams have to be aligned for decryp-
tion to happen, and for the verification of MACs keys
have to be shared in advance and agreed upon.
An interesting idea could be to rely on other
nodes to perform computationally demanding opera-
tions when the energy is scarce. A way to do so could
be by piggybacking data, such as the keystream bytes
for future messages, on regular messages.
5 CONCLUSIONS
Applications for EH-WSNs are constantly increasing,
and so are their security requirements. How to im-
prove these aspects is an interesting open question. In
this paper we have provided a taxonomy of attacks for
EH-WSNs, we have discussed how scavenging capa-
bilities affect them and if new and specific attacks can
be depicted. Afterwards, we have described recent
approaches that present two complementary take on
the same topic. On one hand we have an adaptation
of the strength of the algorithms used according to the
available energy, in this way communications can be
carried on, at the cost of less secure messages. On the
other hand there is a time oriented approach that takes
advantage of the decoupling between plain text and
keystreams in specific scenarios, so that the latter can
be computed in advance when the energy is abundant,
and used when it is scarce. Both ideas explain how
to exploit characteristics specific of power harvesting
systems where the amount of available energy will
fluctuate over time both up and down.
Clearly being able to define solutions that can dy-
namically adapt some of their parameters according
to the current available energy, allowing the system to
run within acceptable limits in any circumstance is a
very critical feature of future EH-WSNs.
REFERENCES
Benenson, Z., Cholewinski, P., and Freiling, F. (2008). Vul-
nerabilities and attacks in wireless sensor networks.
Wireless Sensors Networks Security, pages 22–43.
Carter, J. L. and Wegman, M. N. (1977). Universal Classes
of Hash Functions (Extended Abstract). In Proc. of
STOC’07, pages 106–112. ACM.
Lu, J., Liu, S., Wu, Q., and Qiu, Q. (2010). Accurate mod-
eling and prediction of energy availability in energy
harvesting real-time embedded systems. In Proc. of
IGCC’10, pages 469–476.
Lupu, T.-G. (2009). Main types of attacks in wireless
sensor networks. In Proc. of the 9th WSEAS SSIP
’09/MIV’09, pages 180–185. WSEAS.
Martins, D. and Guyennet, H. (2010). Wireless Sensor Net-
work Attacks and Security Mechanisms: A Short Sur-
vey. In Proc. of NBiS’10, pages 313–320.
Pelissier, S., Prabhakar, T., Jamadagni, H., Venkate-
shaPrasad, R., and Niemegeers, I. (2011). Providing
Security in Energy Harvesting Sensor Networks. In
Proc. of CCNC’11 IEEE, pages 452–456.
Sen, J. (2010). A survey on wireless sensor network secu-
rity. CoRR, abs/1011.1529.
Sudevalayam, S. and Kulkarni, P. (2011). Energy harvesting
sensor nodes: Survey and implications. Communica-
tions Surveys Tutorials, IEEE, 13(3):443–461.
Taddeo, A. V., Mura, M., and Ferrante, A. (2010). QoS and
Security in Energy-Harvesting Wireless Sensor Net-
works. In Proc. of SECRYPT’10, pages 1–10.
Wander, A., Gura, N., Eberle, H., Gupta, V., and Shantz, S.
(2005). Energy Analysis of Public-Key Cryptography
for Wireless Sensor Networks. In Proc. of PerCom’05,
pages 324–328.
Won, D., editor (2001). Information Security and Cryp-
tology - ICISC 2000, Third International Conference,
Seoul, Korea, December 8-9, 2000, Proc., volume
2015 of Lecture Notes in Computer Science. Springer.
SECURITY CHALLENGES FOR ENERGY-HARVESTING WIRELESS SENSOR NETWORKS
425