2016
DOI: 10.17485/ijst/2016/v9i26/95137
|View full text |Cite
|
Sign up to set email alerts
|

Cluster Based Mutual authenticated key agreement based on Chaotic Maps for Mobile Ad Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…These systems must be able to perform the functions of both a host and a router. For a node to function as a router, it must be configured with network intelligence that can make decisions regarding the communication that takes place between nodes, as well as provided with a buffer that can information and energy that can both receive and deliver information are stored in a memory device [7]. Nevertheless, the resources of the nodes are extremely unpredictable and restricted, particularly the quantity of energy that is accessible and the amount of buffer space.…”
Section: Bottleneck Nodementioning
confidence: 99%
“…These systems must be able to perform the functions of both a host and a router. For a node to function as a router, it must be configured with network intelligence that can make decisions regarding the communication that takes place between nodes, as well as provided with a buffer that can information and energy that can both receive and deliver information are stored in a memory device [7]. Nevertheless, the resources of the nodes are extremely unpredictable and restricted, particularly the quantity of energy that is accessible and the amount of buffer space.…”
Section: Bottleneck Nodementioning
confidence: 99%
“…As a consequence of the property referred to as the "Chaotic Maps Based Diffie Hellman problem [14,15]," it is possible for the source and the destination to come to an agreement over an authenticated key. Ordered Maps a technique for implementing the key arrangement of communicative elements, is based on Chebyshev-Polynomials (Chaos theory) [17], and it is concerned with the behavior of dynamical systems. The following is a definition of the Chebyshev-Polynomial: cos(n) might expressed cos(θ)polynomial, as seen in equation 3.…”
Section: Communication Entity Session Key Agreementmentioning
confidence: 99%
“…Data must be safeguarded and securely exchanged between interacting entities because the network is subject to assaults. User data from untrusted nodes are mostly protected through authentication [3]. To securely send and receive data, communication parties authenticate each other during mutual authentication [4].…”
Section: Introductionmentioning
confidence: 99%