Adaptation Performance of Covert Channels in Dynamic Source Routing
#1

PRESENTED BY
V.JYOTHI

[attachment=12401]
Adaptation Performance of Covert Channels in Dynamic Source Routing
ABSTRACT

Advancements in ad-hoc wireless network routing protocols have raced to keep up with the demands of a less structured, mobile, and dynamic routing environment.
Along with the rapid development of these protocols, new forms of attacks and exploitations have begun to raise security issues in data transmission. Current ad-hoc mobile network protocols allow for the presence of covert channels, which create secret information transfer across an otherwise secure network policy.
In this paper, we present several methods of data encoding and undetectable communication transfer between nodes in the Dynamic Source Routing (DSR) protocol.
Unlike covert channels seen in other protocols such as the Ad-hoc On-demand Distance Vector (AODV) protocol, due to promiscuous listening and salvaging by intermediate node route caches, a destination node in a DSR network does not always receive routing packets sent from an originating sender node.
INTRODUCTION
As people become increasingly dependent on cell phones and other wireless communication links, the development of efficient and economic routing protocols has gained greater focus.
An important factor in weighing the relative capabilities of these protocols is their ability to withstand attacks and exploitation from malicious and selfish users.
The difficulty of this task is compounded by the inability of ad hoc architecture to implement a predefined security architecture or authentication system for the expansion and shrinking of the network.
EXISTING SYSTEM
work at the University of Maryland focuses on covert transmissions in the Ad-hoc On-demand Distance Vector Routing (AODV) protocol and tests for vulnerabilities.
It shows several ways for communication between a sender and receiver, and focuses more specifically on the request RREQ broadcasts by a sender.
Though technically considered information hiding because of the unconcealed nature of the channel between the sender and the receiver, the Simulation shows that in a lossy, noisy environment with limited bandwidth, covert information transfer is possible.
The affirmation of the possibility of covert data transfer in the results of this simulation and the sheer difficulty of detection have been the driving force behind the exploration of covert information transfer in the DSR protocol
PROPOSED SYSTEM
Covert Channels and Information Hiding
• A covert channel simply put is the transfer of data between two processes that are not permitted or not known to be in touch with each other.
• In this method of information hiding, the secret data is encoded in the LSB (least significant bits) of regular images.
• Since it is very difficult to notice the slight pixel differences, the transfer of secret data between two sources occurs undetected.
PROPOSED SYSTEM
• Ad hoc Network Security
• Johnson designed the DSR protocol so that individual nodes could efficiently and securely send data through neighbor nodes to a desired location in any given network topology
• Due to the infra structure less and dynamic nature of this mobile ad hoc network, malicious nodes have ample opportunity to attack network security.
• Encoding data in DSR routing
• There are three main data packets originated by the DSR protocol: requests (RREQ), replies (RREP) and error messages (ERR).
• The main method of covert data transfer we focus on in this paper is the request packet.
Covert Channels in the DSR Protocol
Protection and Detection
• The goal of protection is for member nodes to gain awareness of the status of fellow member nodes and to be protected if it is found out that a member node is malicious.
• Aggressive chaching
• This method provide for a greater house-cleaning of the cache and serve to protect a node as well as to make it more efficient
• Neighborhood Watch and Digital signature
• This method allows for greater of dynamic adjustments and autonomous learning methods for the network as a whole, and it prevents against nodes flooding the network with endless streams of trivial data.
OBJECTIVE
• Covert channels are used for the secret transfer of information. Encryption only protects communication from being decoded by un authorized parties, whereas covert channels aim to hide the very existence of the communication
• Initially, covert channels were identified as a security threat on monolithic systems i.e. mainframes.
• This is a survey of the existing techniques for creating covert channels in widely deployed network and application protocols.
ADVANTAGES
• Source routing: no special mechanism needed to eliminate loops.
• It provides secure transfer of information
• A dynamic table changes its information based on network traffic, reducing the amount of manual maintenance.
• On demand routing: Routes maintained only between nodes who need to communicate
• Does not require symmetric links
• Route caching can further reduce route discovery overhead.
CONCLUSION
• Due to the rise in popularity and growing cheapness of wireless and sensor networks, efficient and secure network routing and broadcasting will attract more research projects involving wireless communication.
• In order to meet the demand and ensure safeness, the foundations for secure broadcast and network maintenance must be solidified to pave the way for future wireless network expansion in cell phones, personal computers, and digital entertainment.
• The above mention attempts to bypass network security highlight the need for aggressive security measures in future protocols.
FUTURE WORK
 The focus for these tests will be similar to the simulations performed at The University of Maryland—the success rate of covert channels on the protocol.
 Furthermore, the protection methods against covert channels should be tested to evaluate the decrease in covert throughput, cost/benefit ratios and overhead.
 The overall cooperativeness of the network can also be tested by involving neighborhood nodes into the inference mechanism

Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: etronics easton maryland**r histogram segmentation, seminar project on compositional adaptation, etronics easton maryland***dinamalar annual subscription, conmpositional adaptation pdf, etronics easton maryland, intelligent speed adaptation, compositional adaptation abstract,

[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Vertical Handoff Decision Algorithm Providing Optimized Performance in Heterogeneous Wireless Networks computer science topics 2 30,179 07-10-2016, 09:02 AM
Last Post: ijasti
  Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks seminar surveyer 3 2,816 14-07-2015, 02:24 PM
Last Post: seminar report asees
  Dynamic Synchronous Transfer Mode computer science crazy 3 4,568 19-02-2014, 03:29 AM
Last Post: Guest
  Dynamic programming language seminar projects crazy 2 3,182 03-01-2013, 12:31 PM
Last Post: seminar details
  SEMINAR REPORT on Adaptive Routing in Adhoc Networks Computer Science Clay 2 4,928 02-01-2013, 10:25 AM
Last Post: seminar details
  AN EXTENDED ZONE ROUTING PROTOCOL FOR SERVICE DISCOVERY IN MOBILE AD HOC NETWORKS seminar presentation 1 9,306 24-12-2012, 12:47 PM
Last Post: seminar details
  Enhanced QoS Multicast Routing Protocol nit_cal 1 5,704 20-12-2012, 10:31 AM
Last Post: seminar details
  IP MULTICAST ROUTING project report helper 2 5,898 20-12-2012, 10:31 AM
Last Post: seminar details
  High Performance DSP Architectures computer science crazy 1 8,151 12-12-2012, 12:18 PM
Last Post: seminar details
  Distributed Cache Updating for the Dynamic Source Routing Protocol seminar class 3 2,286 17-11-2012, 01:26 PM
Last Post: seminar details

Forum Jump: