Reputed authenticated routing for ad hoc networks protocol (reputed-ARAN)
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Modified AODV protocol for prevention of denial of service attacks in wireless ad hoc networks
AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
Authenticated routing for ad hoc networks protocol and misbehaving nodes
TELE-INFO'05 Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics
Fair Reputation Evaluating Protocol for Mobile Ad Hoc Network
Computational Intelligence and Security
Improving the reliability of ad-hoc on demand distance vector protocol
WSEAS TRANSACTIONS on COMMUNICATIONS
Mitigating routing vulnerabilities in ad hoc networks using reputations
International Journal of Information and Computer Security
Proceedings of the 2009 International Conference on Hybrid Information Technology
Reliable and energy-efficient routing in mobile ad hoc networks
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
The controversy of selfish nodes in ad hoc networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
COSR: a reputation-based secure route protocol in MANET
EURASIP Journal on Wireless Communications and Networking - Special issue on multimedia communications over next generation wireless networks
| Hi-index | 0.00 |
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.