Performance Study of Ad-Hoc Reactive Routing Protocols

Khatri, Pallavi; Rajput, Monika; Shastri, Alankar; Solanki, Keshav

doi:10.3844/jcssp.2010.1159.1163

Cited by 26 publications
(15 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…11-14. The performance study of AODV in (Khatri et al, 2010) helps us to compare our performance results with AODV with improved results…”

Section: Discussionmentioning
confidence: 99%

A Secure Routing Protocol to Eliminate Integrity, Authentication and Sleep Deprivation Based Threats in Mobile Ad hoc Network
Nallathambi¹
2011
Journal of Computer Science
1
0
1
0
View full text Add to dashboard Cite

Problem statement: Network security in Mobile Ad hoc Network (MANET) is a major issue. Some of the attacks such as modification, impersonation, Time To Live (TTL) and sleep deprivation are due to misbehaviour of malicious nodes, which disrupts the transmission. Some of the existing security protocols such as ARAN, SAODV and SEAD are basically used to detect and eliminate one or two types of attacks. The major requirement of a secure protocol is to prevent and eliminate many attacks simultaneously which will make the MANETs more secured. Approach: We propose the algorithm that can prevent and also eliminate multiple attacks simultaneously, called MIST algorithm (Modification, Impersonation, Sleep deprivation and TTL attacks). This algorithm is written on Node Transition Probability (NTP) based protocol which provides maximum utilization of bandwidth during heavy traffic with less overhead. Thus this has been named MIST NTP. Results: The proposed MIST NTP has been compared with NTP without the MIST algorithm, Authenticated Routing for Ad hoc Networks (ARAN) and Ad hoc on Demand Distance Vector (AODV). Extensive packet level simulations show that MIST NTP produces around 10% less end to end delay than ARAN, it even drops 30% fewer packets compared to malicious NTP on an average and around 50-60% fewer packets compared to AODV during multiple attacks. Conclusion: The results ensure that MIST NTP can break the greatest security challenge prevailing in MANETs by securing the MANET against several attacks at once.

show abstract

“…11-14. The performance study of AODV in (Khatri et al, 2010) helps us to compare our performance results with AODV with improved results…”

Section: Discussionmentioning
confidence: 99%

show abstract

“…Routing caches in DSR are used to reduce flooding of route requests [11]. However, with the increase in network size and node mobility, cached routes quickly become stale or inefficient.…”

Section: Dynamic Source Routing Protocol (Dsr)mentioning
confidence: 99%

A Scalable-Adaptive Snack Routing Strategy (SRS) for Semi-Administrated Mobile Ad Hoc Networks (SAMANETs)
Saleh
¹

2011
Int J Wireless Inf Networks
5
0
2
0
View full text Add to dashboard Cite

Recently, Mobile Ad Hoc networks (MANETs) are growing in popularity and importance. They present a possible communication among a set of mobile nodes with no need for either a pre-established infrastructure or a central administration. However, in order to guarantee an efficient communication among network nodes, efficient routing algorithms should be established. Routing plays the central role in providing ubiquitous network communications services in such dynamic networks. The problem is further aggravated through the node mobility as any node may move at any time without notice. Several routing protocols had been proposed; however, most of them suffer from control packet flooding, which results in a scalability problem. In this paper, a new routing strategy for MANETs is proposed which is called Snack Routing Strategy (SRS). The basic idea of SRS is to continuously inform the network mobile nodes with any changes in the network topology without overloading the network by a huge amount of control messages. SRS is a hybrid routing strategy that relies on Learning by accumulation, hence, new routes can be discovered by learning the accumulative data stored in the nodes routing tables by several foraging artificial snacks. SRS uses no periodic routing advertisement messages but uses artificial snacks instead, thereby reducing the network bandwidth overhead and minimizing end-to-end transmission delay. SRS has been compared against two well known protocols AODV and DSR. Experimental results have shown that SRS outperforms both AODV and DSR as it introduces the minimal routing overheads.

show abstract

“…A Trust based routing is proposed by Pirazada (Buchegger and Boudec, 2004) in which the trust agent derives trust levels from events that are directly experienced by a node (Khatri et al, 2010). A trust information is shared by the Reputation agent about nodes with other nodes in the network.…”

Section: Methodsmentioning
confidence: 99%

Mobile Ad Hoc Network Security for Reactive Routing Protocol with Node Reputation Scheme
Suresh¹
2011
Journal of Computer Science
10
0
5
0
View full text Add to dashboard Cite

Abstract:The mobile node's reputation in the Mobile Ad hoc Network (MANET) identifies its trust worthiness for secured multiple data communication. Unknown nature of the node's communication status for initial period has great impact in the effective data transfer as MANET is self-organized and distributed. Problem statement: The functional operation of the mobile network relies on the trusty cooperation between the nodes. The major factor in securing the MANET is based on the quantification of node's reputation and trustworthiness. The previous literatures provided uncertainty model to reflect a node's confidence in sufficiency of its past experience and effect of collecting trust information from the unknown node status. With node mobility characteristic, it reduces unknown nature and speed up trust convergence. Approach: Mobility-assisted uncertainty reduction schemes comprised of, proactive schemes, that achieve trust convergence and reactive schemes provide node authentication and their reputation. They provide an acceptable trade-off between delay and uncertainty. The mobility based node reputation scheme presented in this study, identifies and monitor the node's trustworthiness in sharing the information within the ad hoc network. Mobile nodes information uncertainty is handled with the mobility characteristics and its reputation is evaluated to trust or discard the node's communication. Results: Simulations are carried out to evaluate the performance of mobility based node reputation scheme by measuring the nodes consistency behavior, neighboring communication rate and path diversity. Conclusion: The average node's neighboring communication rate is high for the proposed mobility based reputation scheme compared to the reactive routing protocols.

show abstract

Performance Study of Ad-Hoc Reactive Routing Protocols

Cited by 26 publications

References 8 publications

A Secure Routing Protocol to Eliminate Integrity, Authentication and Sleep Deprivation Based Threats in Mobile Ad hoc Network

A Secure Routing Protocol to Eliminate Integrity, Authentication and Sleep Deprivation Based Threats in Mobile Ad hoc Network

A Scalable-Adaptive Snack Routing Strategy (SRS) for Semi-Administrated Mobile Ad Hoc Networks (SAMANETs)

Mobile Ad Hoc Network Security for Reactive Routing Protocol with Node Reputation Scheme

Contact Info

Product

Resources

About