Node Disjoint Random and Optimal Path Selection (NDROPS) Algorithm for Security in MANETS

Suma, P.; Nagaraju, O.; Hussain, Mohammed Ali

doi:10.11591/ijece.v7i3.pp1197-1203

Cited by 7 publications

(7 citation statements)

References 9 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is achieved using Secure and Effective Random Paths Selection (SERPS) Algorithm to provide security in MANETs. The basic theme behind this algorithm is calculating node disjoint paths and then the minimum cost paths [22] among them. Then the routing is done through all the selected paths in random.…”

Section: Proposed Methodologymentioning

confidence: 99%

See 1 more Smart Citation

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

Suma¹,

Hussain²

2018

IJET

View full text Add to dashboard Cite

Mobile Ad-hoc Networks (MANETs) are wireless and nodes of it are mobile in nature. These networks can be adopted where equipment like wires cannot be established and the nodes are moving. Due to the mobile nature of nodes, a fixed topology cannot be achieved. This leads to a dynamic or ever changing network structure. The paths between the communicating nodes also change frequently. Overall monitoring system is absent in it i.e. supervising node is not present for establishing routes in the network. Each node itself acts as a router. Due to the lack of fundamental management system and ever moving nodes, security becomes a challenge and detection of attackers also becomes tough. Dynamic source Routing (DSR) is used in route discovery. In this routing strategy, paths are established only on demand of sender and receiver nodes. And to reduce the cost many algorithms were proposed, but the concept of security is deficit in them. In this paper, Secure and Effective Random Paths Selection (SERPS) algorithm is proposed with the concepts of minimum cost and node disjointness to achieve security. All the node disjoint paths between sender and receiver are found. Among them a minimum of 4 minimum cost paths are selected. Then data packets are sent through them by randomly selecting the paths. Care is to be taken such that no consecutive packets go through the same path. By this, attacker at any node gets only the random packets but not the complete data. In this way security can be achieved. The simulation for the proposed SERPS algorithm is done to show the routing process.

show abstract

Section: Proposed Methodologymentioning

confidence: 99%

“…In this section we provide the research survey of MANET security which has lead to the development of SERPS algorithm [8]. Shuchita et al [9] proposed a method of finding node and link disjoint paths to attain few positive qualities.…”

Section: Literature Reviewmentioning

confidence: 99%

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

Suma¹,

Hussain²

2018

IJET

View full text Add to dashboard Cite

show abstract

“…LITERATURE REVIEW 1. P Suma, O Nagaraju, MA Hussainet.al [1] In this author proposed an answer for averting mystery tuning in of information called listening stealthily and furthermore in decreasing the level of harm through various assaults like worm opening, dim gap assaults and numerous others. Furthermore, the primary favorable position is the accomplishment of security with slightest cost and least time for transmission.…”

Section: Existing Security Mechanisms Related To Selective Forwarmentioning

confidence: 99%

“…Sensor systems are powerless against various security attacks which can be either outside attack or inside attack [1]. Outside attacks are not exceptionally successful and do not make much harm to the system since they don't have the entrance to the system data.…”

Section: Introductionmentioning

confidence: 99%

Critical Analysis of Numerous Attacks Irreverent Security in Remote Sensor Networks

Sharma¹,

Saini²

2018

IJARCSSE

View full text Add to dashboard Cite

Remote Sensor Networks have risen as innovation of the current century and has givenan intense blend of dispersed detecting, figuring and correspondence of attacks. With its developing application regions, especially in mission-basic applications, for example, military observing frameworks and war zone observation, security has turned into a critical need keeping in mind the end goal to ensure the touchy information included. The need of viable and effective security systems is necessary and to secure sensor systems has pulled in a lot of scientists' consideration making it hot research zone in the current years. Among the quantity of assaults on the sensor arrange, the Selective Forwarding attack, assumed name as grayhole attack, is a genuine and difficult to-distinguish security assault that can render the system ineffective if the attack was left undetected. In this attack, the principal objective of the attacker is to keep the critical delicate information from achieving the base station. To accomplish this objective, the harmful hub specifically drops certain nodes, in view of some picked criteria, and advances the remaining. The assault turns out to be more viable when the attacker incorporates itself on the way of the information flow. This paper aims to give an outline and investigation of existing ways to deal with counter particular sending assault in remote sensor systems.

show abstract

“…source or target) or router (i.e. intermediate nodes) [2,3]. MANET is widely used in several applications like civilian, industrial, and military [4].…”

Section: Introductionmentioning

confidence: 99%

Multicast routing strategy for SDN-cluster based MANET

Naser

Kadhim

2020

IJECE

View full text Add to dashboard Cite

The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for cluster based MANET by using SDN (RMCMS), second one called proactive multicast routing strategy for cluster based MANET by using SDN (PMCMS) and third one represents modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.

show abstract

Node Disjoint Random and Optimal Path Selection (NDROPS) Algorithm for Security in MANETS

Cited by 7 publications

References 9 publications

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

Critical Analysis of Numerous Attacks Irreverent Security in Remote Sensor Networks

Multicast routing strategy for SDN-cluster based MANET

Contact Info

Product

Resources

About