survey of different techniques for detecting selfish nodes in manets

In mobile ad-hoc networks (manets), each node is free to move and connect over a wireless connection, without the requirement for a centralized controller or base station. these features make manet use- ful and functional in a variety of areas, including tactical situations, sensor networks, and rescue operations. however, this type of network also has a range of issues such as security, quality of service, dynamic topology, scalability, the absence of central management, and energy consumption. in manets, some of the nodes do not take part in forwarding packets to other nodes to conserve their resources such as energy, bandwidth, and power. the nodes which act sel shly to conserve their resources are called sel sh nodes. in recent years, mobile ad hoc networks have become a very popular research topic. in this paper, we classi ed techniques for detecting sel sh nodes in 4 categories namely reputation-based scheme, credit-based scheme, acknowledgment-based scheme, and game-theoretic scheme. then we mentioned di erent methods available for reducing the e ect of sel sh nodes in mobile ad hoc networks. finally tables 1 and 2 show the comparison of techniques for detecting sel sh nodes.