Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Mubeen, Samara
- Isolating Selfish Nodes and Analyzing Performance of Ad-Hoc Network Using Perfect Information Game Theory
Abstract Views :160 |
PDF Views:0
Authors
Affiliations
1 Department of Information Science and Engineering, J.N.N. College of Engineering, Shimoga, Karnataka, IN
1 Department of Information Science and Engineering, J.N.N. College of Engineering, Shimoga, Karnataka, IN
Source
International Journal of Knowledge Based Computer System, Vol 6, No 2 (2018), Pagination: 31-37Abstract
Base stations are not required for the flow of information between different nodes. Nodes spontaneously get connected for transfer of information in the Ad-hoc network. Energy is the important resource used in the transfer of information from the one node to the other node. To preserve the energy, the nodes behave selfishly. These selfish nodes will stop the forwarding the information to the next node in the network by which the performance of the entire network degrades. To identify selfish nodes and isolate them from the network, perfect information game theory is used. Performance of the network is found out with and without using game theory approach for static and dynamic Ad-hoc network. The parameters considered to measure performance are throughput and End-to-End delay. Ns2 simulator is used for implementation.Keywords
End-to-End Delay, Energy, Ns2 Simulator, Packet Delivery Ratio, Perfect Information Game Theory, Selfish Nodes.
References
- P. Patil, “Good neighbour node detection technique in Manets using QOS GNDA,” International Journal of Innovative Research in Engineering and Management (IJIREM), vol. 2, no. 3, pp. 43-48, May 2015.
- C. E. Perkins, and E. M. Royer, “Ad-hoc on demand distance vector routing,” Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90-100, IEEE, 1999.
- U. Singh, B. V. R. Reddy, and M. N. Hoda, “GNDA: Detecting good neighbor nodes in Adhoc routing protocol,” Second International Conference on Emerging Applications of Information Technology (EAIT), pp. 235-238, IEEE, 2011.
- T. R. Reddy, and N. Sobharani, “Selective on-demand protocol for finding reliable nodes to form stable paths in ADHOC networks,” International Journal of Advanced Research in Computer Engineering and Technology (IJARCET), vol. 1, no. 5, pp. 21-24, 2012.
- S. Gupta, C. K. Nagpal, and C. Singla, “Impact of selfish node concentration in MANETs,” International Journal of Wireless and Mobile Networks (IJWMN), vol. 3, no. 2, pp. 29-37, April 2011.
- R. S. Komali, A. B. MacKenzie, and R. P. Gilles, “Effect of selfish node behavior on efficient topology design,” IEEE Transactions on Mobile Computing, vol. 7, no. 9, pp. 1057-1070, September 2008.
- Md. A. K. Akhtar, and G. Sahoo, “Mathematical model for the detection of selfish nodes in MANETs,” International Journal of Computer Science and Informatics (IJCSI), vol. 1, no. 3, pp. 25-28, n.d.
- G. Soni, and K. Chandravanshi, “A nobel defence scheme against selfish node attack in MANET,” International Journal on Computational Science and Applications (IJCSA), 2013. Available: arXiv:1307.3638
- T. V. P. Sundararajan, and A. Shanmugam, “Performance analysis of selfish node aware routing protocol for mobile ad hoc networks,” Computer Networks and Internet Research Journal, vol. 9, no. 1, pp. 1-9, Delaware, USA, July 2009.
- S. Zhong, J. Chen, and Y. R. Yang, “Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks,” Proc. INFOCOM, March-April 2003.
- Performance Analysis of AODV and DSR Routing Protocols in Mobile Ad-Hoc Network
Abstract Views :252 |
PDF Views:0
Authors
Affiliations
1 Assistant Professor, Department of IS&E, JNNCE, Shimoga, Karnataka, IN
2 Student, Department of IS&E, JNNCE, Shimoga, Karnataka, IN
1 Assistant Professor, Department of IS&E, JNNCE, Shimoga, Karnataka, IN
2 Student, Department of IS&E, JNNCE, Shimoga, Karnataka, IN
Source
International Journal of Knowledge Based Computer System, Vol 7, No 2 (2019), Pagination: 8-13Abstract
The Mobile Ad-Hoc Networks (MANET) technology is a self-organized wireless interconnection of communication devices without the use of any fixed network infrastructure/backbone. The performance of Ad-hoc on-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocol is two MANET protocol. Selecting an appropriate routing protocol for steering data packet is a very important issue to evaluate the performance of wireless mobile ad-hoc networks (MANET). In order to guarantee an optimum use of these protocols, we need to test different routing protocols performances. This paper presents the performance analysis comparison of ad-hoc on-demand routing protocol (AODV) and Dynamic Source Routing (DSR) under different performance metrics like throughput, packet drop rate and end-to-end delay. Efficiency achieved by the AODV protocol is higher than DSR protocol in mobile ad-hoc networks. The simulation is done in Network Simulator (NS) 2.Keywords
AODV, DSR, Mobile Ad-hoc Networks, NS2 Simulator, Performance, Routing Protocol.- Find_S Algorithm: To Detect Node Behaviour in Ad Hoc Network
Abstract Views :175 |
PDF Views:0
Authors
Affiliations
1 Assistant Professor, Department of IS&E, Jawaharlal Nehru National College of Engineering, Shivamogga, Karnataka, IN
1 Assistant Professor, Department of IS&E, Jawaharlal Nehru National College of Engineering, Shivamogga, Karnataka, IN
Source
International Journal of Knowledge Based Computer System, Vol 10, No 1 (2022), Pagination: 10-16Abstract
As humans have different behaviour good and bad. Some of the behaviour the human has kind, selfish, cooperative, uncooperative, gentle, soft hearted, back biting, jealous etc. Similarly, nodes in the Ad Hoc network have different behaviour like selfish nodes, regular nodes, malicious nodes etc. Transferring the information from the source node to the destination node via intermediate nodes is done using different routing algorithms. Routing algorithms find out the optimal path to reach the destination. They fail to identify the behaviour of the nodes when transferring the information. Identification of the nodes whether they are good or bad is a difficult task. In this paper different dataset having different behaviour are collected. Find_S algorithm is used to analyze the dataset and give the correct hypothesis as output. The hypothesis consists of different attributes like nature of the agent, energy level, type of agent, and finally, is the decision of the node.Keywords
Dataset, Find_S Algorithm, Node Behaviour, Regular Node, Selfish NodeReferences
- Mohd. A. A. Al-Jaoufi, Y. Liu, Z.-J. Zhang, and L. Uden, “Study on selfish node incentive mechanism with a forward game node in wireless sensor networks,” International Journal of Antennas and Propagation, vol. 2017, 2017.
- E. Hern´andez-Orallo, M. D. Serrat, J.-C. Cano, C. T. Calafate, and P. Manzoni, “Improving selfish node detection in MANETs using a collaborative watchdog,” IEEE Communications Letters, vol. 16, no. 5, pp. 642-645, May 2012, doi: 10.1109/ LCOMM.2012.030912.112482.
- S. Buchegger, and J.-Y. Le Boudec, “Self-policing mobile ad-hoc networks by reputation systems,” in National Competence Center in Research on Mobile Information and Communication Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS).
- Neenavath, and B. T. Krishna, “Selfish node detection IDSM based approach using individual master cluster node,” in 2nd International Conference on Inventive Systems and Control, 2018.
- S. Gupta, C. K. Nagpal, and C. Singla, “Impact of selfish node concentration,” International Journal of Wireless & Mobile Networks, vol. 3, no. 2, Apr. 2011.
- N. K. Gupta, A. K. Sharma, and A. Gupta, “Selfish behaviour prevention and detection in mobile adhoc network using intrusion prevention system (IPS),” International Journal of Research Review in Engineering Science and Technology, vol. 1, no. 2, pp. 31-34, Sep. 2012.
- A. Al Sharah, Mohd. Alhaj, and Mohd. Hassan, “Selfish dynamic punishment scheme: Misbehavior detection in MANETs using cooperative repeated game,” International Journal of Computer Science and Network Security, vol. 20, no. 3, pp. 158-173, Mar. 2020.
- V. U. Raut, and M. S. Mahindrakar, “A comprehensive survey on intrusion detection in MANET,” International Journal of Information Technology and Knowledge Management, vol. 2, no. 2, pp. 305-310, Jul.-Dec. 2010.
- S. Yi, P. Naldurg, and R. Kravets, “Security-aware ad hoc routing for wireless networks,” in Proceedings of ACM MOBIHOC, Oct. 2001, pp. 299-302.
- Y.-C. Hu, D. B. Johnson, and A. Perrig, “SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks,” in Proceedings of the 4th IEEE Workshop on Mobile Computing Systems and Applications, Callicoon, NY, Jun. 2002, pp. 3-13.
- K. Sanzgiti, B. Dahill, B. N. Levine, L. Y. Clay, S. Elizabeth, and M. Belding-Royer, “A secure routing
- protocol for ad hoc networks,” in Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP’ 02), Nov. 2002, pp. 78-87.
- Z. Alfawaer, and S. Al Zoubi, “A proposed security subsystem for ad hoc networks,” International Forum
- on Computer Science Technology and Applications, IEEE, 2009.