ACM Home Page
Please provide us with feedback. Feedback
Trust based adaptive on demand ad hoc routing protocol
Full text PdfPdf (283 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 42nd annual Southeast regional conference table of contents
Huntsville, Alabama
SESSION: Networking table of contents
Pages: 88 - 93  
Year of Publication: 2004
ISBN:1-58113-870-9
Authors
Rajiv K. Nekkanti  Auburn University, Auburn, Alabama
Chung-wei Lee  Auburn University, Auburn, Alabama
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 61,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/986537.986558
What is a DOI?

ABSTRACT

In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already proposed, they are not efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every bit of routing information they pass from one intermediate node to another in the routing path. This consumes lot of energy/power as well as time. Our routing algorithm basically behaves depending upon the trust one node has on its neighbor. The trust factor and the level of security assigned to the information flow decide what level of encryption is applied to the current routing information at a source/intermediate node. In other words, above a certain level of trust level, there is no need for the source/intermediate node to perform high level encryption on the routing information as it completely trusts the neighboring node. So based on level of trust factor, the routing information will be low-level, medium level, high level encrypted, the low-level being normal AODV. This not only saves the node's power by avoiding unnecessary encoding, but also in terms of time, which is very much valuable in cases of emergencies where the information is as valuable as the time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
NS-2 with Wireless and Mobility Extensions, available via website <u>http://www.monarch.cs.cmu.edu</u>
 
2
<u>http://moment.cs.ucsb.edu/AODV/aodv.html</u>
 
3
S. J. Lee, M. Gerla and C. K Toh. A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Netwroks, IEEE Network, Jul. 1999
4
 
5
 
6
Onion Routing, <u>http://www.onion-router.net/</u>
 
7
P. Papadimitratos and Z. Haas. Secure Routing for Mobile Ad Hoc Networks. Ins SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), 2002.
 
8
 
9
L. Zhou and Z. Hass. Securing Ad Hoc Networks. IEEE Network Magazine, 13(6), November, December 1999.
10
 
11
S. Zhu, S. Xu, S. Setia, S. Jajodia. LHAP: A Lightweight Hop-by-Hop Authentication Protocol for Ad-Hoc Networks. George Mason University and University of California at Irvine.
 
12
Marina Dupcinov, Srdjan Krco. Routing in ad hoc Networks, Technical Report, Applied Research Lab, EEI, Ericsson, Ireland, 2002.
 
13
David B. Johnson, David A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, 1996.
14
15
16
17


Collaborative Colleagues:
Rajiv K. Nekkanti: colleagues
Chung-wei Lee: colleagues

Peer to Peer - Readers of this Article have also read: