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.

scholarly journals Failure history-based routing protocol for mobile ad hoc networks

2020 ◽  
Vol 9 (1) ◽  
pp. 194
Author(s):  
Khalid Batiha ◽  
Aamal Khaled Ababneh
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad-hoc NETworks (MANETs) are defined as a collection of mobile nodes that cooperate in order to operate. Nodes in MANETs should build and maintain routes in order to communicate. A routing algorithm is used to manage these routes. MANETs have dynamic topology because of node mobility. The probability of route failure increases when intermediate nodes have higher mobility. This study will propose a routing protocol that depends on the failure history of the nodes from which the route will constructed. The proposed protocol will be implemented over the existing Ad hoc On-Demand Distance Vector (AODV) routing protocol. It is expected that the proposed protocol will improve the packet delivery ratio in the network. 

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