Abstract. The accuracy of link-quality estimators (LQE) is missioncritical in many application scenarios in wireless sensor networks (WSN), since the link-quality metric is used for routing decisions or neighborhood formation. Link-quality estimation must offer validity for different timescales. Existing LQEs describe and approximate the current quality in a single value only. This method leads to a limited accuracy and expressiveness about the presumed future behavior of a link. The LQE developed in this paper incorporates four quality metrics that give a holistic assessment of the link and its dynamic behavior; therefore, this research is an important step to achieving a higher prediction accuracy including knowledge about the short-and long-term behavior.
A sustainable, uniform, and utility-maximizing operation of energy-harvesting sensor networks requires methods for aligning consumption with harvest. This article presents a lightweight algorithm for online load adaptation of energy-harvesting sensor nodes using supercapacitors as energy buffers. The algorithm capitalizes on the elementary relationship between state of charge and voltage that is characteristic for supercapacitors. It is particularly designed to handle the nonlinear system model, and it is lightweight enough to run on low-power sensor node hardware. We define two energy policies, evaluate their performance using real-world solar-harvesting traces, and analyze the influence of the supercapacitor’s capacity and imprecisions in harvest forecasts. To show the practical merit of our algorithm, we devise a load adaptation scheme for multihop data collection sensor networks and run a 4-week field test. The results show that (i) choosing a duty cycle a priori is infeasible, (ii) our algorithm increases the achievable work load of a node when using forecasts, (iii) uniform and steady operation is achieved, and (iv) depletion can be prevented in most cases.
Abstract. This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least once message delivery semantics in time O(n) using at most 4m messages of length O(lg n). The algorithm does not assume a FIFO rule for message delivery. Previously known algorithms either use longer messages or need more time. The algorithm meets the requirements of wireless senor networks and can be applied in several areas relevant to this field such as topology control, clustering, localization and virtual backbone calculations.
Let G be a finite soluble group with Fitting subgroup F(G). The Fitting series of G is defined, as usual, by F0(G) = 1 and Fi(G)/Fi−1(G) = F(G/Fi−1(G)) for i ≥ 1, and the Fitting height h = h(G) of G is the least integer such that Fn(G) = G. Suppose now that a finite soluble group A acts on G. Let k be the composition length of A, that is, the number of prime divisors (counting multiplicities) of |A|. There is a certain amount of evidence in favour of theCONJECTURE. |G:Fk(G)| is bounded by a number depending only on |A| and |CG(A)|.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.