Detecting Malicious Node in MANET Using Trust Based Cross-Layer Security Protocol
Journal Title: International Journal of Computer Science and Information Technologies - Year 2010, Vol 1, Issue 2
Abstract
In this paper, we develop a trust based security protocol based on a cross-layer approach which attains confidentiality and authentication of packets in both routing and link layers of MANETs. In the first phase of the protocol, we design a trust based packet forwarding scheme for detecting and isolating the malicious nodes using the routing layer information. It uses trust values to favor packet forwarding by maintaining a trust counter for each node. A node is punished or rewarded by decreasing or increasing the trust counter. If the trust counter value falls below a trust threshold, the corresponding intermediate node is marked as malicious. In the next phase of the protocol, we provide link-layer security using the CBC-X mode of authentication and encryption. By simulation results, we show that the proposed cross-layer security protocol achieves high packet delivery ratio while attaining low delay and overhead
Authors and Affiliations
A. Rajaram , Dr. S. Palaniswami
Towards Novel And Efficient Security Architecture For RoleBased Access Control In Grid Computing
Recently, there arose a necessity to distribute computing applications frequently across grids. Ever more these applications depend on services like data transfer or data portal services and submission of...
A new horizon in data security by Cryptography & Steganography
Steganography and Cryptography are two popular ways of sending vital information in a secret way. One hides the existence of the message and the other distorts the message itself. There are many cryptographic t...
An Approach to Shortest Path Technique for BGP Using OSPF
The routing of traffic between Internet domains, or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address interdomain routing...
ROUTING PROBLEM FOR PARALLEL ROUTE BASED MAXMIN ANT SYSTEM
The proposed work presented a modified MAX-MIN Ant System (MMAS) algorithm to solve the routing problem, in which known demand are supplied from a store house with parallel routes for new local search. Routing Problem is...