Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Wireless electroencephalogram (EEG) sensors have been successfully applied in many medical and computer brain interface classifications. A common characteristic of wireless EEG sensors is that they are low powered devices, and hence an efficient usage of sensor energy resources is critical for any practical application. One way of minimizing energy consumption by the EEG sensors is by reducing the...
A wireless sensor network is said to form a belt-barrier for a region if it is able to detect any object moving from outside the region to inside. Recently, Cheng and Tsai found if camera sensors are used to form a belt-barrier, the breadth of the barrier becomes an important quality factor to ensure high quality of monitoring (QoM). Then, they proposed the minimum β-breadth belt-barrier construction...
We consider the approximate sparse recovery problem in multi-hop Wireless Sensor Networks (WSNs) using Compressed Sensing/Compressive Sampling (CS). The goal is to recover the n-dimensional data values by querying only mnsensors based on some linear projection of sensor readings. To solve this problem, a distributed compressive sparse sampling(DCSS) algorithm is proposed based on sparse binary CSmeasurement...
Identifying codes have been proposed as an abstraction for implementing monitoring tasks such as indoor localization using wireless sensor networks. In this approach, sensors' radio coverage overlaps in unique ways over each identifiable region, according to the codewords of an identifying code. While connectivity of the underlying identifying code is necessary for routing data to a sink, existing...
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor knowledge of network structure. However, although gossip-based aggregation algorithms scale well for graphs with good expansion, their efficiency for sparse graphs is unexamined. In this paper we analyze the feasibility and...
Considering service semantic association degree, service quality and service composition efficiency, we used bipartite graph optimal matching algorithm to calculate the degree of semantic association and gave QoS (Quality of Service) model. On this basis, we proposed a Web service automatic composition algorithm AL-CWS and proved its validity. The test simulation proved that AL-CWS can automatically...
Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in the case of web services for which there is an abundance of reliable resources, in sensor networks, the resources are constrained and communication among nodes is error-prone and unreliable. Such a dynamic environment requires a continuous...
Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in distance measurements and we observe that a small number of outliers can degrade localization accuracy drastically. To deal with noisy and outlier ranging results, triangle inequality is often employed in existing approaches...
This paper introduces the problem of computing the shortest Euclidean path touring n disjoint circles in 2D. The problem is a generalization of Travelling Salesman Problem (TSP) in Euclidean 2D space and is not a purely combinatorial problem. Based on the author's previous work, this paper proposes an exact algorithm to solve the studied problem. The proposed algorithm can be conducted in layered...
Recent advances in systems of networked sensors have set the stage for smart environments which will have wide-ranging applications from intelligent wildlife monitoring to social applications such as health and elderly care service provisioning. Perhaps the most natural problem in sensor systems is the ??efficient?? propagation of a sensed local event. In order to address this problem, the notion...
Localization is an essential problem in wireless sensor networks (WSNs). Many localization algorithms have been proposed, but few efforts have been paid on theoretical analysis on the accuracy of these algorithms. Because it is naturally to formalize range-based localization problems as deterministic parameter estimation problems, for range-based localization algorithms Crameacuter-Rao lower bound...
Target coverage problem in wireless sensor networks remains a challenge. Due to nonlinear nature, previous work has mainly focused on heuristic algorithms, which remain difficult to characterize and have no performance guarantee. To solve the problem, this paper offers two important contributions. The first contribution is to have two lifetime upper bounds, which could be used to justify performance...
In this paper, we present a novel algorithm of connected dominating set based clustering in sensor networks. Considering the characteristics and location information of nodes in sensor networks, a modified directed transfer model of sensor networks, and a novel clustering algorithm based on area is proposed in this paper. Theoretical analyses and simulation results show that, the above new methods...
Proposed a new topology-control algorithms which is based on k-connectivity. In wireless sensor networks, the existing topology-control algorithms now can not meet the needs of WSN in fault tolerance, connectivity, redundancy and so on. In LKETA, the node deletes redundant edges according to the information of local neighbor nodes, and it adjusts transmission power with the power adjustment algorithm...
In energy constrained wireless sensor networks, it is important that a routing protocol provides network redundancy and reliability at a minimum energy consumption cost. To satisfy these conflicting constraints, wireless sensor networks (WSN) routing protocols generally employ a clustering algorithm in which the entire network does not have to be active at all times. In this paper, we propose a novel...
Key management schemes play an important role on the security issue in wireless sensor network and they are preconditions to secure communications among sensors. Using hypercube model, a new key management scheme is presented. The scheme utilizes the nice properties of hypercube to propose novel technologies of generating pairwise key and delivering cluster key. The scheme solves two problems mainly:...
In this paper we propose distributed storage algorithms for large-scale wireless sensor networks. Assume a wireless sensor network with n nodes that have limited power, memory, and bandwidth. Each node is capable of both sensing and storing data. Such sensor nodes might disappear from the network due to failures or battery depletion. Hence it is desired to design efficient schemes to collect data...
In sensor network applications that do complex in-network processing, each node may perform its own task rather than all nodes executing the same aggregation function. To support the development of such applications, this paper introduces a network-level programming model that is based on the data flow in the application. When deploying the application, such a high-level model has to be mapped to...
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which efficient algorithms can be designed but which must also reflect the complex physical constraints inherent in wireless networks, such as interferences, the lack of global knowledge, and purely local computations. As a tractable mathematical object, the unit disk graph (UDG) is...
We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighborhoods. However, it is shown by Kuhn et al. that such a design constraint results in a highly undesirable lower bound for routing performance: if a best route has length c, then in the worst case a route produced by any localized...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.