检索结果-内蒙古大学图书馆

3rd international symposium on information processing in sensor networks

作者： Kogekar, S Neema, S Eames, B Koutsoukos, X Ledeczi, A Maroti, M Vanderbilt Univ Dept Elect Engn & Comp Sci Inst Software Integrated Syst Nashville TN 37235 USA

ISBN: (纸本)1581138466

This paper presents an approach for dynamic software reconfiguration in sensor networks. Our approach utilizes explicit models of the design space of the embedded application, The design space is captured by formally modeling all the software components, their interfaces, and their composition. System requirements are expressed as formal constraints on QoS parameters that are measured at runtime. Reconfiguration is performed by transitioning from one point of the operation space to another based on the constraints. We demonstrate our approach using simulation results for a simple sensor network that performs one-dimensional tracking.

关键词： Runtime/Dynamic software reconfiguration design space exploration

来源：评论

学校读者我要写书评

暂无评论

Distributed beamforming for information transfer in sensor networks

Distributed beamforming for information transfer in sensor n...

引用

3rd international symposium on information processing in sensor networks

作者： Barriac, G Mudumbai, R Madhow, U Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)1581138466

Energy efficient transfer of data from sensors is a fundamental problem in sensor networks. In this paper, we propose a distributed beamforming approach to this problem, with a cluster of sensors emulating a centralized antenna array. While it is well-known that beamforming can provide large performance gains, such gains presuppose not only accurate knowledge of the channel, but also time and phase synchronization at the transmitter. We propose explicit methods for achieving such synchronization in a distributed fashion, and analyze the effects of various sources of coordination error on the attained performance. We find that, as long as the error in range measurements or placement of the sensor nodes is within a fraction of a carrier wavelength, the proposed distributed beamforming strategies achieve most of the gains available from a centralized beamformer.

关键词： sensors distributed beamforming synchronization

来源：评论

学校读者我要写书评

暂无评论

Recursive Secret Sharing for Distributed Storage and information Hiding

Recursive Secret Sharing for Distributed Storage and Informa...

引用

3rd international symposium on Advanced networks and Telecommunication Systems

作者： Parakh, Abhishek Kak, Subhash Oklahoma State Univ Dept Comp Sci Stillwater OK 74078 USA

ISBN: (纸本)9781424459896

This paper presents a recursive computational multi-secret sharing technique that hides k - 2 secrets of size b each into n shares of a single secret S of size b, such that any k of the n shares suffice to recreate the secret S as well as all the hidden secrets. This may act as a steganographic channel to transmit hidden information or used for authentication and verification of shares and the secret itself. Further, such a recursive technique may be used as a computational secret sharing technique that has potential applications in secure and reliable storage of information on the Web, in sensor networks and information dispersal schemes. The presented technique, unlike previous computational techniques, does not require the use of any encryption key or storage of public information.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

RoamHBA: Maintaining group connectivity in sensor networks

RoamHBA: Maintaining group connectivity in sensor networks

引用

3rd international symposium on information processing in sensor networks

作者： Fang, Q Liu, J Guibas, L Zhao, F Stanford Univ Dept Elect Engn Stanford CA 94305 USA

ISBN: (纸本)1581138466

This paper presents a new group communication scheme, roamingcast, for collaborative information processing in wireless sensor networks. Roamingcast enables efficient communication among a subset of mobile terminals in a collaboration group. Unicast and multicast communication can be considered as special cases of roamingcast in which the subset contains one and all group members, respectively. We propose a Roaming Hub Based Architecture (RoamHBA, pronounced as 'rumba') as one solution to support roamingcast. We present the distributed construction and dynamic update of a multicast tree, referred as the roaming hub. This roaming hub has the property that an average pair of terminals communicate using the hub with only constant degradation in path length compared to the best possible path. We have developed network layer protocols implementing this mechanism and evaluated their performance in comparison with roaming restricted flooding. We simulated our design using NS-2.

关键词： sensor networks network architecture network protocols applications of sensor networks

来源：评论

学校读者我要写书评

暂无评论

Quantized incremental algorithms for distributed optimization

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2005年第4期23卷 798-808页

作者： Rabbat, MG Nowak, rd Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA

Wireless sensor networks are capable of collecting an enormous amount of data. Often, the ultimate objective is to estimate a parameter or function from these data, and such estimators are typically the solution of an optimization problem (e.g., maximum likelihood, minimum mean-squared error, or maximum a posteriori). This paper investigates a general class of distributed optimization algorithms for "in-network" data processing, aimed at reducing the amount of energy and bandwidth used for communication. Our intuition tells us that processing the data in-network should, in general, require less energy than transmitting all of the data to a fusion center. In this paper, we address the questions: When, in fact, does in-network processing use less energy, and how much energy is saved.? The proposed distributed algorithms are based on incremental optimization methods. A parameter estimate,is circulated through the network, and along the way each node makes a small gradient descent-like adjustment to the estimate based only on its local data. Applying results from the theory of incremental subgradient optimization, we find that the distributed algorithms converge to an approximate solution for a broad class of problems. We extend these results to the case where the optimization variable is quantized before being transmitted to the next node and find that quantization does not affect the rate of convergence. Bounds on the number of incremental steps required for a certain level of accuracy provide insight into the tradeoff between estimation performance and communication overhead. Our main conclusion is that as the number of sensors in the network grows, in-network processing will always use less energy than a centralized algorithm, while maintaining a desired level of accuracy.

关键词： distributed algorithms energy-accuracy tradeoff gradient methods wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Distributed state representation for tracking problems in sensor networks

Distributed state representation for tracking problems in se...

引用

3rd international symposium on information processing in sensor networks

作者： Liu, J Chu, M Liu, J Reich, J Zhao, F Res Ctr Palo Alto CA 94304 USA

ISBN: (纸本)1581138466

This paper investigates the problem of designing decentralized representations to support monitoring and inferences in sensor networks. State-space models of physical phenomena such as those arising from tracking multiple interacting targets, while commonly used in signal processing and control, suffer from the curse of dimensionality as the number of phenomena of interest increases. Furthermore, mapping an inference algorithm onto a distributed sensor network must appropriately allocate scarce sensing and communication resources. We address the state-space explosion problem by developing a distributed state-space model that switches between factored and joint state spaces as appropriate. We develop a collaborative group abstraction as a mechanism to effectively support the information flow within and across subspaces of the state-space model, which can be efficiently supported in a communication-constrained network. The approach has been implemented and demonstrated in a simulation of tracking multiple interacting targets.

关键词： Ad hoc network information sensor network target localization multi-target tracking group collaboration

来源：评论

学校读者我要写书评

暂无评论

An energy conservation method for wireless sensor networks employing a blue noise spatial sampling technique

An energy conservation method for wireless sensor networks e...

引用

3rd international symposium on information processing in sensor networks

作者： Perillo, M Ignjatovic, Z Heinzelman, W Univ Rochester Dept Elect & Comp Engn Rochester NY 14627 USA

ISBN: (纸本)1581138466

In this work, we present a method for the selection of a subset of nodes in a wireless sensor network whose application is to reconstruct the image of a (spatially) bandlimited physical value (e.g., temperature). The selection method creates a sampling pattern based on blue noise masking and guarantees a near minimal number of activated sensors for a given signal-to-noise ratio. The selection method is further enhanced to guarantee that the sensor nodes with the least residual energy are the primary candidates for deselection, while enabling a tradeoff between sensor selection optimality and balanced load distribution. Simulation results show the effectiveness of these selection methods in improving signal-to-noise ratio and reducing the necessary number of active sensors compared with simpler selection approaches.

关键词： wireless sensor networks blue noise sensor management

来源：评论

学校读者我要写书评

暂无评论

Multi-hop communication is order-optimal for homogeneous sensor networks

Multi-hop communication is order-optimal for homogeneous sen...

引用

3rd international symposium on information processing in sensor networks

作者： Chakrabarti, A Sabharwal, A Aazhang, B Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA

ISBN: (纸本)1581138466

The main goal of this paper is to show that multi-hop single-user communication achieves the per node transport capacity of Theta(lnN/N) in homogeneous sensor networks, making it order-optimal. Our contributions in this paper are threefold. First, we construct a route-discovery and scheduling scheme based on spatial TDMA for sensor networks. Second, we show that our schedule achieves a per node transport capacity of Theta(lnN/N), the same as that achievable by beamforming. Third, we compare multi-hop communication and beamforming based methods in terms of the network power consumption required to attain a fixed throughput. Based on our power calculations, we conclude that if the channel attenuation is above a certain threshold (which we calculate), then multi-hop communication performs better, whereas below the threshold, beamforming is preferable.

关键词： sensor network communication power throughput transport capacity multi-hop beamforming schedule TDMA

来源：评论

学校读者我要写书评

暂无评论

sensor networks for vehicle dynamics control systems: A monitoring perspective

Sensor networks for vehicle dynamics control systems: A moni...

引用

3rd IEEE international symposium on Control, Communications and Signal processing (ISCCSP 2008)

作者： Rehm, Ansgar Univ Appl Sci Osnabruck D-49076 Osnabruck Germany

ISBN: (纸本)9781424416875

In modern vehicles an increasing number of control systems is based on measurements of signals describing vehicle dynamics. Correspondingly, a large number of sensors is required. To spare on weight and even more important on costs, car manufacturers require joint processing of sensors, i.e. the individual sensors related to certain control systems should become part of a sensor network. In the paper at hand the possibilities and shortcomings of such an approach are examined from a sensor monitoring and estimation perspective. Especially, redundant and model based failure detection are considered. The focus is on signals and sensors related to vehicle dynamics and the corresponding question of fall back strategies in case of sensor failure. Corresponding problems are addressed by a suitable sensor network architecture.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

Distributed particle filters for sensor networks

Distributed particle filters for sensor networks

引用

3rd international symposium on information processing in sensor networks

作者： Coates, M McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 2A7 Canada

ISBN: (纸本)1581138466

This paper describes two methodologies for performing distributed particle filtering in a sensor network. It considers the scenario in which a set of sensor nodes make multiple, noisy measurements of an underlying, time-varying state that describes the monitored system. The goal of the proposed algorithms is to perform on-line, distributed estimation of the current state at multiple sensor nodes, whilst attempting to minimize communication overhead. The first algorithm relies on likelihood factorization and the training of parametric models to approximate the likelihood factors. The second algorithm adds a predictive scalar quantizer training step into the more standard particle filtering framework, allowing adaptive encoding of the measurements. As its primary example, the paper describes the application of the quantization-based algorithm to tracking a manoeuvring object. The paper concludes with a discussion of the limitations of the presented technique and an indication of future avenues for enhancement.

关键词： particle filtering sensor network quantization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：