|
|
|
|
WIRELESS AS Probably SAFETY
Wireless communication speeds of networks and access to their range In addition to work done to improve these networks security the work is done in [20-31].
Wireless As in wired networks and data networks transmitted in packets [17]. Sent packets of information within the network against attacks disruptive Even in a fast manner and without changing the target transmission is very important to address. Data network packets on follow will be safe road calculated routing protocols are responsible. Wired networks, packets direction in order inside the domain (intra-domain) and external area (inter-domain) is available to two areas. ç mostly in the field of distance vector (distance vector) protocol or link state routing (link state) routing protocols are used. In outer space border crossing (border gateway) routing protocol are used [17]. These protocols of more hotlines or degradation, such as rupture of the nodes simple error are designed for situations [18]. Because wired networks to realize that network attacks must be physically connected. Therefore cable In network security has remained in the second plan. But wireless a physical connection to the network to connect to the network in not required. Wireless a network, the necessary hardware which any person can access easily. In addition, wired network routing task routers, although it is wireless networks this task often both wireless that network routers and uses mobile users is the responsibility of [19]. Wireless more so in front of security in networks plan is. Thus wireless routing networks for increasing security on the protocol many studies have been made [20-31]. The remainder of this section In part, these studies in detail the examined.
3.1. Sead
Hu et al. [20] proposed by the "Secure efficient ad hoc distance vector "(Secure Efficient Ad-hoc Distance Vector-sead) is a proactive routing protocol. "Target sequence distance vector" (Destination Sequenced Distance Vector-DSDV) was designed based on [21]. DSDV which is common with the target, metric, the next jump (next hop) and the sequence number, as well as areas such as sead routing table, a hash value for each entry provides. relevant article, and ranking metric numbers to prevent attack routing updates subject on were considered. One-way in the proposed security protocol hash chain as a function called H function, key feature. Each node 1 2 3 ,, ,..., n hhh h values list is calculated. 0 h 's random initial value According 0 in <? basis 1 () i i h H h -- = calculated. Article n h 's to be sent distribution mechanism considered to be acceptable to all recipients is. Node H function and n h value Even if any i h calculate the value and n h with Introduction verification process can perform. Of routing updates verification of routing table entry for every one nodes are added by the hash value. j metric and i with sequence number n j h -- + value orientation validation is used to update. Here maximum network diameter 1 m -- was taken as. Attacker smaller than the reported value of its hash index can not calculate a hash value with values, to the same destination sequence number is greater or better routing metric to value will not tell. Sequence number and the other nodes sead modifying the routing metric, incorrect routing case against an attacker who tries to uncover is a powerful protocol. But attacker sead next hop routing node or misleading changing the target area changed can not prevent. Also attacker previousThe sequence number and metric of how people changed using a new routing to a destination other Send updates can not prevent [20].
3.2. Ariadne
Hu et al. [22] "effective demand-based secure routing protocol "(An efficient on-demand secure routing protocol-Ariadne) have proposed. This protocol symmetric cryptography is based. Nodes routes of attack blocking is intended. Ariadne media access control (Media access control-MAC) address level, two between nodes, shared by means of a switch, validation of the messages are redirected to. But as directed messages secure for verification "time efficient resource loss tolerant verification "(timed efficient stream loss-tolerant authentication-TESLA) broadcast authentication protocol uses [23]. Ariadne "dynamic source orientation "(dynamic source routing-DSR)-based has a structure [19]. Contains two basic functions, such as DSR and is responsible for discovery and routing. Shared key and one-way hash of Ariadne uses a combination of function efficiently. Verification for the purpose of the message receiver and transmitter hidden key is shared. Encryption verification If the nodes between the hash provide mechanisms provides accuracy hops. Dead link In case of error messages sent routing available and intermediate nodes are transmitted in the chosen path dead links use redirects are removed. Ariadne modification of routing information and re - to produce a significant protection against attacks provides. Tesla which is an enhanced version "Temporary bonds" (Temporal Leashes-TIK) with used wormhole [24] attacks provides immunity. But the selfish node attacks has a clear structure. In real life Using a key exchange to make the complex It is difficult for the adaptation [22].
3.3. SAR
Seung et al. [25] "security conscious orientation" (security aware routing-SAR) have proposed protocol. This protocol "Demand-based distance vector routing" (Ad-hoc on - demand distance vector routing-AODV) [26]-based and a routing protocol based on demand. A SAR the security level security and routing node bringing together and using the features desired routing to be used for integrated security form a metric. As the routing metric security quality (qop-Quality of Protection) Built with a safe way so you get the path of discovery was. Vector with the appropriate security level qop is a combination of cryptographic techniques. SAR a notation based on hierarchy by creating ad-hoc wireless networks of different security levels division provides. Thus, with the target resource point communication between the nodes will be involved in The minimum security level required for provides. Wireless as an interconnected network if ways to provide the necessary level of confidence even be. SAR, way less than AODV
Although this path was created to produce a certain provides security level [25].
3.4. SRP
Papadimitratos et al. [27] "secure routing protocol" (Secure Routing Protocol-SRP) have proposed. SRP path against attacks that could prevent the discovery provides. Thus the system of topological information is guaranteed to be obtained. SRP The interval between the start and destination nodes nodes While communication of data to be approved cryptographic without needing to be made between nodes basic idea is to establish security associations. This trust relationship between the source and destination to share common KG can be achieved with the key is accepted. This security relations since the routing phase than There must be before [27].
3.5. ARAN
Sanzgiri et al. [28] "ad-hoc network for a secure routing protocol "(a secure routing protocol for ad hoc networks-ARAN) have proposed. ARAN based demand is a routing protocol. This protocol can be managed to ensure secure communication in open environments designed. Public key infrastructure protocol uses. Managed nodes in open environments communicate with each other since before the beginning of parameters are shared. Session key exchange change, or a third party, such as a certificate server is distributed over. Of each node in a certificate of Aran There. Nodes to the trusted certificate server After you verify their identity safely receive a certificate from the server. Nodes of this certificate using and make each other's authentication perform the transmission of routing messages. Certificate public key and the IP address of the node contains the start and end date of the certificate. This areas are marked by the certificate server and fixed.
During verification, secure way to the destination point is wanted. Two from each of the nodes in the network between are kept. This addresses the previous node with the target node addresses. All the information in the routing messages since the private key by the node marked and constant. Time stamp (t) and a special number (NI) Formed from a combination of data and new and time information is not checked.
Since routing path for each node discovery request when NI special issue is increasing. Signature, and the cycle will change the way spoofing may occur prevent attacks The process of creating a safe path down briefly explained. Between source node and destination node a way to communicate discovery package (YKP) are published [28]. lk Each node, other nodes YKP'yi times between signatures are removed, then with their own key YKP'yi signatures and all neighboring nodes transmissions. This event Continue until you reach the destination node YKP package is. Target node after receiving the package YKP the source node via the same route reply packet back sends. Source node receives the response packet destination signature of the node and NI number of special checks. This is correct, safe way for the installation was completed be. Nodes contained in the routing table routing entries are timed out and a certain
Automatically removes the time period are not used. The road also lost due to mobility nodes send an error message will alert the sender. ARAN predetermined cryptographic certificates using attacks such as authentication and deny obstacles. Path discovery and path in the configuration of the simulation was successful in the management of packages, but many growth due to the heavy burden of the total routing has shown. Heavy symmetric cryptographic successful in terms of energy calculations requires is not. Also does not prevent wormhole attacks. If If there is no time synchronization between nodes re is also open to attack 3.6. SAODV "Secure AODV (AODV-Secure SAODV), Zapata [29] as proposed by secure AODV packets is a protocol that provides transmission expansion. AODV messages to ensure the security of the two mechanisms are used. Clear message for the region For information on digital signatures and hash chains jump are used [29].
Protocol uses asymmetric key cryptography management mechanism is needed. Thus, a node with other nodes on the network as a secure area can initiate communication. Nodes one node to another wants to communicate the IP field Max_Atlama_Sayısı that life expectancy in the title (Time To Live-TTL) section takes. Top_Hash value will be sent To calculate Max_Atlama_Sayısı, random core value is inserted into the hash function. Road requests or node re-route field Max_Atlama_Sayısı'ndan hop count obtained by subtracting the value Top_Hash compared with the value. Sequence number and other nodes SAODV attacks by changing the routing metric to Although resistant to aggressive routing changing the target area changed can not prevent. Also attacker previous the sequence number and metric of how people changed using a new routing to a destination other Send updates can not prevent [29]. 3.7. SLSP "Secure link state protocol (Secure link state protocol-SLSP) wireless for the networks on a regular proactive ties offers state routing [30]. Each node without skipping a sub-unit of R itself creates a network.
This sub-network consisting of nodes in communications as it called. Nodes public key certificates signed public key in the fields of communication Packages are sent with. Bonding state information as a periodic neighbor discovery protocol (NLP-Neighbor Location Protocol) and are published [30].
A node receives a binding update pack nodes, previously received the package and back up with the public key correct, then the one-way hash atlama_sırası'nı tables and verify.
Although very effective against pests SLSP nodes, can not be effective against collective attacks [30].
3.8. FLSL
Nie et al. [31] "Fuzzy logic-based security level routing protocol "(fuzzy logic-based security level routing protocol-FLSL) have proposed. In this protocol in hand with the highest level of secure communication facilities fuzzy logic is used to ensure.
Protocol on the key length (l) Key to change frequency (f) And the number of nodes (n) And was taken as security level (s) Were determined. These variables between 1 slfn--? ii relation that has been proposed. This Question of security level (s) With key length (l) key to change the frequency (f) And the number of nodes of the opposite has been suggested that a direct proportion between. This desired security level enabling fuzzy values been trying to reach [31].
This method, other methods of parameter assist in the optimization for the purpose In addition to any routing protocol used. Thus, the system's facilities are used that may be within the highest level of work targeted.
Used together with advantages and FLSL protocol disadvantages, although the used the protocol, the desired security level for the optimum keeps
|
|
|
|
|
![[Valid RSS]](http://www.wirelessdatasecurity.net/rss/valid-rss.gif "Validate my RSS feed"){kind=small}
