Selfish node detection in ad hoc networks based on fuzzy logic
- 97 Downloads
Generally, the ad hoc networks work correctly only if all nodes cooperate in the routing and forwarding of the packets. However, in some cases, selfish nodes are hesitated to share the resources with their neighbors and attempt to preserve their own assets, since splitting nodes into two distinct groups including absolute cooperator and absolute selfish and avoiding the selfish nodes group in network activities will be degraded network quality of service. In this paper, we propose a novel fuzzy-based selfish node detection approach for ad hoc networks that operates based on the social network principles. In the social-based proposed approach, the nodes’ status will be determined by three variables, i.e., hop count (H.C.), residual energy (Re-En.), and cooperation history (Co-h.), through fuzzy interface process to prevent the isolating of the likely selfish nodes from the network and maintain more active node in the network as possible. The MobEmu tool is used to evaluate the effectiveness of the proposed approach in terms of the hit rate, delivery latency, delivery cost, and average hop count. The simulation results reveal that the proposed approach has a significant improvement in contrast to counterparts using UPB 2011 and UPB 2012 traces.
KeywordsAd hoc networks Selfish nodes Fuzzy logic Fuzzy interface process Cooperation
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- 3.Gandhi C, Arya V (2014) A survey of energy-aware routing protocols and mechanisms for mobile ad hoc networks. Springer, New Delhi, pp 111–117Google Scholar
- 8.Kumar S, Dutta K, Sharma G (2016) A detailed survey on selfish node detection techniques for mobile ad hoc networks. In: 2016 Fourth international conference on parallel, distributed and grid computing. IEEE, pp 122–127Google Scholar
- 18.Samian N, Seah WKG, Zukarnain ZA et al (2016) Recharge-as-Reward mechanism to incentivize cooperative nodes in mobile ad hoc networks. In: 2016 IEEE 41st conference on local computer networks. IEEE, pp 535–538Google Scholar
- 20.Bigwood G, Henderson T (2011) IRONMAN: using social networks to add incentives and reputation to opportunistic networks. In: 2011 IEEE third international conference on privacy, security, risk and trust (PASSAT) and 2011 IEEE third international conference on social computing (SocialCom). IEEE, pp 65–72Google Scholar
- 33.Ciobanu RI, Dobre C, Cristea V, Al-Jumeily D (2012) Social aspects for opportunistic communication. In: 2012 11th International symposium on parallel and distributed computing. IEEE, pp 251–258Google Scholar
- 34.Firdose S, Lopes L, Moreira W et al (2017) CRAWDAD dataset copelabs/usense (v. 2017-01-27). https://doi.org/10.15783/c7d885