A comprehensive approach to avoid node selfishness and data redundancy

Abstract

Delay Tolerant Network (DTN) is an array of protocols which work together to enable a standardized way to communicate between nodes is store-carry-and-forward approach. In DTN, nodes help to convey message even with connectivity problem. Instead of using the own resource to pass a message to other nodes, a relay node is preferred which discovers the sink node with a greater probability of transferring messages on its own. A condition named node’s selfishness is thus raised and it surely degrades network performance, which is more obvious in urban environment. To handle such problem, an incentive-based routing algorithm is generated by using the concept Selfishness-Enhanced Reliable Forwarding (SERF) to remove node selfishness and Direct Diffusion to omit duplicate messages present in relay node. This algorithm finds the probability of messages received by the relay node with reference to the usage of resources of sender node. Concurrently, buffer management policy is maintained, by setting the threshold of message copies according to the resource consumption of the source node when it generates a message. The result reveals that the proposed algorithm is better to the existing algorithms with regard to the performance metrics such as, delivery ratio, the average delay, and network overhead.