Fuzzy-Ant Colony based Routing on Road Networks

Author(s):  
S. Saravanan ◽  
A. Jayanthiladevi ◽  
M. Geetha

Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces the hierarchical community, is presented. It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant’s behavior in nature is applied to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic, efficient route computation on large road networks.

Author(s):  
S. Saravanan ◽  
A. Jayanthiladevi ◽  
M. Geetha

Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces the hierarchical community, is presented.  It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant’s behavior in nature is applied to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic, efficient route computation on large road networks.


2011 ◽  
Vol 225-226 ◽  
pp. 199-202
Author(s):  
Qui Yun Wu ◽  
Xiang Hui Liu ◽  
Ning Jing

A major challenge in sensor network is to preserve the coverage of the sensing network for the maximum possible time. When the density is sparse, coverage needs to be preserved by using energy-efficient route-selection algorithms. Coverage-preserving multi-path routing algorithm has been proposed that conserve energy while increasing the lifetime of routes and keep preserving network coverage.


2006 ◽  
Vol 63 (8) ◽  
pp. 1752-1762 ◽  
Author(s):  
Matthew L Keefer ◽  
Christopher C Caudill ◽  
Christopher A Peery ◽  
Theodore C Bjornn

Upstream-migrating adult salmon must make a series of correct navigation and route-selection decisions to successfully locate natal streams. In this field study, we examined factors influencing migration route selections early in the migration of 4361 radio-tagged adult Chinook salmon (Oncorhynchus tshawytscha) as they moved upstream past dams in the large (~1 km wide) Columbia River. Substantial behavioral differences were observed among 11 conspecific populations, despite largely concurrent migrations. At dams, Chinook salmon generally preferred ladder passage routes adjacent to the shoreline where their natal tributaries entered, and the degree of preference increased as salmon proximity to natal tributaries increased. Columbia River discharge also influenced route choices, explaining some route selection variability. We suggest that salmon detect lateral gradients in orientation cues across the Columbia River channel that are entrained within tributary plumes and that these gradients in cues can persist downstream for tens to hundreds of kilometres. Detection of tributary plumes in large river systems, using olfactory or other navigation cues, may facilitate efficient route selection and optimize energy conservation by long-distance migrants.


2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 81859-81874 ◽  
Author(s):  
Zhenchun Wei ◽  
Fei Liu ◽  
Xu Ding ◽  
Lin Feng ◽  
Zengwei Lyu ◽  
...  

Author(s):  
Nassir Sallom Kadhim ◽  
Muamer N. Mohammed ◽  
Mazlina Abdul Majid ◽  
Sinan Q. Mohamd ◽  
Hai Tao

Sign in / Sign up

Export Citation Format

Share Document