Trust based adaptive on demand ad hoc routing protocol

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 infor...

• Type: Conference
• Year: 2004
• Where: ACMSE
• Authors: Rajiv K. Nekkanti, Chung-wei Lee
• Keywords: ACMSE 2004, Routing, Routing Information, Routing Protocol, Theoretical Computer Science