A topographically preserved road‐network tile model and optimal routing method for virtual globes

2019 ◽  
Vol 23 (2) ◽  
pp. 294-311
Author(s):  
Quanhua Dong ◽  
Jing Chen ◽  
Tingting Liu
Keyword(s):  
Road Network ◽  
Optimal Routing ◽  
Virtual Globes ◽  
Routing Method ◽  
Tile Model

scholarly journals Lifetime enhancement for clustering protocols in heterogeneous wireless sensor networks

2019 ◽  
Vol 14 (3) ◽  
pp. 1305 ◽  
Author(s):  
Basim Abood ◽  
Yasser Kareem Al-Rikabi
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Optimal Routing ◽  
Energy Efficient Routing ◽  
End To End Delay ◽  
Heterogeneous Wireless Sensor Networks ◽  
Balancing Energy ◽  
Clustering Approach ◽  
Routing Method ◽  
Stable Election Protocol

<span style="font-family: Arial, sans-serif; font-size: 9pt;">In this paper, we propose a new clustering method called fuzzy stable election protocol (FSEP), which is capable to overcome the bottleneck problem and addressing the uneven energy consumption problem in heterogeneous WSNs. We also propose an energy-efficient routing method called particle swarm optimization routing method (PSORM) to find the optimal routing path for the heterogeneous WSNs. PSORM seeks to investigate the problems of balancing energy consumption and maximization of network lifetime. To demonstrate the effectiveness of FSEP-PSORM in terms of lessening end-to-end delay, balancing energy consumption, and maximization of heterogeneous network lifetime, we compare our method with three approaches namely, chessboard clustering approach, PEGASIS, and LEACH. Simulation results show that the network lifetime achieved by FSEP-PSORM could be increased by nearly 38%, 45%, and 60% more than that obtained by PEGASIS, LEACH and stable election protocol clustering (SEP), respectively.</span>

A survey on ACO based multipath routing algorithms for ad hoc networks

2017 ◽  
Vol 13 (4) ◽  
pp. 370-385 ◽  
Author(s):  
Ishu Sharma ◽  
K.R. Ramkumar
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Routing Algorithms ◽  
Optimal Routing ◽  
Content Type ◽  
Multiple Paths ◽  
Routing Method ◽  
Hoc Networks

Purpose The purpose of this paper is to review the existing routing algorithms for wireless ad hoc networks to evaluate the methods according to the current requirements. Wireless ad hoc network can provide communication in emergency situations. Active nodes in ad hoc network work as sender, receiver and router at the same time. Nodes are equipped with limited bandwidth and energy. Optimal routing method can help in “smart use” of available resources. Evolvement of routing method based on need is a continuous process. Numerous applications of ad hoc network motivates researcher for further development to fulfill the need of society. Design/methodology/approach In this paper, routing algorithms for ad hoc network based on ant colony optimization, multipath routing and with multiple input multiple output (MIMO) antenna support have been discussed. Findings Comparative analysis has been drawn among existing algorithms of different categories. Transmitting message packets parallel through multiple paths in the network can save overall resource usage in the network. Originality/value The authors have discussed the future area of development for optimal routing in ad hoc networks. Considering signal noise ratio and congestion status while selecting path can provide better energy use in the network. Rather than leaving less prioritized route paths, multiple paths can be used for sending data packets parallel.

Sign in / Sign up

Export Citation Format

Share Document