Credit Risk and Self-Friendship tree techniques for Greedy node detection and correction in Wireless Sensor Network using ns-2

In Wireless Sensor Network 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 selfishly to conserve their resources are called selfish nodes. The selfish nodes are engaged to reduce data availability and produce high communication cost in terms of query processing. Many greedy node detection methods are found to detect the nodes which do not participate in packet forwarding but they fail to detect the selfish nodes which does not allocate replica for the purpose of other nodes. This review paper provides methods to detect greedy nodes in terms of allocating replica to other nodes. The methods are categorized according to detect the greedy nodes and reduce the impact of that nodes in Wireless Sensor Network. It also discusses the key features of greedy nodes and numerous replica allocation techniques. The introduction of new replica allocation techniques will considerably reduce the delay in query processing and produce high data availability. In this paper the author will implement the greedy node detection and correction technique using the ns-2 simulator.