We present E(2)RINA, an aggregation algorithm for wireless sensor network applications characterized by clustered topologies, such as building automation and manufacturing plants. Thank to an efficient use of the wire...
详细信息
ISBN:
(纸本)9781424406586
We present E(2)RINA, an aggregation algorithm for wireless sensor network applications characterized by clustered topologies, such as building automation and manufacturing plants. Thank to an efficient use of the wireless channel, E(2)RINA offers the robustness of the gossip-basedalgorithms and, at the same time, the energy performance of the faster cluster head-basedalgorithms. We also developed a mathematical model to predict the performance of the algorithm with respect to the free variables without the need of extensive simulations. We validate our model and the robustness of E(2)RINA by running a simulation model of a test case consisting of a cluster of MICA nodes.
In this paper we consider the problem of load balancing over heterogeneous networks, i.e. networks whose nodes have different speeds. We assume that tasks are indivisible and with different weights. Our goal is that o...
详细信息
ISBN:
(纸本)9781424445233
In this paper we consider the problem of load balancing over heterogeneous networks, i.e. networks whose nodes have different speeds. We assume that tasks are indivisible and with different weights. Our goal is that of minimizing the maximum execution time over nodes. We provide a gossip-based distributed algorithm whose convergence to a bounded set is guaranteed. We show that the convergence time of the proposed algorithm relies ultimately on the average meeting time between two agents performing a random walk on a graph.
Callahan clarifies an important issue surrounding validation studies restricted to the review of cases having a particular coding algorithm to determine whether the condition represented by the codes truly exists. Dis...
详细信息
Callahan clarifies an important issue surrounding validation studies restricted to the review of cases having a particular coding algorithm to determine whether the condition represented by the codes truly exists. Disease prevalence in the population sampled for the validation is important.
Many self-organizing and self-adaptive systems use the biologically inspired "gradient" primitive, in which each device in a network estimates its distance to the closest device designated as a source of the...
详细信息
ISBN:
(纸本)9780769534046
Many self-organizing and self-adaptive systems use the biologically inspired "gradient" primitive, in which each device in a network estimates its distance to the closest device designated as a source of the gradient. Distance through the network is often used as a proxy for geometric distance, but the accuracy of this approximation has not previously been quantified well enough to allow predictions of the behavior of gradient-basedalgorithms. We address this need with an empirical characterization of the discretization error of gradient on random unit disc graphs. This characterization has uncovered two troublesome phenomena: an unsurprising dependence of error on source shape and an unexpected transient that becomes a major source of error at high device densities. Despite these obstacles, we are able to produce a quantitative model of discretization error for planar sources at moderate densities, which we validate by using it to predict error of gradient-basedalgorithms for finding bisectors and communication channels. Refinement and extension of the gradient discretization error model thus offers the prospect of greatly improving the engineerability of self-organizing systems on spatial networks.
暂无评论