نتایج جستجو برای: hops

تعداد نتایج: 3627  

Journal: :Wireless Sensor Network 2010
Hannan Xiao Ying Zhang James A. Malcolm Bruce Christianson Kee Chaing Chua

Researchers have used extensive simulation and experimental studies to understand TCP performance in wireless multihop networks. In contrast, the objective of this paper is to theoretically analyze TCP performance in this environment. By examining the case of running one TCP session over a string topology, a system model for analyzing TCP performance in multihop wireless networks is proposed, w...

Journal: :Horticulturae 2023

The interest in the production of hops Brazil, motivated by third position world ranking beer producers and growth craft brewery business, justifies intensification studies into its adaptation to local growing conditions. Due high internal demand, aim this study was evaluate phytochemical profiles hop varieties grown subtropical conditions under different cropping systems. Studies that promote ...

2016
Laetitia Bocquet Ali Siah Jennifer Samaillie Jean-Louis Hilbert Patrice Halama Sevser Sahpaz Céline Rivière

Searching for alternative methods to conventional pesticides against crop pathogens is an important challenge. In this way, we tested the potential of hops extracts to be used as a bio-fungicide towards Zymoseptoria tritici, the main pathogen on wheat crops in France and Europe. Hops is known for its numerous biological properties such as antiviral, antibacterial and antifungal potential for hu...

2016
Stefano Cagnoni Monica Mordonini Luca Mussi Giovanni Adorni

• Awareness: natural or artificial agents operating in dynamic environments can benefit from a, possibly rough, global description of the surroundings. In human this is referred to as peripheral vision, since it derives from stimuli coming from the edge of the retina. • Attention: once an interesting object/event has been detected, higher resolution is required to set focus on it and plan an ap...

1999
Peter Talkner Eli Hershkovitz Eli Pollak

A theory is presented for the diffusion coefficient and the hopping distribution of an adatom on a surface in the presence of external fields. Relatively simple expressions are derived for the probability of multiple hops in the exponential hopping limit. This limit is the one which is usually found in the diffusion of a metal atom on a metal surface. In this limit the barrier height (in units ...

Journal: :Inf. Process. Lett. 2008
Li Sun Fuji Zhang Jianguo Qian

This paper considers the wavelength assignment problem for Cartesian product networks with multi-hops. An upper bound of the (uniform) wavelength index for Cartesian product networks with single-hop is established. This result leads to a consequence for the nth power of an arbitrary network with k-hops. In particular, if k = 1, this bound partially generalizes the results of Pankaj [R.K. Pankaj...

2003
Moni Naor Udi Wieder

Greedy routing is a common approach when a graph has some underlying metric. We present an approach for designing routing algorithms called NoN-Greedy (Neighbor-of-Neighbor). We show that in two settings it reduces significantly the number of hops taken before the destination is reached and can yield degree optimal routing (in a network of degree O(log n) this means O(log / log logn) hops). In ...

2010
Mehdi Bezahaf Luigi Iannone Marcelo Dias de Amorim Serge Fdida

By nature, links in multi-hop wireless networks have an unpredictable behavior, which directly affects the stability of routes. In this paper, we investigate the stability of the network by addressing some interesting questions related to the presence of both dominant and subdominant routes between nodes, in a real deployment. We focus on the persistence of the dominant route and the first four...

2008
Shiping Chen Yuan Li Kaihua Rao Lei Zhao Tao Li Shigang Chen

Most existing P2P networks route requests in ) kN ( O k 1 , ) N (log O , ) k log / N (log O hops, where N is the number of participating nodes and k is an adjustable parameter. Although some can achieve ) d ( O -hop routing for a constant d by tuning the parameter k , the neighbor locations however become a function of N , causing considerable maintenance overhead if the user base is highly dyn...

Journal: :Computer Networks 2007
Serdar Vural Eylem Ekici

In spatially random sensor networks, estimating the Euclidean distance covered by a packet in a given number of hops carries a high importance for various functions such as localization and distance estimations. The inaccuracies in such estimations motivate this study on the distribution of the Euclidean distance covered by a packet in spatially random sensor networks in a given number of hops....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید