Mobile Ad hoc Network (MANET) is infrastructure less, dynamic, decentralized network of wireless mobile nodes. Although MANET is very much useful but it suffers from different security issues. Dropping packets by selfish nodes is one of them. Presence of selfish nodes in MANET may damage the entire communication system. So, it is highly required to detect those selfish nodes and promote cooperation in MANET. Here, a new game theoretic scheme has been proposed for selfish node detection in MANET. Besides detection of selfish nodes, using Least Total Cost Factor (LTCF), data packets will be transmitted from source to destination node through least cost path only. Due to the presence of selfish nodes in the network, if a path has been broken, then the next best path will be automatically selected for data transmission. So, this scheme guarantees secure low cost data transfer and smallest amount of idle time.
