In this paper, we develop algorithms for distributed computation of averages of the node data over networks With arbitrary but fixed connectivity. The algorithms we develop are linear dynamical systems that generate s...
详细信息
In this paper, we develop algorithms for distributed computation of averages of the node data over networks With arbitrary but fixed connectivity. The algorithms we develop are linear dynamical systems that generate sequences of improving approximations to the desired computation at each node, via iterative processing and broadcasting. The algorithms are locally constructed at each node by exploiting only locally available and macroscopic information about the network topology. We present methods for optimizing the convergence rates of these algorithms to the desired computation, and evaluate their performance characteristics in the context of a problem of signal estimation from multinode noisy observations. By conducting simulations based on simple powerloss propagation models, we perform a preliminary comparison of the algorithms we develop against other types of distributed algorithms for computing averages, and identify transmit-power optimized algorithmic implementations as. a function of the size and density of the sensor network.
LiDAR technology has been a key component in the field of 3D mapping in recent years due to its relative advantages, such as high accuracy regardless of the environmental setting. Consequently, it has been utilized in...
详细信息
In this paper we propose a scheme for self-organizing sensornetworks;the scheme allows a sensor network to adapt to topological changes, include new batches of sensors, and disregard the sensors that have depleted th...
详细信息
ISBN:
(纸本)9781424416523
In this paper we propose a scheme for self-organizing sensornetworks;the scheme allows a sensor network to adapt to topological changes, include new batches of sensors, and disregard the sensors that have depleted their power reserves, or have been compromised. The algorithm for self-organization allows the sensor network to carry out its mission, has built-in provisions for information assurance, and extends the lifetime of the network by reducing the power consumption;it minimizes the number of collisions experienced by a sensor when it transmits and maximizes the time a sensor is either idle or dedicated to monitoring and/or internal data processing.
Many existing systems for sensornetworks rely on state information stored in the nodes for proper operation (e.g., pointers to parent in a spanning tree, routing information, etc). In dynamic environments, such syste...
详细信息
ISBN:
(纸本)1581138466
Many existing systems for sensornetworks rely on state information stored in the nodes for proper operation (e.g., pointers to parent in a spanning tree, routing information, etc). In dynamic environments, such systems must adopt failure recovery mechanisms, which significantly increase the complexity and impact the overall performance. In this paper, we investigate alternative schemes for query processing based on random walk techniques. The robustness of this approach under dynamics follows from the simplicity of the process, which only requires the connectivity of the neighborhood to keep moving. In addition we show that visiting a constant fraction of sensor network, say 80%, using a random walk is efficient in number of messages and sufficient for answering many interesting queries with high quality. Finally, the natural behavior of a random walk, also provide the important properties of load-balancing and scalability.
Most approaches to sensor data collection in the literature are based on a multihop wireless relay between sensor nodes forming an ad hoc network to reach a remote data-processing destination. In this paper, we propos...
详细信息
ISBN:
(纸本)1581138466
Most approaches to sensor data collection in the literature are based on a multihop wireless relay between sensor nodes forming an ad hoc network to reach a remote data-processing destination. In this paper, we propose an alternative Virtual Radar paradigm, which, in its most rudimentary form, is implementable with sensor nodes without networking capabilities. We introduce this concept for a simple setting in which each sensor only has one bit of information to send (e.g., indicating whether the level of a certain chemical has crossed a threshold). "Active" sensors (those which have one to send) respond to a beacon sent by the collector node, precisely timed with a trigger sequence in the beacon. The collector node uses a modified version of synthetic aperture radar processing to obtain an "image" of the activity in the sensor network.
One of the main issues with wireless sensornetworks (WSNs) is communication efficiency to reduce power consumption. This is often achieved through data routing with aggregation. However, aggregation does not consider...
详细信息
ISBN:
(纸本)9781424416875
One of the main issues with wireless sensornetworks (WSNs) is communication efficiency to reduce power consumption. This is often achieved through data routing with aggregation. However, aggregation does not consider possible measurements correlation. This a priori information can be used for data fusion, in order to remove correlation of transmitted data, thus reducing amount of information to be transmitted. In this paper we explore different informationprocessing strategy for state estimation of dynamic linear systems in the context of rooted wireless sensornetworks. We propose three data fusion methods: standard measurement aggregation, measurement fusion, and fusion of partial state estimates. These strategies are specifically designed to include possible delayed or dropped packets. Finally, they are compared in term of power consumption efficiency, estimation accuracy, computational and memory complexity, showing tradeoffs between these metrics.
Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node illegitimately claims multiple identities. Th...
详细信息
ISBN:
(纸本)1581138466
Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node illegitimately claims multiple identities. This paper systematically analyzes the threat posed by the Sybil attack to wireless sensornetworks. We demonstrate that the attack can be exceedingly detrimental to many important functions of the sensor network such as routing, resource allocation, misbehavior detection, etc. We establish a classification of different types of the Sybil attack, which enables us to better understand the threats posed by each type, and better design countermeasures against each type. We then propose several novel techniques to defend against the Sybil attack, and analyze their effectiveness quantitatively.
We propose a distributed on-demand power-management protocol for collecting data in sensornetworks. The protocol aims to reduce power consumption while supporting fluctuating demand in the network and provide local r...
详细信息
ISBN:
(纸本)1581138466
We propose a distributed on-demand power-management protocol for collecting data in sensornetworks. The protocol aims to reduce power consumption while supporting fluctuating demand in the network and provide local routing information and synchronicity without global control. Energy savings are achieved by powering down nodes during idle times identified through dynamic scheduling. We present a real implementation on wireless sensor nodes based on a novel, two-level architecture. We evaluate our approach through measurements and simulation, and show how the protocol allows adaptive scheduling and enables a smooth trade-off between energy savings and latency. An example current measurement shows an energy savings of 83% on an intermediate node.
We describe an SDP relaxation based method for the position estimation problem in wireless sensornetworks. The optimization problem is set up so as to minimize the error in sensor positions to fit distance measures. ...
详细信息
ISBN:
(纸本)1581138466
We describe an SDP relaxation based method for the position estimation problem in wireless sensornetworks. The optimization problem is set up so as to minimize the error in sensor positions to fit distance measures. Observable gauges are developed to check the quality of the point estimation of sensors or to detect erroneous sensors. The performance of this technique is highly satisfactory compared to other techniques. Very few anchor nodes are required to accurately estimate the position of all the unknown nodes in a network. Also the estimation errors are minimal even when the anchor nodes are not suitably placed within the network or the distance measurements are noisy.
Lattice networks are widely used in regular settings like grid computing, distributed control, satellite constellations, and sensornetworks. Thus, limits on capacity, optimal routing policies, and performance with fi...
详细信息
Lattice networks are widely used in regular settings like grid computing, distributed control, satellite constellations, and sensornetworks. Thus, limits on capacity, optimal routing policies, and performance with finite buffers are key issues and are addressed in this paper. In particular, we study the routing aigorithms that achieve the maximum rate per node for infinite and finite buffers in the nodes and different communication models, namely uniform communications, central data gathering and border data gathering. In the case of nodes with infinite buffers, we determine the capacity of the network and we characterize the set of optimal routing algorithms that achieve capacity. In the case of nodes with finite buffers, we approximate the queue network problem and obtain the distribution on the queue size at the nodes. This distribution allows us to study the effect of routing on the queue distribution and derive the algorithms that achieve the maximum rate.
暂无评论