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
Internal operation of a node that receives a key dissemination message.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4127250&req=5

fig5: Internal operation of a node that receives a key dissemination message.

Mentions: In (6), N is one of CPNs of the current node and DK(N) is the number of authentication keys that node N can obtain from the key dissemination message. The current node can derive the value of DK(N) by considering the secret key indexes of node N and the secret key indexes of the key dissemination message. DI(N) and EC(N) correspond to the distances from node N to the sink node and the energy consumption of node N, respectively. The parameters αP and (1 − αP) represent the weight values for the terms. The current node computes the evaluation function for each CPN and selects BF nodes from among them to be the next-hop nodes. It then forwards the key dissemination message to the selected next-hop nodes. Figure 5 illustrates the internal operation of a node that receives a key dissemination message.


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

Moon SY, Cho TH - ScientificWorldJournal (2014)

Internal operation of a node that receives a key dissemination message.
© Copyright Policy - open-access
Related In: Results  -  Collection

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

fig5: Internal operation of a node that receives a key dissemination message.
Mentions: In (6), N is one of CPNs of the current node and DK(N) is the number of authentication keys that node N can obtain from the key dissemination message. The current node can derive the value of DK(N) by considering the secret key indexes of node N and the secret key indexes of the key dissemination message. DI(N) and EC(N) correspond to the distances from node N to the sink node and the energy consumption of node N, respectively. The parameters αP and (1 − αP) represent the weight values for the terms. The current node computes the evaluation function for each CPN and selects BF nodes from among them to be the next-hop nodes. It then forwards the key dissemination message to the selected next-hop nodes. Figure 5 illustrates the internal operation of a node that receives a key dissemination message.

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