Trusted secure routing for ad hoc networks

Authors:
Nima Haghpanah;Masoud Akhoondi;Mehdi Kargar;Ali Movaghar
Affiliations:
Sharif University of Technology, Tehran, Iran;Sharif University of Technology, Tehran, Iran;Sharif University of Technology, Tehran, Iran;Sharif University of Technology, Tehran, Iran
Venue:
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
Year:
2007

Citing 4
Cited 2

Self-Securing Ad Hoc Wireless Networks

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Proceedings of the 9th annual international conference on Mobile computing and networking
A secure incentive architecture for ad hoc networks: Research Articles

Wireless Communications & Mobile Computing - Wireless Network Security
Towards designing a trusted routing solution in mobile ad hoc networks

Mobile Networks and Applications

A security management scheme using a novel computational reputation model for wireless and mobile ad hoc networks

Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
SEAODV: secure efficient AODV routing protocol for MANETs networks

Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cooperation among nodes is vital in Mobil Ac Hoc Networks (MANETs) since in such networks nodes depend on each other for forwarding and routing packets. However, cooperation in such operations consumes nodes' recourses such as battery and bandwidth. Therefore it is necessary to design incentive mechanisms to enforce nodes to forward packets when the source and destination of the packet are other nodes. In this paper, we present a distributed fair solution to judge, punish and re-admit a selfish node, forcing nodes to cooperate with each other. Our scheme is different from previous ones in that it combines two characteristics that have been separately handled in previous works. The first characteristic is fairness of reputation system regarding position of nodes in the network and the second one is the ability to cope with false reputation information distributed by malicious nodes. Unlike previous fair solutions, this scheme can cope with false disseminated information. We propose a new scheme to manage both trust and reputation based on global information, considering thefact that it is to be designed for a fair reputation system. The experimental results suggest that the proposed scheme can successfully identify selfish and malicious nodes and react accordingly.