stable route
Recently Published Documents


TOTAL DOCUMENTS

23
(FIVE YEARS 5)

H-INDEX

3
(FIVE YEARS 0)

2021 ◽  
Author(s):  
Zhengjie Luo ◽  
Tian Pan ◽  
Enge Song ◽  
Houtian Wang ◽  
Wenhao Xue ◽  
...  

2020 ◽  
Author(s):  
Alexis Buatois ◽  
Thibault Dubois ◽  
Mathieu Lihoreau

AbstractCentral place foraging pollinators, such as bees, tend to learn multi-destination routes (traplines) to efficiently visit known feeding locations and return to their nest. To what extent these routing behaviours are shared across species is unknown. Here we ran laboratory experiments to compare trapline formation and efficiency by foragers of two social bee species that differ in their collective foraging strategies: the solo foraging bumblebee Bombus terrestris and the mass foraging honey bee Apis mellifera. In a simple routing task with four artificial flowers, both bumblebees and honey bees developed a stable route, although honey bees were slower and less efficient to do so. In a more complex routing task with six flowers, only bumblebees developed a stable route. Honey bees took a longer time to discover all flowers and never integrated them in a single route. Simulations of a model of trapline formation show that these inter-specific differences can be replicated by adjusting the strength of a single learning parameter. Comparing bumblebees and honey bees in the same experimental conditions thus revealed key differences in their spatial foraging strategies, potentially driven by social constraints.


Paper Usually, Mobile Ad hoc Networks (MANET) is a dynamic background thus complicated to supply a perfect resolution to convince the Quality of Service (QoS) needs for many applications. In this paper, we introduce a mechanism, namely Bandwidth and Mobility based Stable Route (BMSR) Formation for increasing network efficiency in MANET. In this mechanism, we choose the relay node by the node mobility, bandwidth and quality of link. This mechanism considerably increases the node reliability and stability in the network. Thus it diminishes the probability of link breaks and the overhead. The simulation analysis indicates that the proposed method provides guarantee QoS and network efficiency.


Author(s):  
Hidayatul Akbar ◽  
Andy Hidayat Jatmika ◽  
Moh. Ali Albar

Destination-Sequenced Distance Vector Protocol (DSDV) is a proactive protocols available in Ad-Hoc mobile network where this protocol is not suitable for use on networks with high mobility because DSDV needs to update routing tables regularly if there is a link between nodes that is disconnected because there are nodes that move out of the transmission signal range and the AODV protocol is a protocol that matches high mobility because it is reactive. So that in a stable route search can be done by selecting a route that has a small chance of being interrupted. LET algorithm is used in the DSDV protocol to find the most stable route by knowing the estimated time between two nodes to remain connected based on the position, speed and range of the transmission signal then compared with the AODV routing protocol based on parameters such as throughput, packet delivery ratio and delay. The results showed that the S-DSDV routing protocol has better performance than the standard DSDV routing protocol. Key words : DSDV, Link Expiration Time, AODV, MANET, Routing Protocol


Sign in / Sign up

Export Citation Format

Share Document