Finding of selfish nodes and irrational nodes in multihop cellular network using CRC and hash chain mechanism

When we use multihop cellular network to transmit the data, the main problem is faulty nodes ands and selfish nodes. We can avoid the faulty nodes by using appropriate firewalls at the sender side and receiver side. The selfish nodes are avoid by charging the source and destination nodes when both of them benefit from the communication and it can secure the payment, charge the source and destination nodes almost computationally free, and significantly reduce the number of generated and submitted checks. In this way, each intermediate node earns some credits and the destination node pays the total packet relaying cost. To implement this charging policy efficiently, hashing operations are used in the ACK packets to reduce the number of public-key-cryptography operations. Moreover, reducing the overhead of the payment checks is essential for the efficient implementation of the incentive mechanism due to the large number of payment transactions.