With the proliferation of wireless sensor networks, it has become expedient to make sure that the communication links between sensor nodes are more secure. Many researches have been done over the years. Due to the resource constraints of wireless sensor networks, traditional key management schemes such as the Diffie-Hellman and public key schemes are not applicable in wireless sensor networks. Our work seeks to improve on the Pairwise scheme and the Random pairwise scheme by Chang, Perrig and Song by dividing the number of nodes in the network into groups.In our scheme, n nodes are chosen and each assigned a unique key identifier. The n nodes are divided into m groups with group leaders. Each node id in the group is paired with the other nodes in the group and a pairwise key is generated for the pair. Each node stores the pairwise key and the node id of the node it shares a pairwise key within its memory. Each group leader is also paired with all other group leaders and a pairwise key generated for each pair of group leaders. Nodes in a group use the pairwise keys for communication and when a node needs to communicate to other nodes in another group, it passes it through its group leader to the other group’s leader and to the other node.In comparison, our scheme performs better in terms of resilience and connectivity as compared with the basic scheme and the random pairwise scheme. This scheme provides a fully connected graph and uses the WH hash function to encrypt the broadcast of messages.
happy new year
snow
i am crazy
software
my code here
http://www.mcf.net/mboard
http://www.alw7sh.net/forums
http://www.pod3emka.ru/forum
http://www.moshr.com
http://en.toprural.com/forum
