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.
Abstract. Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of wireless communication can lead to situations, where nodes lose synchrony and programs reach arbitrary states. Traditional approaches to fault tolerance like replication or global resets are not feasible. In this work, the concept of self-stabilization is applied to WSNs. The majority of self-stabilizing algorithms found in the literature is based on models not suitable for WSNs: shared memory model, central daemon scheduler, unique processor identifiers, and atomicity. This paper proposes problem-independent transformations for algorithms that stabilize under the central daemon scheduler such that they meet the demands of a WSN. The transformed algorithms use randomization and are probabilistically self-stabilizing. This work allows to utilize many known self-stabilizing algorithms in WSNs. The proposed transformations are evaluated using simulations and a real WSN.
Abstract-Energy-efficient transportation of periodical sensor readings towards a single sink in wireless sensor networks is a challenging task. In general, two data-gathering strategies exist: on-demand and bulk data forwarding. For both strategies, cross-layer techniques are a promising approach, where TDMA is tailored to the underlying routing tree. Therefore, different TDMA schemes are compared regarding achievable throughput, packet delay, and energy-efficiency for various sampling rates and scenarios. Existing schemes perform well in dedicated topologies only. The new and simple TDMA scheme presented in this paper outperforms its predecessors in all scenarios under consideration. These findings are substantiated by both theoretical analysis and extensive simulation.
Complex networks are known to be vulnerable to the failure of components in terms of structural robustness. An as yet less researched topic is dynamical robustness, which refers to the ability of a network to maintain its dynamical activity against local disturbances. This paper introduces a new type of attack-the overload attack-to disturb the network's dynamical activity. The attack is based on the load redistribution model for sequential attacks. The main contribution are heuristics to assess the vulnerability of complex networks with respect to this type of attack. The effectiveness of the heuristics is demonstrated with an application for real power networks.
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.