Limits...
A routing path construction method for key dissemination messages in sensor networks.

Moon SY, Cho TH - ScientificWorldJournal (2014)

Bottom Line: Authentication is an important security mechanism for detecting forged messages in a sensor network.Each cluster head (CH) in dynamic key distribution schemes forwards a key dissemination message that contains encrypted authentication keys within its cluster to next-hop nodes for the purpose of authentication.The forwarding path of the key dissemination message strongly affects the number of nodes to which the authentication keys in the message are actually distributed.

View Article: PubMed Central - PubMed

Affiliation: College of Information and Communication Engineering, Sungkyunkwan University, Suwon 440-746, Republic of Korea.

ABSTRACT
Authentication is an important security mechanism for detecting forged messages in a sensor network. Each cluster head (CH) in dynamic key distribution schemes forwards a key dissemination message that contains encrypted authentication keys within its cluster to next-hop nodes for the purpose of authentication. The forwarding path of the key dissemination message strongly affects the number of nodes to which the authentication keys in the message are actually distributed. We propose a routing method for the key dissemination messages to increase the number of nodes that obtain the authentication keys. In the proposed method, each node selects next-hop nodes to which the key dissemination message will be forwarded based on secret key indexes, the distance to the sink node, and the energy consumption of its neighbor nodes. The experimental results show that the proposed method can increase by 50-70% the number of nodes to which authentication keys in each cluster are distributed compared to geographic and energy-aware routing (GEAR). In addition, the proposed method can detect false reports earlier by using the distributed authentication keys, and it consumes less energy than GEAR when the false traffic ratio (FTR) is ≥ 10%.

Show MeSH
Average hop counts per false report for various k values (αP = 0.2).
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4127250&req=5

fig13: Average hop counts per false report for various k values (αP = 0.2).

Mentions: In the experiment, the total number of secret keys in the GKP is 100, and the maximum number of authentication keys that a node can obtain from other clusters (through key dissemination messages) is 10. We can see that the larger the value of k, the more the authentication keys a node can obtain from other clusters through key dissemination messages. When k is 5, 10, 15, or 20, a sensor node can, respectively, obtain on average 3.33, 4.33, 4.92, or 5.18 keys from other clusters. On the other hand, the degree of performance improvement decreases as k increases because the number of authentication keys that a sensor node can obtain from other clusters is limited by the fixed memory size of the nodes. Moreover, key dissemination messages are forwarded through the paths that are composed of nodes with high fitness values. Therefore, the authentication keys tend to be concentrated at some nodes, which leads to a lack of memory in the nodes. Figure 13 shows the average hop counts for a false report for different k values.


A routing path construction method for key dissemination messages in sensor networks.

Moon SY, Cho TH - ScientificWorldJournal (2014)

Average hop counts per false report for various k values (αP = 0.2).
© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4127250&req=5

fig13: Average hop counts per false report for various k values (αP = 0.2).
Mentions: In the experiment, the total number of secret keys in the GKP is 100, and the maximum number of authentication keys that a node can obtain from other clusters (through key dissemination messages) is 10. We can see that the larger the value of k, the more the authentication keys a node can obtain from other clusters through key dissemination messages. When k is 5, 10, 15, or 20, a sensor node can, respectively, obtain on average 3.33, 4.33, 4.92, or 5.18 keys from other clusters. On the other hand, the degree of performance improvement decreases as k increases because the number of authentication keys that a sensor node can obtain from other clusters is limited by the fixed memory size of the nodes. Moreover, key dissemination messages are forwarded through the paths that are composed of nodes with high fitness values. Therefore, the authentication keys tend to be concentrated at some nodes, which leads to a lack of memory in the nodes. Figure 13 shows the average hop counts for a false report for different k values.

Bottom Line: Authentication is an important security mechanism for detecting forged messages in a sensor network.Each cluster head (CH) in dynamic key distribution schemes forwards a key dissemination message that contains encrypted authentication keys within its cluster to next-hop nodes for the purpose of authentication.The forwarding path of the key dissemination message strongly affects the number of nodes to which the authentication keys in the message are actually distributed.

View Article: PubMed Central - PubMed

Affiliation: College of Information and Communication Engineering, Sungkyunkwan University, Suwon 440-746, Republic of Korea.

ABSTRACT
Authentication is an important security mechanism for detecting forged messages in a sensor network. Each cluster head (CH) in dynamic key distribution schemes forwards a key dissemination message that contains encrypted authentication keys within its cluster to next-hop nodes for the purpose of authentication. The forwarding path of the key dissemination message strongly affects the number of nodes to which the authentication keys in the message are actually distributed. We propose a routing method for the key dissemination messages to increase the number of nodes that obtain the authentication keys. In the proposed method, each node selects next-hop nodes to which the key dissemination message will be forwarded based on secret key indexes, the distance to the sink node, and the energy consumption of its neighbor nodes. The experimental results show that the proposed method can increase by 50-70% the number of nodes to which authentication keys in each cluster are distributed compared to geographic and energy-aware routing (GEAR). In addition, the proposed method can detect false reports earlier by using the distributed authentication keys, and it consumes less energy than GEAR when the false traffic ratio (FTR) is ≥ 10%.

Show MeSH