Paper Info
Title
On Using Reputations in Ad hoc Networks to Counter Malicious Nodes
Abstract
Nodes in mobile ad hoc networks have a limited transmissionrange. Hence the nodes expect their neighbors torelay packets meant for far off destinations. These networksare based on the fundamental assumption that if a nodepromises to relay a packet, it will relay it and will not cheat.This assumption becomes invalid when the nodes in the networkhave tangential or contradictory goals.The reputations of the nodes, based on their past historyof relaying packets, can be used by their neighbors to ensurethat the packet will be relayed by the node. This paper introducesa reputation scheme for ad hoc networks. Insteadof choosing the shortest path to the destination, the sourcenode chooses a path whose next hop node has the highestreputation. This policy, when used recursively, in the presenceof 40% malicious nodes, improves the throughput ofthe system to 65%, from 22% throughput provided by AODV.This improvement is obtained at the cost of a higher numberof route discoveries with a minimal increase in the averagehop length.
Year
DOI
Venue
2004
10.1109/ICPADS.2004.57
ICPADS
Keywords
Field
DocType
throughput ofthe system,limited transmissionrange,contradictory goal,counter malicious nodes,shortest path,next hop node,averagehop length,neighbors torelay packet,malicious node,higher numberof route discovery,fundamental assumption,computer science,mobile ad hoc networks,mobile computing,routing protocols,aodv,ad hoc networks,throughput,mobile ad hoc network,history,frame relay,intelligent networks,ad hoc network
Mobile ad hoc network,Ad hoc On-Demand Distance Vector Routing,Computer science,Network packet,Computer network,Optimized Link State Routing Protocol,Throughput,Wireless ad hoc network,Frame Relay,Distributed computing,Routing protocol
Conference
ISBN
Citations 
PageRank 
0-7695-2152-5
28
2.16
References 
Authors
14
3
Name
Order
Citations
PageRank
Prashant Dewan11008.68
Partha Dasgupta229847.40
Amiya Bhattacharya343857.29