Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The controversy of selfish nodes in ad hoc networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Recognizing exponential inter-contact time in VANETs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Black-hole attacks in P2P mobile networks discovered through Bayesian filters
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems
Advanced detection of selfish or malicious nodes in ad hoc networks
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
Self-policing mobile ad hoc networks by reputation systems
IEEE Communications Magazine
| Hi-index | 0.00 |
Mobile ad-hoc networks (MANETs) rely on network cooperation schemes to work properly. Nevertheless, if nodes have a selfish behaviour and are unwilling to cooperate, the overall network performance could be seriously affected. The use of watchdogs is a well-known mechanism to detect selfish nodes. In this paper we propose a collaborative watchdog approach, which is based on the fast diffusion of selfish nodes awareness. Then, we introduce an analytical model to evaluate the time of detection and the overhead (number of messages) of our collaborative watchdog approach for detecting one selfish node. This model is extended for the case of several selfish nodes, including a mean---max approximation for a feasible computation when the number of selfish nodes is high. The results show that a collaborative watchdog is a very efficient approach since the detection time of selfish nodes is reduced, and the overall overhead is very low.