Journal of Network and Information Security

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Detection and Elimination of the Selfish Node in Ad-Hoc Network Using Energy Credit Based System


Affiliations
1 Department of Information Science and Engineering, VTU/JNNCE, Shimoga, Karnataka, India
2 Department of Computer Science and Engineering, VTU/JNNCE, Shimoga, Karnataka, India
     

   Subscribe/Renew Journal


Nodes in the wireless Ad-hoc network act as router for forwarding of packet from source to destination. During the forwarding of the packet, energy present in the node is utilized. More energy is spent in transferring the packet than on receiving the packet in the network. Forwarding of the packets is a common activity of the nodes in wireless Ad-hoc network. Packets are dropped by link failure, less bandwidth, collision, etc. Nodes will not forward the packet to its neighbouring node as a result packet drops. This happens due to the presence of selfish nodes in the Ad-hoc network. Selfish nodes preserve their energy for their own utilization. Identification and elimination of the selfish node is done using Energy Based Credit System (EBCS). The routing protocol used is dynamic source routing. The implementation is done on the NS2 simulator. The result is verified for performance parameters like packet delivery ratio, through put, and end-to-end delay.

Keywords

Energy Credit based System, End-to-End Delay, Packet Delivery Rate, Selfish Node, Throughput.
Subscription Login to verify subscription
User
Notifications
Font Size


  • C. E. Jones, K. M. Sivalingam, P. Agrawal, and J. C. Chen, “A survey of energy efficient network protocols for wireless networks”, Wireless Networks, vol. 7, no. 4, pp. 343-358, August, 2001.

  • P. Gupta, and P. R. Kumar, “The capacity of wireless networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, March, 2000.

  • P. Santi, “Topology control in wireless Ad Hoc and sensor networks,” ACM Computing Surveys, vol. 37, no. 2, pp. 164-194, March, 2005.

  • L. Li, J. Y. Halpern, P. Bahl, Y. M. Wang, and R. Wattenhofer, “A cone-based distributed topology-control algorithm for wireless multi-hop networks,” IEEE/ACM Trans. Networking, vol. 13, no. 1, pp. 147-159, February, 2005.

  • R. Ramanathan, and R. Rosales-Hain, “Topology control of multihop wireless networks using transmit power adjustment,” Proc. IEEE INFOCOM 2000, vol. 2, pp. 404-413, March, 2000.

  • N. Li, J. Hou, and L. Sha, “Design and analysis of an MST-based topology control algorithm,” Proc. IEEE INFOCOM 2003, vol. 3, pp. 1702-1712, April, 2003.

  • M. K. H. Yeung, and Y.-K. Kwok, “A game theoretic approach to power aware wireless data access,” IEEE Trans. Mobile Computing, vol. 5, no. 8, pp. 1057-1073, August, 2006.

  • R. S. Komali, and A. B. MacKenzie, “Distributed topology control in ad-hoc networks: A game theoretic perspective,” Proc. Third IEEE Consumer Comm. and Networking Conf. (CCNC ’06), vol. 1, pp. 563-568, January, 2006.

  • J. W. Friedman, and C. Mezzetti, “Learning in games by random sampling,” Journal of Economic Theory, vol. 98, no. 1, pp. 55-84, May, 2001.

  • S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar, “Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol,” Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, pp. 156-162, February, 2002.

  • R. W. Thomas, R. S. Komali, A. B. MacKenzie, and L. DaSilva, “Joint power and channel minimization in topology control: A cognitive network approach,” Proc. ICC CogNet Workshop, 2007.

  • C. Bettstetter, “On the minimum node degree and connectivity of a wireless multihop network,” Proc. ACM MobiHoc 2002, pp. 80-91, June, 2002.

  • S. Gupta, C. K. Nagpal, and C. Singla, ”Impact of selfish node concentration in MANETs,” International Journal of Wireless and Mobile Networks, vol. 3, no 2, April, 2011.

  • D. Koshti, and S. Kamoji, “Comparative study of techniques used for detection of selfish nodes in mobile ad hoc networks,” International Journal of Soft Computing and Engineering, vol. 1, no. 4, September, 2011.

  • M. D. SerratOlmas, J. C. Cano, E. Hernandez-Orallo, and C. T. Calafate, “A fast model for evaluating the detection of selfish nodes using a collaborative approach in MANETs,” Wireless Personal Communications, vol. 74, no. 3, February, 2014.

  • S. J. Nagar, D. G. Raimagia, and P. A. Ghosh, “Identification and elimination of selfish nodes in ad hoc network,” International Journal of Engineering Research and Development, vol. 10, no. 4, pp. 29-34, April, 2014.

  • A. A. Hadi, Z. Mohammad Ali, and Y. Aljeroudi, “Improved selfish node detection algorithm for mobile Ad hoc network,” International Journal of Advanced computer Science and Application, vol. 8, no. 4, 2017.

  • Mohd. A. K. Akhtar, and G. Sahoo, “Mathematical model for the detection of selfish nodes in MANETs,” International Journal of Computer Science and Informatics,” vol. 1, no. 3, 2011.


Abstract Views: 227

PDF Views: 0




  • Detection and Elimination of the Selfish Node in Ad-Hoc Network Using Energy Credit Based System

Abstract Views: 227  |  PDF Views: 0

Authors

Samara Mubeen
Department of Information Science and Engineering, VTU/JNNCE, Shimoga, Karnataka, India
Syyed Johar
Department of Computer Science and Engineering, VTU/JNNCE, Shimoga, Karnataka, India

Abstract


Nodes in the wireless Ad-hoc network act as router for forwarding of packet from source to destination. During the forwarding of the packet, energy present in the node is utilized. More energy is spent in transferring the packet than on receiving the packet in the network. Forwarding of the packets is a common activity of the nodes in wireless Ad-hoc network. Packets are dropped by link failure, less bandwidth, collision, etc. Nodes will not forward the packet to its neighbouring node as a result packet drops. This happens due to the presence of selfish nodes in the Ad-hoc network. Selfish nodes preserve their energy for their own utilization. Identification and elimination of the selfish node is done using Energy Based Credit System (EBCS). The routing protocol used is dynamic source routing. The implementation is done on the NS2 simulator. The result is verified for performance parameters like packet delivery ratio, through put, and end-to-end delay.

Keywords


Energy Credit based System, End-to-End Delay, Packet Delivery Rate, Selfish Node, Throughput.

References