Shortest path from Source Node 1 to Destination Node 8 from the Dijkstras

Shortest path from source node 1 to destination node

This preview shows page 4 - 6 out of 6 pages.

Shortest path from Source Node 1 to Destination Node 8 from the Dijkstra’s algorithm is given as Shortest path from Source to Destination: 1 2 5 8 In the Figure 3, we have shown which node is fully selfish or partially selfish or non-selfish of the network G given in Figure 1. It is decided by equation (1) comparing with threshold value. Retransmission number can't be zero otherwise it will give the empty detection graph and detection rate is zero. Retransmission number starts from 1 to onwards. IEEE - 33044 5th ICCCNT - 2014 July 11-13, 2014, Hefei, China
Image of page 4
Figure 2: Implementation Result Figure 3: Number of nodes Vs Threshold IEEE - 33044 5th ICCCNT - 2014 July 11-13, 2014, Hefei, China
Image of page 5
6. CONCLUSION The algorithm that we have designed improve the detecting rate in the network .The selfish behavior creates the network failure and degrades the performance of the whole network in the wireless sensor networks due to non- cooperative nature to other nodes. The selfish node timely detection is very important issue for proper management of data communication in the network. The selfish node gives major impact on the network and the network is disrupted. To overcome the problem of selfish node and its behavior in WSN, we have to make the selfish node into cooperative nature for forwarding data packets to other nodes. REFERENCES [1] Shailender Gupta, C. K. Nagpal and CharuSingla, Impact of Selfish node Concentration in MANETs, International Journal of Wireless & Mobile Networks (IJWMN) Vol. 3, No. 2, April, 2011. [2] Jerzy Konorski and Rafa ł Orlikowski, A Framework for Detection of Selfishness in Multihop Mobile Ad Hoc Networks, Journal of Telecommunications & Information Technology , February,2009. [3] Bo Chen, Jian-Lin Mao, NingGuo, Guan-Hua Qiao, Ning Dai, An Incentive Detection Mechanism for cooperation of Nodes Selfish Behavior in Wireless Sensor Network , 25th Chinese Control and Decision Conference (CCDC) , China, 2013. [4] L. M. Sun, J. Z. Li, Y. Chen, H. S. Zhu, Wireless Sensor Networks, Tsinghua University Press , Beijing, China, 2005. [5] Bo Wang, SohraabSoltani, Jonathan K. Shapiro, Pang- Ning Tan, Local Detection of Selfish Routing Behavior in Ad Hoc Networks, IEEE , Oct 2005. [6] K.Indumathi, N.Jayalakshmi, S.Kartiga , Selfish node detection using replica allocation techniques and SCF Tree in MANET, IJARET , Mar 2013. [7] Majid Ahmad,Durgesh Kumar Mishra, Critical Node Detection in Large Scale Mobile Ad hoc Networks, International Journal of Computer Applications , Nov 2013. [8] Y. Yoo and D.P. Agrawal, “Why Does It Pay to be Selfish in a MANET,” IEEE Wireless Communication ., Volume. 13, No. 6, December. 2006 [9] Jae-Ho Choi Kyu-Sun Shim, Sang Keun Lee, and Kun- Lung Wu, Fellow, “Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network ” IEEE Transaction on Mobile Computing , Volume 11, No.2, February 2012. [10] S. Buchegger, J. Y. Le Boudec, Performance Analysis of the CONFIDANT Protocol (Cooperation of Nodes: Fairness in Dynamic Ad-hoc Networks), Proceedings of 3rd ACM International Sysposium on Mobile Ad Hoc Networking and Computing , 2002. IEEE - 33044 5th ICCCNT - 2014 July 11-13, 2014, Hefei, China
Image of page 6

You've reached the end of your free preview.

Want to read all 6 pages?

  • Fall '19
  • Sensor node, Wireless sensor network, Selfish Node Detection, Critical Node

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture