In this paper, we study the integration between Compressed Sensing (CS) and clustering methods in Wireless sensor Networks (WSNs) that significantly reduce power consumption for the networks. In theory, a base station...
详细信息
ISBN:
(纸本)9781479946181
In this paper, we study the integration between Compressed Sensing (CS) and clustering methods in Wireless sensor Networks (WSNs) that significantly reduce power consumption for the networks. In theory, a base station (BS) needs to collect M measurements from the network with N sensors, then applies CS to obtain precisely all N sensor readings. In clustered networks, a cluster-head (CH) collects data from non-CH sensors in its cluster, adds all received and its own data and then sends the combined measurement to the BS. We further analyze the clustered network withthe measurement matrix created by clustering methods, and formulate the total power consumption. Finally, we suggest the optimal number of clusters for the networks to consume the least power in practice.
Wireless sensor networks (WSNs) are currently employed in a vast number of different applications ranging from home automation and health care to military systems. Although their application may vary greatly, WSNs sha...
详细信息
ISBN:
(纸本)9781479946181
Wireless sensor networks (WSNs) are currently employed in a vast number of different applications ranging from home automation and health care to military systems. Although their application may vary greatly, WSNs share a common set of characteristics such as a limited energy supply and simple hardware. A common issue related withthe application of WSNs is sensor localization, for some types of applications it is important that the sensors know the relative or absolute position of other sensors in the network, such as surveillance of monitoring networks. If sensors are randomly placed they may resort a wide range of methods such as Global Navigation Satellite systems (GNSS) or received signal strength indicators (RSSI). In this work we present an alternative to relative sensor localization by employed a crossed dipole antenna in the reception and a known polarization in the transmission. the accuracy of the proposed methods is measured trough numerical simulations and results are presented.
Low power radios, such as the CC2420, have been widely popular with recent sensor platforms. this paper explores the potential for energy savings from adding a high-power high-bandwidth, radio to current sensor platfo...
详细信息
ISBN:
(纸本)9781424431748
Low power radios, such as the CC2420, have been widely popular with recent sensor platforms. this paper explores the potential for energy savings from adding a high-power high-bandwidth, radio to current sensor platforms. High-bandwidth radios consume more power but significantly reduce the time for transmissions. Consequently, they offer net savings in total communication energy when there is enough data to offset wake-up energy overhead. the analysis on energy characteristics of several ieee 802.11 radios show that a feasible crossover point exists (in terms of data size) after which energy savings are possible. Based on this analysis, we present a bulk data transmission protocol for dual radio systems. the results of simulations and prototype implementation show significant energy savings at the expense of introducing acceptable delay.
distributed Effect Evaluation Algorithm of the computer English online platform based on Hibernate Task-based Data Architecture is studied in this paper. the image file generated by the CIAB method does not store the ...
详细信息
Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. this is mainly due to the resource-restricted nature of w...
详细信息
ISBN:
(纸本)9781457705137
Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. this is mainly due to the resource-restricted nature of wireless devices, such as sensor nodes, and the error-prone character of the communication medium. this work introduces and evaluates a new local, probabilistic self-stabilizing algorithm providing fault-tolerance and scalability for networks of high density.
We revisit the classic object tracking problem with a novel and effective, yet straightforward distributed solution for resource-lean devices. the difficulty of object tracking lies in the mismatch between the limited...
详细信息
ISBN:
(纸本)9781479946181
We revisit the classic object tracking problem with a novel and effective, yet straightforward distributed solution for resource-lean devices. the difficulty of object tracking lies in the mismatch between the limited computational capacity of typical sensor nodes and the processing requirements of typical tracking algorithms. In this paper, we introduce an in-network system for tracking mobile objects using resource-lean sensors. the system is based on a distributed, dynamically-scoped tracking algorithm which alters the event detection region and reporting rate based on object speed. A leader node records the detected samples across the event region and estimates the object's location in situ. We study the performance of our tracking implementation on an 80-node testbed. the results show that it achieves high performance, even for very fast objects, and is readily implemented on resource-lean sensors. While the area is well-studied, the unique combination of algorithmic features represents a significant addition to the literature.
In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC). Our first algorithm...
详细信息
ISBN:
(纸本)9780769547077
In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC). Our first algorithm computes a planar 2-spanner under light constraints on the edge lengths and induces a total exchange of at most 6n node identifiers. Its total computational complexity is O(n Delta), with Delta the maximum degree of the communication graph. the second algorithm that we present is a simple and efficient algorithm to route messages in this planar graph that requires routing tables with only three entries. We support these theoretical results by simulations showing the robustness of our algorithms when the coordinates are inaccurate.
Recently proposed applications for monitoring the behavior of real-world crowds with wireless sensor nodes rely on decentralized in-network aggregation. Although some of the aggregation algorithms for wireless sensor ...
详细信息
ISBN:
(纸本)9781479946181
Recently proposed applications for monitoring the behavior of real-world crowds with wireless sensor nodes rely on decentralized in-network aggregation. Although some of the aggregation algorithms for wireless sensor networks seem appealing for such applications, we are not aware of any deployments of these algorithms in real-world scenarios with crowd mobility. As a step toward filling this gap, we thus discuss our experiences with decentralized in-network aggregation from a few such deployments involving up to 177 nodes. We compare two main classes of algorithms for basic aggregates. We show that algorithms based on probabilistic, order- and duplicate-insensitive sketches outperform algorithms based on gradual variance reduction. To this end, however, they have to be adapted considerably to minimize the traffic, latency, and errors of the aggregation process, and to account for some real-world issues. In short, while the algorithms do have a potential for the envisioned crowd-monitoring applications, deploying them is not trivial.
In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. these processes are well-understood in...
详细信息
ISBN:
(纸本)9781728105703
In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. these processes are well-understood in standard peer-to-peer network models, but little is known about their behavior in models that abstract the smartphone peer-to-peer setting. Withthis in mind, we begin by studying a simple random gossip process in the synchronous mobile telephone model (the most common abstraction used to study smartphone peer-to-peer systems). We prove that the simple process is actually more efficient than the best-known gossip algorithm in the mobile telephone model, which required complicated coordination among the nodes in the network. We then introduce a novel variation of the mobile telephone model that removes the synchronized round assumption, shrinking the gap between theory and practice. We prove that simple random gossip processes still converge in this setting and that information spreading still improves along with graph connectivity.
Air pollution has become a major issue of modern megalopolis because of industrial emissions and increasing urbanization along with traffic jams and heating/cooling of buildings. Monitoring urban air quality is theref...
详细信息
ISBN:
(纸本)9781509014590
Air pollution has become a major issue of modern megalopolis because of industrial emissions and increasing urbanization along with traffic jams and heating/cooling of buildings. Monitoring urban air quality is therefore required by municipalities and by the civil society. Current monitoring systems rely on reference sensing stations that are precise but massive, costly and therefore seldom. In this ongoing work, we focus on an alternative or complementary approach, using a network of low cost and autonomic wireless sensors, allowing for a finer spatiotemporal granularity of air quality sensing. We tackle the optimization problem of sensor deployment and propose an integer programming model, which allows to find the optimal network topology while ensuring air quality monitoring with a high precision and the minimum financial cost. Most of existing deployment models of wireless sensor networks are generic and assume that sensors have a given detection range. this assumption does not fit pollutant concentrations sensing. Our model takes into account interpolation methods to place sensors in such a way that pollution concentration is estimated with a bounded error at locations where no sensor is deployed.
暂无评论