Design of an Agent Based Analysis Approach for Secure Communication Against the Existing of Selfish Node Attack

2019 ◽  
Vol 16 (12) ◽  
pp. 5047-5054
Author(s):  
Sumiti ◽  
Sumit Mittal
Keyword(s):  
Secure Communication ◽  
Network Performance ◽  
Evaluation Method ◽  
Mobile Network ◽  
Packet Delay ◽  
Analysis Approach ◽  
Adaptive Model ◽  
Selfish Nodes ◽  
Agent Based ◽  
Selfish Node

The internal participating nodes in mobile network can be affects fully or partially by selfish nature to improve its own communication rate. This nature can degrade the forwarding rate and affects the overall performance of the network. The detection of such selfish nodes is required to improve the communication throughput and network performance. In this paper, an Agent based analysis approach is defined to detect the selfish node in the network. The fuzzy based zonal analysis method is suggested to perform the zonal evaluation on the mobile network. The distributed Agents performed the analysis on the fuzzy based communication parameters. The parameter specific evaluation method is able to separate the good and selfish nodes. Once the selfish nodes are identified, the preventive route formation is done for safe communication. In this paper, the Agent adaptive model is presented for detection and prevention of selfish nodes. The proposed Agent adaptive model is simulated in NS2 environment. The comparative results are generated against token based, agent based and watchdog methods. The analysis results show that the proposed protocol has achieve the 17% improvement in packet communication, 37% reduction in communication loss and 53ms reduction in packet delay.

Investigating the Analysis of Power Saving Mode in IEEE 802.11 for Wi-Fi Communication

2018 ◽  
Vol 6 (3) ◽  
pp. 13-19
Author(s):  
Isam Aameer Ibrahim ◽  
Haider TH Salim ◽  
Hasan F. Khazaal
Keyword(s):  
Ieee 802.11 ◽  
Network Performance ◽  
Power Saving ◽  
Packet Delay ◽  
Access Point ◽  
Battery Life ◽  
Global Issues ◽  
Time Ratio ◽  
Power Saving Mode ◽  
Saving Mode

One of the major global issues today is energy consumption. Consequently, power management was introduced in various communication technologies. For IEEE 802.11wireless communication, there is a Power Saving Mode scheme (PSM) for increase the battery life of cell phone. In this PSM, there are two key parameters: beacon period interval (BI) and listen interval(LI). In most work these values are chosen arbitrary. Here, a scheme to determine the optimal BI and LI for accomplishing the most astounding conceivable vitality proficiency is introduced. This is implemented with the application of a numerical sample to the standard IEEE 802.11 PSM and Access Point-PSM (AP-PSM) schemes. To ensure the quality of network performance analysis on the normal and change of parcel delays is doing. The well-known queuing (M/G/I) model with bulk services are utilized. After the implementation of the proposed analysis, “maximum rest plan time ratio optimal Sleep Scheme (OSS)” which is when participate stations stay in the doze mode it can be determined. In this research shows that the optimal BI and LI produce optimal OSS time ratio scheme also achieved optimal average and variance of packet delay.

scholarly journals Towards a software-based mobility management for 5G: An experimental approach for flattened network architectures

2020 ◽  
Vol 17 (1) ◽  
pp. 51-70
Author(s):  
Jesús Calle-Cancho ◽  
José-Manuel Mendoza-Rubio ◽  
José-Luis González-Sánchez ◽  
David Cortés-Polo ◽  
Javier Carmona-Murillo
Keyword(s):  
Mobile Networks ◽  
Mobility Management ◽  
Network Performance ◽  
Mobile Network ◽  
Network Control ◽  
Network Services ◽  
Smart Devices ◽  
Network Architectures ◽  
Data Traffic ◽  
Management Capability

The number of mobile subscribers, as well as the data traffic generated by them, is increasing exponentially with the growth of wireless smart devices and the number of network services that they can support. This significant growth is pushing mobile network operators towards new solutions to improve their network performance and efficiency. Thus, the appearance of Software Defined Networking (SDN) can overcome the limitations of current deployments through decoupling the network control plane from the data plane, allowing higher flexibility and programmability to the network. In this context, the process of handling user mobility becomes an essential part of future mobile networks. Taking advantage of the benefits that SDN brings, in this article we present a novel mobility management solution. This proposal avoids the use of IP-IP tunnels and it adds the dynamic flow management capability provided by SDN. In order to analyse performance, an analytical model is developed to compare it with NB-DMM (Network-based DMM), one of the main DMM (Distributed Mobility Management) solutions. Additionally, performance is also evaluated with an experimental testbed. The results allow handover latency in real scenarios and numerical investigations to be measured, and also show that SR-DMM achieves better efficiency in terms of signaling and routing cost than NB-DMM solution.

Antnet Routing Algorithm with Link Evaporation and Multiple Ant Colonies to Overcome Stagnation Problem

2013 ◽  
pp. 255-274
Author(s):  
Firat Tekiner ◽  
Zabih Ghassemlooy
Keyword(s):  
Routing Algorithm ◽  
Packet Delay ◽  
Average Delay ◽  
Ant Colonies ◽  
Feedback Information ◽  
Switched Networks ◽  
Agent Based ◽  
Data Packets ◽  
Reinforcement Parameter ◽  
Distance Vector

Antnet is a software agent-based routing algorithm that is influenced by the unsophisticated and individual ant’s emergent behaviour. The aim of this chapter is twofold, firstly to introduce improvements to the antnet routing algorithm and then to critically review the work that is done around antnet and reinforcement learning in routing applications. In this chapter a modified antnet algorithm for packet-based networks has been proposed, which offers improvement in the throughput and the average delay by detecting and dropping packets routed through the non-optimal routes. The effect of traffic fluctuations has been limited by applying boundaries to the reinforcement parameter. The round trip feedback information supplied by the software agents is reinforced by updated probability entries in the distance vector table. In addition, link usage information is also used to prevent stagnation problems. Also discussed is antnet with multiple ant colonies applied to packet switched networks. Simulation results show that the average delay experienced by data packets is reduced for evaporation for all cases when non-uniform traffic model traffic is used. However, there is no performance gain on the uniform traffic models. In addition, multiple ant colonies are applied to the packet switched networks, and results are compared with the other approaches. Results show that the throughput could be increased when compared to other schemes, but with no gain in the average packet delay time.

scholarly journals A scheme for stimulating message relaying cooperation

2020 ◽  
Vol 16 (2) ◽  
pp. 155014772090703 ◽  
Author(s):  
Haifeng Lin ◽  
Fuquan Zhang
Keyword(s):  
Private Information ◽  
Network Performance ◽  
Threshold Value ◽  
Selfish Nodes ◽  
Relay Nodes ◽  
Selfish Behavior ◽  
Estimation Scheme ◽  
Memory Power ◽  
Intermittent Connection ◽  
Store And Forward

It is expected that all the nodes try their best to store and forward the messages in the intermittent connection network. However, due to the limited resources, such as memory, power, and transient communication chance, selfish nodes may relay the messages without responsibility. Stimulating selfish to behave normally could improve network performance. However, usually, it is difficult to distinguish the selfish behavior from the inability to relaying the message. By monitoring the behavior of relay nodes that messages are forwarding through, this article proposes a scheme that relays messages according to the reputation of intermediate nodes. The proposed reputation estimation scheme combines selfish behavior and inability behavior, and reveals very little private information for the protocol practice. There is a trade-off between the threshold and the performance. Too low value may not distinguish the selfish nodes. On the contrary, some normal nodes may excluded and cannot join the relaying and processing. Simulation effectively demonstrates that the reputation affects the node’s performance, and an appropriate reputation threshold value is useful for improving the network performance.

scholarly journals Characterization and Identification of Cloudified Mobile Network Performance Bottlenecks

2020 ◽  
Vol 17 (4) ◽  
pp. 2567-2583
Author(s):  
Georgios Patounas ◽  
Xenofon Foukas ◽  
Ahmed Elmokashfi ◽  
Mahesh K. Marina
Keyword(s):  
Network Performance ◽  
Mobile Network ◽  
Performance Bottlenecks

Gwet Kappa Reliability Factor-Based Selfish Node Detection Technique for Ensuring Reliable Data Delivery in Mobile Adhoc NETworks

2019 ◽  
Vol 16 (2) ◽  
pp. 489-495
Author(s):  
A. Karthikayen ◽  
Selvakumar S. Raja
Keyword(s):  
Maximum Level ◽  
Mobile Node ◽  
Detection Technique ◽  
Experimental Investigations ◽  
Selfish Nodes ◽  
Mobile Nodes ◽  
Reliability Factor ◽  
Throughput Rate ◽  
Selfish Node ◽  
Adhoc Networks

The degree of packet dissemination among the mobile nodes of the network depends on the reliability of each individual mobile node attributed towards the benefits of the other interacting nodes in forwarding activity. However, the selfish intent of selfish nodes in the network reduces the performance in terms of packet forwarding rate. Thus, the influence of selfish intent in the network need to be minimized to the maximum level by introducing a predominant isolation process. In this paper, a Gwet Kappa Reliability Factor-based Selfish Node Detection Technique (GKRF-SNDT) scheme is proposed for superior detection of selfish nodes in the network. This proposed GKRF-SNDT scheme inherently derives the advantages of Gwet Kappa Reliability Factor for quantifying the degree of trust possessed by each mobile nodes interacting in the network. The experimental investigations of the proposed GKRF-SNDT scheme confirmed a superior throughput rate of 18% with reduced energy consumptions of 21% compared to the existing selfish intent isolation approaches.

scholarly journals Routing Based Multi-Agent System for Network Reliability in the Smart Microgrid

Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2992
Author(s):  
Niharika Singh ◽  
Irraivan Elamvazuthi ◽  
Perumal Nallagownden ◽  
Gobbi Ramasamy ◽  
Ajay Jangra
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Performance Metrics ◽  
Network Reliability ◽  
Operating Conditions ◽  
Multi Agent System ◽  
Agent System ◽  
Agent Based ◽  
Multi Agent ◽  
System Operating

Microgrids help to achieve power balance and energy allocation optimality for the defined load networks. One of the major challenges associated with microgrids is the design and implementation of a suitable communication-control architecture that can coordinate actions with system operating conditions. In this paper, the focus is to enhance the intelligence of microgrid networks using a multi-agent system while validation is carried out using network performance metrics i.e., delay, throughput, jitter, and queuing. Network performance is analyzed for the small, medium and large scale microgrid using Institute of Electrical and Electronics Engineers (IEEE) test systems. In this paper, multi-agent-based Bellman routing (MABR) is proposed where the Bellman–Ford algorithm serves the system operating conditions to command the actions of multiple agents installed over the overlay microgrid network. The proposed agent-based routing focuses on calculating the shortest path to a given destination to improve network quality and communication reliability. The algorithm is defined for the distributed nature of the microgrid for an ideal communication network and for two cases of fault injected to the network. From this model, up to 35%–43.3% improvement was achieved in the network delay performance based on the Constant Bit Rate (CBR) traffic model for microgrids.

Sign in / Sign up

Export Citation Format

Share Document