ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Communications
Volume 31, Issue 4, 5 March 2008, Pages 760-769
Algorithmic and Theoretical Aspects of Wireless ad hoc and Sensor Networks
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (341 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2007.10.021    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Security in mobile ad-hoc networks using soft encryption and trust-based multi-path routing

Prayag Narulaa, E-mail The Corresponding Author, Sanjay Kumar Dhurandhera, Corresponding Author Contact Information, E-mail The Corresponding Author, Sudip Misrab, E-mail The Corresponding Author and Isaac Woungangc, E-mail The Corresponding Author

aDivision of Information Technology, Netaji Subhas Institute of Technology, University of Delhi, India bDepartment of Computer Science, Yale University, New Haven, CT, USA cDepartment of Computer Science, Ryerson University, Toronto, Ont., Canada

Available online 22 October 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Due to their applications in situations such as emergencies, crisis management, military and healthcare, message security is of paramount importance in mobile ad-hoc networks. However, because of the absence of a fixed infrastructure with designated centralized access points, implementation of hard-cryptographic security is a challenging prospect.

In this paper, we propose a novel method of message security using trust-based multi-path routing. Less trusted nodes are given lower number of self-encrypted parts of a message, making it difficult for malicious nodes to gain access to the minimum information required to break through the encryption strategy. Using trust levels, we make multi-path routing flexible enough to be usable in networks with ‘vital’ nodes and absence of necessary redundancy. In addition, using trust levels, we avoid non-trusted routes that may use brute force attacks and may decrypt messages if enough parts of the message are available to them. Simulation results, coupled with theoretical justification, affirm that the proposed solution is much more secured than the traditional multi-path routing algorithms.

Keywords: MANETs; Multi-path; Trust; Encryption

Article Outline

1. Introduction
2. Previous works
2.1. Payment systems
2.1.1. Limitations of payment systems
2.2. Reputation systems
2.2.1. Limitations of reputation systems
2.3. Cryptographic methods
2.3.1. Limitations of cryptographic methods
3. Motivation
3.1. Message encryption
3.2. Trust establishment
4. Proposed routing strategy
4.1. Trust
4.2. Trust levels assignment
4.3. Message encryption and routing
4.4. Trust defined strategy
4.5. Implementation using DSR
4.6. Route selection
5. Simulation and results
5.1. Set up
5.2. Parameters
5.3. Results
6. Conclusions
References








Computer Communications
Volume 31, Issue 4, 5 March 2008, Pages 760-769
Algorithmic and Theoretical Aspects of Wireless ad hoc and Sensor Networks
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.