Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

2007 ◽  
Vol 28 (1) ◽  
pp. 127-139 ◽  
Author(s):  
Han-xing Wang ◽  
Xi Hu ◽  
Jian-chao Fang ◽  
Wei-jia Jia
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Markov Models ◽  
Reactive Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Applying trust enhancements to reactive routing protocols in mobile ad hoc networks

2015 ◽  
Vol 22 (7) ◽  
pp. 2239-2257 ◽  
Author(s):  
Hui Xia ◽  
Jia Yu ◽  
Zhen-kuan Pan ◽  
Xiang-guo Cheng ◽  
Edwin H. -M. Sha
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Reactive Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Secured Approach towards Reactive Routing Protocols Using Triple Factor in Mobile Ad Hoc Networks

2019 ◽  
Vol 3 (2) ◽  
pp. 32-40 ◽  
Author(s):  
Mohammad Riyaz Belgaum ◽  
Shahrulniza Musa ◽  
Mazliham MohdSu’ud ◽  
Muhammad Alam ◽  
Safeeullah Soomro ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Destination Node ◽  
Cryptographic Algorithm ◽  
Reactive Routing ◽  
Different Types ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Routing protocols are used to transmit the packets from the source to the destination node in mobile ad hoc networks. The intruders seek chance to pierce into the network and becomes a cause of malfunctioning in the network. These protocols are always prone to attacks. During the phases of routing in different types of protocols, each of the attack finds a way to degrade the performance of the routing protocols. The reactive routing protocols DSR and AODV have lot of similar features and so are considered in this study. In order to transmit the packets safely, a secured approach using triple factor has been proposed. This triple factor computes the trust by using the direct information then verifies the reputation by collecting the information from the neighbouring nodes called distributed factor and uses cryptographic algorithm to ensure security. And to ensure that there are routes available to perform the routing process, the reasons for such attacks are studied so as to re-integrate back the nodes in to the network, once it has repented for being malicious before. The availability of routes increases the throughput.

Analyzing Reactive Routing Protocols for Mobile Ad Hoc Networks

2016 ◽  
Vol 23 (03) ◽  
pp. 1640006
Author(s):  
Raj Kamal Kapur ◽  
Sunil Kumar Khatri
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
On Demand ◽  
Reactive Routing ◽  
Dynamic Source ◽  
Significant Performance ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks (MANETs) are ad hoc networks in which the nodes co-operatively route the traffic to the destination nodes which are beyond the wireless range of source nodes. The nodes in the network act as both end devices and routers. The routing mechanism in MANETs differentiates it from other wireless networks. Developing a routing protocol which is light on resources and efficient is a challenging task. Several routing protocols have been developed but the reactive routing protocols have found favor in most applications since these obtain the route when a node has data to send. This results in lower routing load and better conservation of meagre resources of the nodes. The two prominent reactive routing protocols for mobile ad hoc networks-Dynamic Source Routing (DSR) and Ad-hoc On-demand Distance Vector (AODV) routing. Both the protocols have similar on-demand behavior, but the differences in the protocol mechanism can lead to significant performance differentials. The performance differentials are analyzed using varying network load and mobility.

Sign in / Sign up

Export Citation Format

Share Document