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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,412 篇 会议
21 篇 期刊文献
16 册 图书

馆藏范围

1,449 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

931 篇 工学
- 600 篇 计算机科学与技术...
- 430 篇 信息与通信工程
- 313 篇 软件工程
- 303 篇 电气工程
- 113 篇 控制科学与工程
- 103 篇 测绘科学与技术
- 71 篇 仪器科学与技术
- 69 篇 机械工程
- 58 篇 电子科学与技术（可...
- 53 篇 动力工程及工程热...
- 29 篇 生物工程
- 28 篇 生物医学工程（可授...
- 17 篇 化学工程与技术
- 16 篇 光学工程
- 16 篇 材料科学与工程（可...
- 16 篇 建筑学
- 14 篇 农业工程
- 13 篇 土木工程
- 13 篇 环境科学与工程（可...
203 篇 理学
- 114 篇 数学
- 57 篇 物理学
- 37 篇 统计学（可授理学、...
- 31 篇 生物学
- 22 篇 化学
- 16 篇 系统科学
117 篇 管理学
- 72 篇 管理科学与工程(可...
- 54 篇 图书情报与档案管...
- 23 篇 工商管理
36 篇 医学
- 32 篇 临床医学
- 18 篇 基础医学(可授医学...
14 篇 农学
9 篇 经济学
4 篇 法学
2 篇 文学
2 篇 军事学

主题

351 篇 wireless sensor ...
85 篇 neural networks
75 篇 sensor networks
64 篇 monitoring
61 篇 wireless communi...
52 篇 sensor nodes
48 篇 computer network...
47 篇 sensor systems
45 篇 information proc...
43 篇 energy consumpti...
43 篇 sensor phenomena...
40 篇 signal processin...
36 篇 routing
36 篇 protocols
36 篇 energy efficienc...
30 篇 intelligent sens...
29 篇 costs
27 篇 artificial neura...
27 篇 sensors
26 篇 robustness

机构

10 篇 pengcheng labora...
10 篇 shenzhen interna...
10 篇 risc-v internati...
6 篇 school of inform...
5 篇 national enginee...
4 篇 department of el...
3 篇 university of sc...
3 篇 school of comput...
3 篇 college of infor...
3 篇 department of co...
3 篇 australian insti...
3 篇 department of el...
3 篇 wearable computi...
3 篇 national univers...
3 篇 univ windsor sch...
3 篇 univ melbourne d...
3 篇 school of engine...
3 篇 autonomous syste...
3 篇 university of ne...
3 篇 department of el...

作者

10 篇 xinlei chen
4 篇 pubudu n. pathir...
4 篇 el-marakby randa
4 篇 wendong xiao
4 篇 tong xinglin
4 篇 jiannong cao
3 篇 loke seng wai
3 篇 yan zhuo
3 篇 soman k. p.
3 篇 vinayakumar r.
3 篇 stuart kininmont...
3 篇 vetterli m
3 篇 chen-khong tham
3 篇 poornachandran p...
3 篇 xuzhe wang
3 篇 zhang xinman
3 篇 gianluigi ferrar...
3 篇 kininmonth stuar...
3 篇 krishnaswamy sho...
3 篇 tham chen-khong

语言

1,411 篇 英文
23 篇 中文
13 篇 其他
3 篇 土耳其文

检索条件"任意字段=3rd International Symposium on Information Processing in Sensor Networks"

共 1449 条记录，以下是1271-1280 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improved interval-based clock synchronization in sensor networks

Improved interval-based clock synchronization in sensor netw...

引用

3rd international symposium on information processing in sensor networks

作者： Blum, P Meier, L Thiele, L ETH Swiss Fed Inst Technol Comp Engn & Networks Lab CH-8092 Zurich Switzerland

ISBN: (纸本)1581138466

Interval-based synchronization provides the nodes of a distributed system with guaranteed bounds on a common time. This is a crucial piece of infrastructure in many distributed sensing and actuating systems. In this paper, we propose a modification to a known interval-based synchronization algorithm;our new algorithm obtains substantially better results in sensor-network scenarios by taking advantage of the typical drift diversity of the nodes' clocks. We propose a model for synchronization in ad-hoc, sporadic-communication scenarios. The model allows us to identify the worst and the best case in terms of achievable time uncertainty and to show the worst-case optimality of the discussed algorithms. Simulations show that in the average case, our modification significantly reduces the time uncertainty.

关键词： sensor networks time synchronization clock drift delay uncertainty

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Complexity constrained sensor networks: Achievable rates for two relay networks and generalizations

Complexity constrained sensor networks: Achievable rates for...

引用

3rd international symposium on information processing in sensor networks

作者： Mitra, U Sabharwal, A Univ So Calif Inst Commun Sci Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)1581138466

Motivated by limited computational resources in sensor nodes, the impact of complexity constraints on the communication efficiency of sensor networks is studied. A single-parameter characterization of processing limitation of nodes in sensor networks is invoked. Specifically, the relaying nodes are assumed to "donate" only a small part of their total processor time to relay other nodes information. The amount of donated processor time is modelled by the node's ability to decode a channel code reliably at given rate (R) over bar. Focusing on a four node network, with two relays, prior work for a complexity constrained single relay network is built upon. In the proposed coding scheme, the transmitter sends a broadcast code such that the relays decode only the "coarse" information, and assist the receiver in removing ambiguity only in that information. Via numerical examples, the impact of different power constraints in the system, ranging from per node power bound to network wide power constraint is explored. As the complexity bound (R) over bar increases, the proposed scheme becomes identical to the recently proposed achievable rate by Gupta & Kumar. Both discrete memoryless and Gaussian channels are considered.

关键词： information theory relay networks sensor networks achievable rates channel capacity ad hoc wireless networks complexity constraints limited code rate

来源：评论

学校读者我要写书评

暂无评论

Loss inference in wireless sensor networks based on data aggregation

Loss inference in wireless sensor networks based on data agg...

引用

3rd international symposium on information processing in sensor networks

作者： Hartl, G Li, BC Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

ISBN: (纸本)1581138466

In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of inferring loss rates during the aggregation of data from a collection of sensor nodes to a sink node. Previous work has studied the general problem of network inference, which considers the cases of inferring link-based metrics in wireline networks. We show how to adapt previous work on network inference so that loss rates in wireless sensor networks may be inferred as well. This includes (1) considering the pernode, instead of per-link, loss rates;and (2) taking into account the unique characteristics of wireless sensor networks. We formulate the problem as a Maximum-Likelihood Estimation (MLE) problem and show how it can be efficiently solved using the Expectation-Maximization (EM) algorithm. The results of the inference procedure may then be utilized in various ways to effectively streamline the data collection process. Finally, we validate our analysis through simulations.

关键词： sensor networks tomography data aggregation

来源：评论

学校读者我要写书评

暂无评论

Robust distributed estimation in sensor networks using the embedded polygons algorithm

Robust distributed estimation in sensor networks using the e...

引用

3rd international symposium on information processing in sensor networks

作者： Delouille, V Neelamani, R Baraniuk, R Rice Univ ECE Dept Houston TX 77251 USA

ISBN: (纸本)1581138466

We propose a new iterative distributed algorithm for linear minimum mean-squared-error (LMMSE) estimation in sensor networks whose measurements follow a Gaussian hidden Markov graphical model with cycles. The embedded polygons algorithm decomposes a loopy graphical model into a number of linked embedded polygons and then applies a parallel block Gauss-Seidel iteration comprising local LMMSE estimation on each polygon (involving inversion of a small matrix) followed by an information exchange between neighboring nodes and polygons. The algorithm is robust to temporary communication faults such as link failures and sleeping nodes and enjoys guaranteed convergence under mild conditions. A simulation study indicates that energy consumption for iterative estimation increases substantially as more links fail or nodes sleep. Thus, somewhat surprisingly, energy conservation strategies such as low-powered transmission and aggressive sleep schedules could actually be counterproductive.

关键词： sensor networks distributed estimation graphical models hidden Markov models Wiener filter matrix splitting

来源：评论

学校读者我要写书评

暂无评论

On the effect of localization errors on geographic face routing in sensor networks

On the effect of localization errors on geographic face rout...

引用

3rd international symposium on information processing in sensor networks

作者： Seada, K Helmy, A Govindan, R Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)1581138466

In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects of location errors on geographic routing have not been studied before. In this work we provide a detailed analysis of the effects of location errors on the correctness and performance of geographic routing in static sensor networks. First, we perform a micro-level behavioral analysis to identify the possible protocol error scenarios and their conditions and bounds. Then, we present results from an extensive simulation study of GPSR and GHT to quantify the performance degradation due to location errors. Our results show that even small location errors (of 10% of the radio range or less) can in fact lead to incorrect (non-recoverable) geographic routing with noticeable performance degradation. We then introduce a simple modification for face routing that eliminates probable errors and leads to near perfect performance.

关键词： geographic routing face routing localization inaccuracy location errors wireless sensor networks data-centric storage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共145页 << < 124 125 126 127 128 129 130 131 132 133 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：