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.
Unlike the telephone network or the Internet, many of the next generation networks are not engineered for the purpose of providing efficient communication between various networked entities. Examples abound: sensor networks, peer-to-peer networks, mobile networks of vehicles and social networks. Indeed, these emerging networks do require algorithms for communication, computation, or merely spreading...
Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption and radio interference, The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption...
Pattern recognition applications such as natural phenomena detection and structural health monitoring have been widely applied using wireless sensor networks. These applications involve large amount of data to be analysed, and thus incur high computational time and complexity. In this paper, we present a parallel associative memory-based pattern recognition algorithm known as distributed hierarchical...
GEM is an ingenious routing algorithm for wireless sensor networks that is based on the idea of graph embedding. However, it cannot survive edge failures well because reliability was not taken into consideration seriously when it was designed. In this paper, we propose UD-GEM, a GEM-based multi-path routing algorithm that improves the reliability performance of GEM significantly. Specifically, in...
Clustering sensors nodes as the basic of routing is an efficient mechanism for prolonging the lifetime of wireless sensor networks. In this paper, the high-efficient multilevel clustering is abstracted as a root tree which has the performances of the minimal relay set and the maximal weight according to graph theory. A mathematical model for the clustering virtual backbone is built. Based on the model,...
An important characteristic that distinguishes Wireless Sensor Networks (WSNs) from other distributed systems is their need for energy efficiency because sensors have finite energy reserve. Since there is no fixed infrastructure or centralized management in Wireless Sensor Networks (WSNs), a Connected Dominating Set (CDS) has been proposed as a virtual backbone. The CDS plays a major role in routing,...
Aiming at problems of communication conflict and network performance degradation resulted from excessive neighbor nodes, we present a degree-optimized LMPT topology control algorithm of wireless sensor networks. The algorithm builds the minimal energy topology based on shortest path theory, simultaneously uses the relative neighborhood graph method to control the number of neighbor nodes. The theoretical...
Topology control is a well-known strategy to save energy and extend the lifetime of wireless sensor networks. This paper introduces the A3 (a tree) algorithm, a simple, distributed, and energy-efficient topology construction mechanism that finds a sub-optimal Connected Dominating Set (CDS) to turn unnecessary nodes off while keeping the network connected and providing complete communication coverage...
Routing based on a Minimum Connected Dominating Set(MCDS) is a promising approach, where the search space for a route is reduced to nodes in the set (also called gateway nodes). This paper introduces a simple and efficient algorithm for calculating minimum connected dominating set with weight(WMCDS) in the topology graph G of a wireless sensor network. The maximum of the weight-based choice of gateway...
We propose a set of distributed algorithms for in-network path planning that enables a distributed sensor network navigation service in dynamic environments. Different from existing algorithms that use frequent or periodic flooding, our algorithms exploit geographic information of sensors to construct and maintain navigation links. Based on a partial reversal method of directed acyclic graphs, our...
We consider an optimization problem in wireless sensor networks (WSNs) that is to find a multicast tree with maximum lifetime. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, its high message complexity may prevent such contribution from being practically used in resource-constrained WSNs. In this paper, we proposed a new distributed algorithm...
We present a localized algorithm (LTCA) for topology control in wireless sensor networks which has certain desirable properties. First, the algorithm is very simple, strictly local (requires 1-hop information of neighbors) and fast, requiring each node to communicate with its neighbors exactly twice. Second, LTCA does not assume the underlying graph to be a unit disk graph, and in fact works on general...
A localization problem in wireless sensor and ad hoc networks can be solved using measured distances and/or directions between neighboring nodes as constraints. With the internode constraints only the relative localization problem can be solved, as for more specific absolute positions a set of prelocalized nodes, called anchors, is needed. In this paper, a new approach for designing and evaluating...
Clustering is an efficient and important method to facilitate energy conservation. Aiming to alleviate the high overheads of migrating management information in the re-clustering process of a clustering algorithm, an energy efficient, Complete Graph-based Clustering Algorithm (CGCA) is proposed in a densely deployed sensor network. CGCA divides the network into a few complete graphs, each complete...
Wireless sensor networks consist of a large number of sensor nodes with limited power and resource. To prolong network lifetime, the energy consumption must be somehow reduced. In this paper, we propose a localized density control algorithm for energy savings. The goals are to maintain a minimal number of active sensor nodes and to reduce radio-traffic intensity while conserving the sensing coverage...
Several efficient frequent subgraph mining algorithms have been recently proposed. However, the number of frequent graph patterns generated by these graph mining algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, we propose to summarize frequent graph patterns by a much smaller number of representative graph patterns. Several...
Recent advances have shown that channel codes can be mapped onto networks to realize efficient Network Coding (NC); this has led to the emergence of Code-on-Network-Graphs (CNG). Traditional CNG approaches (e.g Decentralized Erasure Codes) focus on a generating a sequence of encoded symbols from a given input source (of size K), such that the original symbols can be recovered from any subset of the...
Wireless sensor networks need very efficient network protocols due to the sensors' limited communication and computation capabilities. Network planarization - finding a planar subgraph of the network that contains all the nodes - has been a very important technique for many network protocols. It first became the foundation of various well known routing protocols, including GPSR, GOAFR and several...
Depth First Search (DFS) and position based routing algorithms were proposed in literature. These are localized algorithms that guarantee the delivery for connected ad hoc and sensor wireless networks modeled by arbitrary graphs, including inaccurate location information for a destination node. This paper first optimizes an existing DFS based routing scheme by eliminating from the candidate list neighbors...
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.