GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
A Reputation-based Mechanism for Isolating Selfish Nodes in Ad Hoc Networks
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
An Efficient Scheme to Motivate Cooperation in Mobile Ad hoc Networks
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Hi-index | 0.00 |
In wireless AdHoc networks, all its nodes behave as routers and take part in its discovery and maintenance of routs to other nodes. Therefore, the cooperation of nodes is very important. With presence of selfish or malicious nodes the performance of the network may greatly degrade. In order to enforce the cooperation between the nodes in the system many cooperation schemes have been proposed. This paper analyzes the typical cooperation schemes and then presents an efficient reputation-based mechanism to enforce cooperation in MANET. This approach also is based on constantly monitoring and updating first-hand and second-hand information. The nodes with in the network are able to monitor their neighbors and obtain the first-hand information based on the perceived behavior, second-hand information is obtained from the sharing of first-hand information with other nodes. The total reputation value is a function of first-hand and second-hand information. The simulation results show that in comparison with other suggested approach such as CONFIDANT approach, in the proposed approach the number of dropped packet is reduced. Also according to the simulation results it has a considerably lower overhead in spite of preserving the efficiency of network.