sensor networks have a wide range of potential, practical and useful applications. However, there are issues that need to be addressed for efficient operation of sensor network systems in real applications. To extend ...
详细信息
ISBN:
(纸本)9781424413119
sensor networks have a wide range of potential, practical and useful applications. However, there are issues that need to be addressed for efficient operation of sensor network systems in real applications. To extend the lifetime of a sensor network, clustering algorithm is a kind of key technique used to reduce energy consumption, which can increase network scalability and lifetime. In this paper, we proposed a distributed Energy Balance Clustering (DEBC) protocol for heterogeneous network. Cluster heads are selected by a probability depending on the ratio between remaining energy of node and the average energy of network. The high initial and remaining energy nodes have more chances to be the cluster heads than the low energy nodes. Simulation result shows that our protocol provides longer lifetime than the existing clustering protocol and uses the best of energy in heterogeneous network.
In this paper, focusing on the idea of establishing a more coherent and robust sensor uncertainty management framework, we first suggest that different levels of sensor data uncertainties need to be evaluated and orga...
详细信息
ISBN:
(纸本)9781424413119
In this paper, focusing on the idea of establishing a more coherent and robust sensor uncertainty management framework, we first suggest that different levels of sensor data uncertainties need to be evaluated and organized into a hierarchy. In particular, in consideration of the potential of distributed coordination among sensor nodes due to the inherent association between wireless sensor networks and multi-agent systems, also in a rough set technique sense under imprecision and partial truth, we further present an adaptive model of hierarchical sensor uncertainty coordination, which includes local data fusion, global and rational decision, along with conflict resolution. Experimental results of an example case study of our proposed approach demonstrate the practical application to the certainty improvement of noisy sensor readings.
With the rapid growth of wireless sensorsystems deployment, data quality has become a critical issue to the success of these applications. In this paper, we first raise the data quality problem in WSN. Then, we propo...
详细信息
Many self-configuration problems that occur in sensor networks, such as clustering or operator placement for in-network data aggregation, can be modeled as facility location problems. Unfortunately, existing distribut...
详细信息
ISBN:
(纸本)9783540730897
Many self-configuration problems that occur in sensor networks, such as clustering or operator placement for in-network data aggregation, can be modeled as facility location problems. Unfortunately, existing distributed facility location algorithms are hardly applicable to multi-hop sensor networks. Based on an existing centralized algorithm, we therefore devise equivalent distributed versions which, to our knowledge, represent the first distributed approximations of the facility location problem that can be practicably implemented in multi-hop sensor networks with local communication. Through simulation studies, we demonstrate that, for typical instances derived from sensor-network configuration problems, the algorithms terminate in only few communication rounds, the run-time does not increase with the network size, and, finally, that our implementation requires only local communication confined to small network neighborhoods. In addition, we propose simple extensions to our algorithms to support dynamic networks with varying link qualities and node additions and deletions. Using link quality traces collected from a real sensor network deployment, we demonstrate the effectiveness of our algorithms in realistic multi-hop sensor networks.
Our work addresses the spatiotemporally varying nature of data traffic in environmental monitoring and surveillance applications. By employing a network-controlled mobile basestation (MB), we present a simple energy-e...
详细信息
An important class of sensor network applications alms at estimating the spatiotemporal behavior of a physical phenomenon, such as temperature variations over an area of interest. These networks thereby essentially ac...
详细信息
ISBN:
(纸本)9783540730897
An important class of sensor network applications alms at estimating the spatiotemporal behavior of a physical phenomenon, such as temperature variations over an area of interest. These networks thereby essentially act as a distributed sampling system. However, unlike in the event detection class of sensor networks, the notion of sensing range is largely meaningless in this case. As a result, existing techniques to exploit sensing redundancy for event detection, which rely on the existence of such sensing range, become unusable. Instead, this paper presents a new method to exploit redundancy for the sampling class of applications, which adaptively selects the smallest set of reporting sensors to act as sampling points. By projecting the sensor space onto an equivalent Hilbert space, this method ensures sufficiently accurate sampling and interpolation, without a priori knowledge of the statistical structure of the physical process. Results are presented using synthetic sensor data and show significant reductions in the number of active sensors.
There has been increasing interest in wearable computing. In wearable computing environments, a wearable computer runs various applications with various sensors (wearable sensors). Since conventional wearable systems ...
详细信息
Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consumption. Thus using the spatial and temporal corr...
详细信息
ISBN:
(纸本)9783540730897
Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consumption. Thus using the spatial and temporal correlations that exist between adjacent nodes we appoint a few as representative nodes that perform in-network aggregation. This reduces the total number of transmissions. Our distributed scheduling algorithm autonomously assigns a particular node to perform aggregation and reassigns schedules when network topology changes. These topology changes are detected using cross-layer information from the underlying MAC layer. We also present theoretical performance estimates and upper bounds of our algorithm and evaluate it by implementing the algorithm on actual sensor nodes, demonstrating an energy-saving of up to 80% compared to raw data collection.
Context-aware services are one of the key applications in the ubiquitous computing environment where physical and virtual information are seamlessly integrated across the network. However, so far we have found few dis...
详细信息
A network community is a special sub-network that contains a group of nodes sharing similar linked patterns. A distributed network community mining problem (D-NCMP) is concerned with finding all such communities from ...
详细信息
ISBN:
(纸本)9780769529066
A network community is a special sub-network that contains a group of nodes sharing similar linked patterns. A distributed network community mining problem (D-NCMP) is concerned with finding all such communities from a distributed network. A variety of applications in W-W and ad-hoc networks such as P2P and sensor networks can be formulated into D-NCMPs, in which both resources and controls are distributed and/or decentralized The problem is difficult for some existing methods to deal with because of the fact that their required global topological representations of distributed networks are hard to obtain. In this paper, we present an autonomy oriented computing (AOC) approach [15], in which the nodes and links of a distributed network are distributed among a group of autonomous agents that collectively find global communities hidden in the network. In doing so, the agents maintain only their respective local views and update them through a proposed self-organization process. The effectiveness of the AOC based approach has been validated using network examples.
暂无评论