Efficient pre-authentication scheme for inter-ASN handover in high mobility MANET

Priya, M. Deva; Janakiraman, S.; Sandhya, G.; Aishwaryalakshmi, G.

doi:10.1007/s11276-019-02185-2

Cited by 6 publications

(8 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The simulation time used for implementing the proposed BPFI‐POR scheme is 11.04 min. The number of sources and destination pairs considered for establishing direct interaction between one another is 40 23‐25 . The cooperation degree set to each mobile node during the start of simulation is 1.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

Bipolar fuzzy information‐based PROMETHEE‐based outranking scheme for mitigating vampire attack in wireless sensor networks

Arunachalam

Perumal

2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The sensor nodes comprising sensing devices, small processing units, and battery, cooperate in wireless sensor networks (WSNs) for gathering potential factors that aids in achieving significant decision‐making processes in deployed applications. WSNs are vulnerable to security threats due to their open nature, availability characteristics, and lack of energy, resulting in a diversified number of security attacks. Among the security attacks, vampire attack is the serious threat as they drain the energy of nodes, which in turn crumbles the network lifetime and energy stability in WSNs. In this article, Bi‐Polar Information‐Based Preference Ranking Organization Method for Enrichment of Evaluations (PROMETHEE)‐based outranking scheme is proposed for detecting and isolating vampire attacks to improve throughput with minimized energy consumptions and delay for prolonging lifetime. This proposed BPFI‐POR scheme used bipolar information that facilitates an asymmetrical association between two decision making factors that influences the discrimination and selection of genuine nodes from vampire nodes during the routing process. It aids in characterizing precise and vague information through bipolar fuzzy linguistic terms that has the maximized probability of being represented as trapezoidal bipolar fuzzy numbers. It estimated the cooperation of intermediate sensor nodes' based on trapezoidal bipolar fuzzy numbers for determining their preference or selection using criteria that could be influenced during the routing process. It also used the ranking function for accessing the alternatives through crisp real preferences with entropy weighting information responsible for attributes weight computation. The simulation results of the BPFI‐POR scheme confirmed better throughput, detection time with minimized energy consumptions and latency on par with the competitive algorithms.

show abstract

Section: Simulation Results and Discussionmentioning

confidence: 99%

Bipolar fuzzy information‐based PROMETHEE‐based outranking scheme for mitigating vampire attack in wireless sensor networks

Arunachalam

Perumal

2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…fd pos (t + 1) = V fd (t + 1) × Rt fd (t + 1) + 1 2 Acc fd (t + 1) × (Rt fd (t + 1)) 2 (17) Furthermore, the acceleration of the cluster heads (Acc dg (t + 1)) and its associated cluster members (Acc sh (t + 1)) is updated based on Equations ( 18) and (19).…”

Section: Eyeing Phasementioning

confidence: 99%

“…Step 36: Update the cluster vehicular node members population based on Equation ( 15), ( 16) and (17) Step 37: While i > k and i ≤ n do…”

Section: Algorithm 1 Bcoa-based Intelligent Clusteringmentioning

confidence: 99%

“…As a consequence, the mathematical optimization methods were identified to be highly unproductive in handling real world problems 16 . The population‐based algorithms are generally focused on randomization and possess two vital stages such as exploration and exploitation for determining optimal results 17,18 . A Border Collie optimization algorithm (BCOA) was developed based on the inspiration derived from the sheep herding styles of Border Collie dogs 19 .…”

Section: Introductionmentioning

confidence: 99%

“…16 The population-based algorithms are generally focused on randomization and possess two vital stages such as exploration and exploitation for determining optimal results. 17,18 A Border Collie optimization algorithm (BCOA) was developed based on the inspiration derived from the sheep herding styles of Border Collie dogs. 19 The herding styles of Border Collie dogs are unique and they track the sheep by leading from the front and on the left and right directions.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Border Collie optimization algorithm‐based node clustering technique in vehicular ad hoc networks

Godi¹,

Janakiraman²

2022

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

In vehicular ad hoc networks (VANETs), the nodes are vehicles and these vehicles communicate with one another on the road. The vehicular nodes on the road move continuously and it introduces dynamic changes in the topology of the network. When the node density in the vehicular network is high, then it is still more challenging as these situations introduce different challenges for network scalability and hurdles the process of determining an optimal route in the vehicular network. At this juncture, clustering protocols are often utilized for resolving the issue of network scalability and the factors that hinders process of identifying optimal routes in vehicular network. In this article, Border Collie optimization algorithm‐based node clustering technique (BCOA‐NCT) is proposed for achieving optimal cluster head selection that minimizes network overhead in uncertain node density situations. This BCOA‐NCT is proposed for facilitating equal concentration on both exploitation and exploration during the process of clustering. It utilized the strategy of eyeing for preventing the algorithm from being stuck into local optima during the cluster head selection process. The simulation experiments of the proposed BCOA‐NCT and the benchmarked schemes confirmed better throughput of 6.19%, minimized end‐to‐end delay of 7.24%, reduced mean energy consumptions of 6.89%, and reduction in the number of beacon messages utilized by 8.26% under the impact of different density of vehicular node. The outcome of the results indicated that the proposed BCOA‐NCT on par with the baseline approaches is capable enough in handling the issue of scalability and better estimation of optimal routes under the increase of node density in the vehicular network.

show abstract

Chew's first Delaunay triangulation refinement scheme‐based positioning of road side units for optimal network coverage in vehicular ad‐hoc networks

Selvakumari¹,

Lakshmi²,

Sheela

et al. 2022

Int J Communication

View full text Add to dashboard Cite

Summary The temporal network fragmentation and uncertain vehicle mobility are considered to impact the communication connectivity among the vehicular nodes of the network. In this context, road side units (RSUs) play an anchor role in enhancing the vehicle‐to‐vehicle (V2V) communication connectivity and support vehicle‐to‐infrastructure (V2I) communication. In the current scenario, deploying a huge number of RSUs in the vehicular networks at an initial stage is completely impossible as it incurs high installation cost and authority restriction. Moreover, the optimal placement of RSUs in the vehicular network needs to be enforced for attaining maximized network coverage. In this paper, Chew's first Delaunay triangulation refinement scheme (CFDTRS) is proposed for optimal positioning of RSUs in order to attain optimal network coverage in the vehicular network with minimized cost. This CFDTRS considered the factors of vehicular density, number of obstacles in the map, intersection popularity, and global coverage into account during the placement of RSUs. It is proposed with the objective of deploying required number of RSUs within the range of data transmission in order to achieve maximal coverage in the convex map, such that each area of the convex map is completely covered with at least a single RSU in the existence of multiple number of obstacles. The simulation results of the proposed CFDTRS attained from the real time situations of simplex, moderate, and complex maps confirmed improved packet delivery rate of 9.32%, throughput by 10.74% with minimized packet loss of 9.14%, and reduced end‐to‐end delay of 19.31$, compared to the benchmarked schemes considered for investigation.

show abstract

Efficient pre-authentication scheme for inter-ASN handover in high mobility MANET

Cited by 6 publications

References 36 publications

Bipolar fuzzy information‐based PROMETHEE‐based outranking scheme for mitigating vampire attack in wireless sensor networks

Bipolar fuzzy information‐based PROMETHEE‐based outranking scheme for mitigating vampire attack in wireless sensor networks

Border Collie optimization algorithm‐based node clustering technique in vehicular ad hoc networks

Chew's first Delaunay triangulation refinement scheme‐based positioning of road side units for optimal network coverage in vehicular ad‐hoc networks

Contact Info

Product

Resources

About