SPINS: security protocols for sensor networks
Wireless Networks
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
SecLEACH - A Random Key Distribution Solution for Securing Clustered Sensor Networks
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Secure Distributed Cluster Formation in Wireless Sensor Networks
ACSAC '06 Proceedings of the 22nd Annual Computer Security Applications Conference
Resilient Cluster Formation for Sensor Networks
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
A new agent-based solution for wireless sensor networks management
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Resilient cluster leader election for wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
A Fair and Secure Cluster Formation Process for Ad Hoc Networks
Wireless Personal Communications: An International Journal
On the security of cluster-based communication protocols for wireless sensor networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
| Hi-index | 0.00 |
In clustered sensor networks, because CHs (cluster heads) collect data from sensors and transmit the aggregated data to the sink, it is very important to elect the CHs in a secure manner. In order to protect CH elections from attackers, unpredictability, non-manipulability, and agreement property should be guaranteed in CH elections. However, existing schemes for secure CH election cannot prevent intelligent attackers from violating the properties via cooperation. In this paper, we propose a scheme that securely elects CHs by detecting intelligent attackers and excluding them. For every CH election round, each CH candidate provides reputation values to other CH candidates according to their behavior and extracts real reputation values. Then, each node evaluates the real reputation values of members in its cluster and excludes some disreputable nodes from CH candidates. The scheme greatly enhances the non-manipulability and agreement property of CH election results compared to other rival schemes. Furthermore, the scheme presents higher non-manipulability and higher agreement property than other schemes, even in an environment where message losses can occur.