Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ucin982169866.pdf (267.08 KB)

ETD Abstract Container

Abstract Header

SECURED ROUTING PROTOCOL FOR AD HOC NETWORKS

Venkatraman, Lakshmi
http://rave.ohiolink.edu/etdc/view?acc_num=ucin982169866

Abstract Details

2001, MS, University of Cincinnati, Engineering : Computer Science.
In this thesis, we have analyzed the threats to the routing protocols in ad hoc wireless networks and have put forth methods to enhance secure routing. Mobile ad hoc networking is a new emerging field with its potential applications in extremely unpredictable and dynamic environments. Due to such characteristics, these networks have much harder security requirements than the traditional, wired and static Internet. Efficient and effective routing in such networks is an especially hard task to accomplish securely, robustly and efficiently at the same time. One of the most severe threats to routing in such networks is the possibility of compromised nodes, which inflict unpredictable and undetectable Byzantine failures. The contemporary routing protocols do seem to manage the dynamically changing conditions rather well. In contrary, they offer either no security mechanisms at all, or have only partial solutions for protecting the routing. We believe that security schemes should be integrated with the routing protocols because the kinds of attacks and their solutions would differ from one protocol to another. Moreover, the imple-mentation will be optimal if it is designed for a specific protocol. We have presented a scheme for reactive routing protocols, specifically AODV, that performs the dual functions of preventing external attacks and also detecting compromised nodes. External attacks are prevented by means of authentication techniques that rely on mutual trust between nodes. We have also minimized the overhead involved in authentication. We have identified various forms of misbehaviors and have proposed solutions for certain deterministic ones. When either form of attack is detected, the system responds suitably to negate the effect of these attacks and also prevent future threats from the same nodes. Besides routing security, we have studied the issue of data authentication for hierarchical ad hoc networks and have proposed a data authentication scheme. In our scheme each cluster head acts as the certification authority for its cluster members.
Dharma Agrawal (Advisor)
76 p.
AODV; Authentication; Routing-table consistency; Heirararchical; Replay

Recommended Citations

Citations

  • Venkatraman, L. (2001). SECURED ROUTING PROTOCOL FOR AD HOC NETWORKS [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin982169866

    APA Style (7th edition)

  • Venkatraman, Lakshmi. SECURED ROUTING PROTOCOL FOR AD HOC NETWORKS. 2001. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin982169866.

    MLA Style (8th edition)

  • Venkatraman, Lakshmi. "SECURED ROUTING PROTOCOL FOR AD HOC NETWORKS." Master's thesis, University of Cincinnati, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin982169866

    Chicago Manual of Style (17th edition)

ucin982169866
1,529
© 2001, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.