scholarly journals Copy Adaptive Routing Algorithm Based on Network Connectivity in Flying Ad Hoc Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Honghai Wu ◽  
Qianqian Sang ◽  
Yingda Wang ◽  
Huahong Ma ◽  
Ling Xing
Keyword(s):  
Data Transmission ◽  
High Speed ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Connectivity ◽  
Mobile Network ◽  
Node Mobility ◽  
Communication Links ◽  
Opportunistic Transmission ◽  
Hoc Networks

The Flying Ad Hoc Network (FANET) is a kind of mobile network which is composed of flying UAVs (Unmanned Aerial Vehicles) as network nodes. With the high node mobility and dynamic topology, data transmission in FANETs is faced with severe challenges, such as unstable communication links and limited resources in the network. Due to the uncertainty of node encounters, data transmission is usually carried out by opportunistic transmission. However, the opportunistic delivery of data using multicopy routing not only consumes a large amount of network resources but also causes too much transmission overhead and low delivery quality. Thus, this paper designs a connectivity-based copy adaptive transmit routing algorithm (CCAT). Considering the network interruptions caused by high-speed node movement, CCAT makes packet forwarding decisions by estimating network connectivity and uses node transmit prediction value as forwarding utility value to control the number of copies of packets. Simulation results show that the delivery rate of CCAT can be improved by about 30% at the peak compared with traditional multicopy routing strategies and the transmission latency of CCAT is minimal.

scholarly journals ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)

2013 ◽  
pp. 218-223
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL
Keyword(s):  
Swarm Intelligence ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Ant Colony Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).

scholarly journals An Energy-Balanced Geographic Routing Algorithm for Mobile Ad Hoc Networks

Energies ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 2219 ◽  
Author(s):  
Dong Yang ◽  
Hongxing Xia ◽  
Erfei Xu ◽  
Dongliang Jing ◽  
Hailin Zhang
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Geographic Routing ◽  
Destination Node ◽  
Node Mobility ◽  
Forward Region ◽  
Mobile Ad Hoc ◽  
Hoc Networks

To mitigate the frequent link breakage and node death caused by node mobility and energy constraints in mobile ad-hoc networks, we propose an energy-balanced routing algorithm for energy and mobility greedy perimeter stateless routing (EM-GPSR) based on geographical location. In the proposed algorithm, the forward region is divided into four sub-regions. Then, according to the remaining lifetime of each node and the distance between the source node and the destination node, we select the next-hop node in the candidate sub-regions. Since the energy consumption rate of the node is taken into account, the next-hop selection favors the nodes with longer remaining lifetimes. Simulation results show that compared with conventional greedy perimeter stateless routing (GPSR) and speed up-greedy perimeter stateless routing (SU-GPSR) routing algorithms, the proposed algorithm can lead to a lower end-to-end delay, longer service time, and higher transmission efficiency for the network.

PERFORMANCE OF GZRP AD HOC ROUTING PROTOCOL

2001 ◽  
Vol 02 (01) ◽  
pp. 31-48 ◽  
Author(s):  
AZZEDINE BOUKERCHE ◽  
STEVE ROGERS
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Node Mobility ◽  
Ad Hoc Routing ◽  
Ad Hoc Routing Protocol ◽  
Original Scheme ◽  
Varying Environments ◽  
Military Networks ◽  
Hoc Networks

Ad hoc networks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable, and movement of communicating parties is allowed. Therefore, such networks are designed to operate in widely varying environments, from military networks to low-power sensor networks and other embedded systems. Frequent topology changes caused by node mobility make routing in ad hoc wireless networks a challenging problem. In this paper, we propose an efficient ad hoc routing algorithm, which we refer to as GZRP, a hybrid protocol that makes use of the ZRP scheme and the Global Positioning System (GPS). As opposed to the ZRP original scheme, our GZRP scheme consists of propagating the routing (query) messages only to the nodes that are further away from the query source. We discuss the algorithm, its implementation, and report on the performance of GZRP scheme, and compare it to the ZRP routing protocol using an extensive simulation experiment. Our results indicate clearly that GZRP outperforms ZRP by reducing significantly the number of route query messages, and thereby increases the efficiency of the network load. Furthermore, we show that careful GPS screening angle is an important factor in the success of the GZRP ad hoc routing protocol.

A Study of Speed Aware Routing for Mobile Ad Hoc Networks

2013 ◽  
pp. 190-212
Author(s):  
Kirthana Akunuri ◽  
Ritesh Arora ◽  
Ivan G. Guardiola
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
High Mobility ◽  
Node Mobility ◽  
On Demand ◽  
Expiration Time ◽  
Mobile Ad Hoc ◽  
Demand Routing ◽  
Hoc Networks

The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network (MANET) routing. This research proposes a novel on-demand routing protocol, Speed-Aware Routing Protocol (SARP) to mitigate the effects of high node mobility by reducing the frequency of route disconnections in a MANET. SARP identifies a highly mobile node which forms an unstable link by predicting the link expiration time (LET) for a transmitter and receiver pair. NS2 was used to implement the SARP with ad hoc on-demand vector (AODV) as the underlying routing algorithm. Extensive simulations were then conducted using Random Waypoint Mobility model to analyze the performance of SARP. The results from these simulations demonstrated that SARP reduced the overall control traffic of the underlying protocol AODV significantly in situations of high mobility and dense networks; in addition, it showed only a marginal difference as compared to AODV, in all aspects of quality-of-service (QOS) in situations of low mobility and sparse networks.

Correlations between Centrality Measures for Mobile Ad hoc Networks

2015 ◽  
Vol 4 (2) ◽  
pp. 15-27 ◽  
Author(s):  
Natarajan Meghanathan
Keyword(s):  
Mobile Ad Hoc Networks ◽  
Correlation Coefficient ◽  
Shortest Path ◽  
Ad Hoc ◽  
Network Connectivity ◽  
Closeness Centrality ◽  
Centrality Measures ◽  
Node Mobility ◽  
Mobile Ad Hoc ◽  
Hoc Networks

The author conducts an extensive correlation coefficient analysis of four prominent centrality measures for mobile ad hoc networks. The centrality measures considered are the degree-based degree centrality and eigenvector centrality, and the shortest path-based betweenness centrality and closeness centrality. The author evaluates the correlation coefficient between any two of the above four centrality measures as a function of network connectivity and node mobility. He observes a consistent ranking (with respect to the correlation coefficients) among the pairs of centrality measures for all levels of network connectivity, node mobility and across the duration of the simulation session. The shortest path-based closeness centrality measure exhibits high correlation with the degree-based centrality measures, whereas the betweenness centrality exhibits relatively weak correlation with the degree-based centrality measures. For a given level of node mobility and network connectivity, the author does not observe the correlation coefficient values between any two centrality measures to significantly change with time.

A Novel Routing Algorithm Based on Path Stability and Energy Aware

2011 ◽  
Vol 204-210 ◽  
pp. 1477-1480
Author(s):  
Fan Zhang ◽  
Ye Wen Cao
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Energy Awareness ◽  
Node Mobility ◽  
Selection Algorithm ◽  
Energy Aware ◽  
Stability Change ◽  
Path Stability ◽  
Hoc Networks

As the core of routing protocols, route selection algorithm plays the key role in the scenario of quick mutability of the network topology. In mobile ad hoc networks, node mobility has been one of the dominant factors which cause the loss of performance so that the path duration and stability has to be taken into account. On the other hand, energy awareness for computation is becoming another crucial parameter. In this paper, a novel routing selection algorithm has been proposed without any additional device (such as GPS). Path stability based on stability change ratio and energy awareness has been jointly considered in this proposed algorithm. In order to verify the correctness of the proposed solution an enhanced routing protocol based on AODV named EN-AODV has been presented. Simulation results show that the performance of EN-AODV is better than that of traditional AODV and NCR-AODV in terms of normalized routing load, packet delivery ratio and nodes death rate.

scholarly journals Paradigm Shift in Routing Approaches for High Speed MANET Applications

2017 ◽  
Vol 2 (1) ◽  
pp. 59 ◽  
Author(s):  
Sadanand R. Inamdar ◽  
Sathish Babu B. ◽  
Ravi M. Yadahalli
Keyword(s):  
Paradigm Shift ◽  
High Speed ◽  
Ad Hoc ◽  
Node Mobility ◽  
Differentiated Service ◽  
Key Factors ◽  
Network Applications ◽  
Routing Strategy ◽  
Hoc Networks ◽  
High Traffic Volume

Effective routing protocol in ad hoc networks involves consideration of key factors like latency, mutual interference between on-going communication during route initiation, power consumption and effective re-routing process for unstable topology conditions in presence of node mobility. Recent ad hoc network applications involve quest for a high throughput, robustness and differentiated service awareness in the context of present 3G/4G and future 5G standards. This paper discusses the motivation for routing strategy with paradigm shift to meet the aspiration set forth under high traffic volume applications.

Effect of Nodes Mobility on Density-Based Probabilistic Routing Algorithm in Ad-hoc Networks

2012 ◽  
Vol 2 (1) ◽  
pp. 29-48
Author(s):  
Hean-Loong Ong ◽  
Essam Natsheh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Variable Density ◽  
Node Mobility ◽  
Probabilistic Routing ◽  
Noticeable Improvement ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Density-based probabilistic routing algorithm (AODV–Probabilistic) has been introduced for mobile ad hoc networks. Under ideal settings, it has been proven to provide drastic performance improvement over AODV and OLSR routing protocols. In this paper, the authors study the effect of inaccurate location information caused by node mobility under a rich set of scenarios. They identify three different environments: a high density, a variable density and a sparse density. Simulation results show noticeable improvement under the three environments. Under the settings the authors examine, their proposed algorithm achieve up to 22% longer links lifetime than AODV and 45 percent longer links lifetime than OLSR at the three environments, on average, without incurring any additional routing overheads or intense computation.

Sign in / Sign up

Export Citation Format

Share Document