scholarly journals An Enhanced Hybrid Social Based Routing Algorithm for MANET-DTN

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Martin Matis ◽  
L’ubomír Doboš ◽  
Ján Papaj
Keyword(s):  
Mobile Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Real Life ◽  
Optimal Solution ◽  
Dynamic Topology ◽  
Disaster Situation ◽  
Dynamic Source ◽  
Small Density ◽  
Hoc Networks

A new routing algorithm for mobile ad hoc networks is proposed in this paper: an Enhanced Hybrid Social Based Routing (HSBR) algorithm for MANET-DTN as optimal solution for well-connected multihop mobile networks (MANET) and/or worse connected MANET with small density of the nodes and/or due to mobility fragmented MANET into two or more subnetworks or islands. This proposed HSBR algorithm is fully decentralized combining main features of both Dynamic Source Routing (DSR) and Social Based Opportunistic Routing (SBOR) algorithms. The proposed scheme is simulated and evaluated by replaying real life traces which exhibit this highly dynamic topology. Evaluation of new proposed HSBR algorithm was made by comparison with DSR and SBOR. All methods were simulated with different levels of velocity. The results show that HSBR has the highest success of packet delivery, but with higher delay in comparison with DSR, and much lower in comparison with SBOR. Simulation results indicate that HSBR approach can be applicable in networks, where MANET or DTN solutions are separately useless or ineffective. This method provides delivery of the message in every possible situation in areas without infrastructure and can be used as backup method for disaster situation when infrastructure is destroyed.

scholarly journals A survey on MANET protocols in wireless sensor networks

2018 ◽  
Vol 7 (2.31) ◽  
pp. 1
Author(s):  
C Cynthia, Prudhvi Krishna Saguturu ◽  
Komali Bandi ◽  
Srikanth Magulluri ◽  
T Anusha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
On Demand ◽  
Dynamic Source ◽  
Distance Vector ◽  
Demand Routing ◽  
Hoc Networks

In Wireless sensor networks and ad hoc networks nodes have a freedom to move from one place to another, they are self-configuring this type of the structure fulfil the requirements of several application. A survey on the different MANET protocols will be done in this paper. Mainly this paper will focus on the Quality of Service on the different parameters like Throughput and Delay between different protocols like AODV (Ad Hoc on Demand Distance Vector), DSDV (Destination-Sequenced Distance-Vector Routing), DSR (Dynamic Source Routing), and TORA (Temporary Ordered Routing Algorithm). DSDV is called as proactive protocol because they know everything about the nodes in the network before the communication start. DSR, AODV, TORA protocols are called reactive protocol because nodes in this network do not know anything about network. They are also called ON-DEMAND routing protocols. After this analysis you will come to know which MANET protocol is best for different application. 

A Modified AODV to Cope with Marine Mobile Ad-Hoc Networks

2014 ◽  
Vol 926-930 ◽  
pp. 1865-1869
Author(s):  
Zhen Yu Liao ◽  
Jing Li ◽  
Chong Shen
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Transmission Range ◽  
Self Healing ◽  
On Demand ◽  
Dynamic Source ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Dynamic Link

This Marine mobile ad-hoc network (MMANET) is a dynamic wireless network, and the random mobility of ship nodes and limited radio transmission range are the main challenges in the design of the robust routing algorithm. Dynamic Source Routing (DSR) and Ad hoc On-Demand Vector Routing (AODV) are typical on-demand protocols, but if there are some nodes moving with random fast velocity and limited transmission range in communication network, the network will be under an unstable link state and this situation may lead to large delay and packet loss. In this paper, a new scheme named Dynamic Link Self-healing mechanism on the basis of Mobility Quantization AODV (DLMQ-AODV) is proposed to solve the problem. Mobility quantization of node is resulting from relative velocity and distance, through computation of weighting, dimensionless etc. We take advantage of mobility quantization to establish dynamic link self-healing mechanism in order to improve the routing performance. The simulation results show that DLMQ-AODV has a better performance in comparison to DSR and AODV.

The Research of Ad Hoc Network Routing Protocols

2014 ◽  
Vol 926-930 ◽  
pp. 2626-2629
Author(s):  
Qi Sun
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Network Size ◽  
Node Number ◽  
Topology Changes ◽  
Dynamic Source ◽  
Hoc Networks

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

scholarly journals Effective Analysis of Different Parameters in Ad hoc Network for Different Protocols

2012 ◽  
pp. 234-237
Author(s):  
Kumar Manoj ◽  
S. C. Sharma ◽  
Chandra s
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Ad Hoc Routing ◽  
On Demand ◽  
Dynamic Source ◽  
Hoc Networks

A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration, in which all nodes potentially contribute to the routing process. A user can move anytime in an ad hoc scenario and, as a result, such a network needs to have routing protocols which can adopt dynamically changing topology. To accomplish this, a number of ad hoc routing protocols have been proposed and implemented, which include Dynamic Source Routing (DSR), ad hoc on-demand distance vector (AODV) routing, and temporally ordered routing algorithm (TORA). In this paper, we analyze the performance differentials to compare the above-mentioned commonly used ad hoc network routing protocols. We report the simulation results of four different scenarios for wireless ad hoc networks having thirty nodes. The performances of proposed networks are evaluated in terms of number of hops per route, re transmission attempts, traffic sent, traffic received and throughput with the help of OPNET simulator. Channel speed 11Mbps and simulation time 20 minutes were taken. For this above simulation environment, TORA shows better performance over the two on-demand protocols, that is, DSR and AODV

Cluster-Based Location Aided Routing Algorithm for Mobile Ad Hoc Networks

2009 ◽  
Vol 20 (11) ◽  
pp. 3086-3100
Author(s):  
Yi WANG ◽  
Liang DONG ◽  
Tao-Tao LIANG ◽  
Xin-Yu YANG ◽  
De-Yun ZHANG
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Ad Hoc ◽  
Hoc Networks
Sign in / Sign up

Export Citation Format

Share Document