Distributed Sensor Networks: Lifetime and Security
Niels Lervad Andersen, Zdravko Karakehayov, Zdravko Todorov Monov · University of Southern Denmark Research Portal (University of Southern Denmark) · 2006
This paper describes a routing algorithm for distributed sensor networks. The algorithm attempts to satisfy the conflicting needs of power efficiency and security. The method can be applied for sensor networks designed for energy scavenging. The nodes of the network communicate in a multihop manner. The best candidate for the next hop is the node closest to the destination. At the same time, nodes in process of scavenging have ample amount of energy and become suitable replacements for well located nodes. This feature makes the network more vulnerable in case of black hole attacks. Malicious nodes may attract traffic and drop packets. The proposed algorithm is based on the assumption that the environment will influence several nodes simultaneously. We discuss the CPU architectures used in the domain of sensor networks and provide simulation results for three of them. The simulation results indicate the algorithm execution time and memory requirements for different density of the network.