Spatial DSDV (S-DSDV) routing algorithm for mobile ad hoc network

Manjunath, M; Manjaiah, D. H.

doi:10.1109/ic3i.2014.7019587

Cited by 17 publications

(20 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Manjunath and Manjaiah [16] proposed routing algorithm called Spatial DSDV (SDSDV) routing algorithm for mobile ad hoc network. The SDSDV consists of three phases that is identification of activity area, identification of representative node and the routing process.…”

Section: Related Workmentioning

confidence: 99%

“…Spatial Ad hoc On demand Distance Vector (SAODV) [18] is a reactive and improved version of Ad hoc On Demand Distance Vector routing protocol. Spatial AODV (SAODV) routing protocol allows the source node to identify the route quickly to destination by eliminating redundant node that participated during the route discovery process.…”

Section: Related Workmentioning

confidence: 99%

“…In Manet, all the control packets, data packets must traverse through the multiple nodes and multiple links to reach destination. So obtaining optimal path with accurate topological information during data communication is a challenging task [3]. The core problem in Manet is still, the finding the accurate path between source and destination during high mobility [4][5][6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

SS_PAR: Signal Strength Based Petal Ant Routing Algorithm for Mobile Ad Hoc Network

Manjunath

Manjaiah

2015

Emerging Research in Computing, Information, Communication and Applications

View full text Add to dashboard Cite

Mobile ad hoc network (MANET) is a collection of mobile node which acts as both host and router at the same time during communication. Each node in MANET usually runs on battery and capable of communicating to other without fixed base station. Since node has limited transmission range, limited bandwidth and limited battery, obtaining optimal path with less overhead is a challenging task. In this paper, we proposed Signal Strength based Petal Ant on-demand routing (SS_PAR) algorithm which is based on swarm intelligence technique and the signal strength of mobile node. The proposed SS_PAR reduces overhead by analyzing signal strength inside the petal and optimize the node that participated during route discovery. We compared our routing algorithm with SARA and simulation results shows that SS_PAR performance is better than SARA.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

SS_PAR: Signal Strength Based Petal Ant Routing Algorithm for Mobile Ad Hoc Network

Manjunath

Manjaiah

2015

Emerging Research in Computing, Information, Communication and Applications

View full text Add to dashboard Cite

show abstract

“…Networking is made via cluster of nodes, these nodes helps in transferring the data without any means of authorization from the server. Thus these nodes are important for generating as well as managing the network [4]. An ad-hoc network does not use the infrastructure to communicate instead it use wireless network channel such as Bluetooth to communicate directly with each other.…”

Section: Introductionmentioning

confidence: 99%

Identification and Avoidance of Malicious Nodes by using Certificate Revocation Method

Krishna¹,

Swain²

2018

IJET

View full text Add to dashboard Cite

There are a large number of applications of ad-hoc networks (i) military, (ii) Disaster rescue, (iii) Medical etc. But the security of the data during transfer is a major concern. This paper proposes a technique for identifying and preventing the malicious nodes to be in a path from sender to receiver, known as certificate revocation method. Here certificate authority Scheme (CAS) is responsible for the issue of the certificates for these nodes. The CAS maintains two sets of lists – a warning list and a blocked list. The node is added to a warning list if any of the neighbor nodes raises a suspension about a node. Both the accuser and the accused are added to this list. The node is transferred to blocked list when the corruption in the node is confirmed. A node from the blocked list is never added to the network again. This process is termed as cluster-based certificate revocation scheme (CBCRS). The priority of this technique is not the detection of the corrupted node but the removal of the corrupted node from the network. Experimental results reveal that this protocol is free from vulnerabilities.

show abstract

“…The main challenges of routing protocols for Manets are to ensure that nodes are able to select an optimal path to forward the data traffic from source to the intended destination. Many routing protocols have been proposed for routing issues such as AODV [5], AOMDV [6], DSR [7], DSDV [8], TOHIP [9], S-AODV [10], S-DSDV [21],...etc, but many researchers have stated in literature that the Ant have the better potential to find an efficient and shortest path much optimal than other routing algorithm by depositing chemical substance called pheromone [2 indexing]. The researchers observed the behaviour of real ants and inspired to design a new ant routing protocols for manet such as ACO [11], ARA [12], SARA [13], HOPNET [14], ANTnet [15], Ant AODV [16], ANTALG [17], etc.…”

mentioning

confidence: 99%