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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,663 篇 会议
35 篇 期刊文献
7 册 图书

馆藏范围

5,705 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,351 篇 工学
- 3,354 篇 计算机科学与技术...
- 1,741 篇 电气工程
- 1,630 篇 信息与通信工程
- 1,221 篇 软件工程
- 650 篇 控制科学与工程
- 353 篇 测绘科学与技术
- 345 篇 动力工程及工程热...
- 270 篇 机械工程
- 219 篇 电子科学与技术（可...
- 200 篇 仪器科学与技术
- 117 篇 石油与天然气工程
- 107 篇 化学工程与技术
- 105 篇 安全科学与工程
- 92 篇 生物工程
- 82 篇 网络空间安全
- 75 篇 材料科学与工程（可...
- 74 篇 交通运输工程
- 69 篇 生物医学工程（可授...
- 57 篇 土木工程
- 56 篇 建筑学
797 篇 理学
- 403 篇 数学
- 165 篇 物理学
- 135 篇 化学
- 109 篇 生物学
- 94 篇 系统科学
- 94 篇 统计学（可授理学、...
561 篇 管理学
- 403 篇 管理科学与工程(可...
- 223 篇 图书情报与档案管...
- 154 篇 工商管理
94 篇 医学
- 84 篇 临床医学
62 篇 法学
58 篇 经济学
38 篇 农学
17 篇 教育学
17 篇 军事学
7 篇 文学
3 篇 艺术学

主题

1,054 篇 wireless sensor ...
177 篇 sensor systems
164 篇 sensor nodes
157 篇 wireless sensor ...
157 篇 distributed comp...
151 篇 wireless communi...
150 篇 sensors
143 篇 monitoring
143 篇 sensor networks
126 篇 cloud computing
117 篇 protocols
116 篇 internet of thin...
113 篇 routing
108 篇 distributed comp...
105 篇 energy efficienc...
87 篇 energy consumpti...
75 篇 optimization
75 篇 sensor phenomena...
75 篇 distributed data...
74 篇 security

机构

14 篇 shanghai jiao to...
10 篇 nanjing univ sta...
10 篇 tu wien distribu...
9 篇 suny stony brook...
9 篇 institute of com...
7 篇 department of co...
7 篇 missouri univ sc...
7 篇 state key labora...
7 篇 univ virginia de...
6 篇 nanjing universi...
6 篇 department of co...
6 篇 automation and c...
6 篇 ieee
6 篇 shihezi universi...
6 篇 carnegie mellon ...
6 篇 imperial coll lo...
6 篇 chinese academy ...
5 篇 nanjing univ pos...
5 篇 univ sci & techn...
5 篇 hong kong polyte...

作者

14 篇 wang wei
13 篇 dustdar schahram
11 篇 wu jie
11 篇 cao jiannong
10 篇 stankovic john a...
10 篇 beigl michael
10 篇 agrawal dharma p...
9 篇 bar-noy amotz
9 篇 voigt thiemo
9 篇 wang cong
9 篇 rothermel kurt
8 篇 vassiliou vasos
8 篇 rinner bernhard
8 篇 kulau ulf
8 篇 wolf lars
8 篇 nikoletseas soti...
8 篇 abdelzaher tarek
8 篇 chen guihai
8 篇 liu yunhao
7 篇 roedig utz

语言

5,604 篇 英文
89 篇 其他
13 篇 中文
1 篇 俄文

检索条件"任意字段=5th IEEE International Conference on Distributed Computing in Sensor Systems"

共 5705 条记录，以下是4761-4770 订阅

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

详细简洁

排序：

Pair-wise network topology authenticated hybrid cryptographic keys for Wireless sensor Networks using vector algebra

Pair-wise network topology authenticated hybrid cryptographi...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Marco Pugliese Fortunato Santucci Center of Excellence DEWS University of L'' Aquila L'Aquila Italy

this paper proposes a novel hybrid cryptographic scheme for the generation of pair-wise network topology authenticated (TAK) keys in a Wireless sensor Network (WSN) using vector algebra in GF(q). the proposed scheme is deterministic, pair-wise keys are not pre-distributed but generated starting from partial key components, keys management exploits benefits from both symmetric and asymmetric schemes (hybrid cryptography) and each key in a pair node can be generated only if nodes have been authenticated (key authentication). Network topology authentication, and hybrid key cryptography are the building blocks for this proposal: the former means that a cryptographic key can be generated if and only if the current network topology is compliant to the ldquoplanned network topologyrdquo, which acts as the authenticated reference; the latter means that the proposed scheme is a combination of features from symmetric (for the ciphering and authentication model) and asymmetric cryptography (for the key generation model). the proposal fits the security requirement of a cryptographic scheme for WSN in a limited computing resource. A deep quantitative security analysis has been carried out. Moreover the cost analysis of the scheme in terms of computational time and memory usage for each node has been carried on and reported for the case of a 128-bit key.

关键词： Network topology Cryptography Topology Authentication Wireless sensor networks Security Algebra

来源：评论

学校读者我要写书评

暂无评论

Context-aware QoI computation in multi-sensor systems

Context-aware QoI computation in multi-sensor systems

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： M. Anwar Hossain Pradeep K. Atrey Abdulmotaleb El Saddik MCRLab SITE University of Ottawa Ottawa ONT Canada Department Applied Computer Science University of Winnipeg Winnipeg MAN Canada

Multi-sensor systems are increasingly being deployed in many application scenarios due to the enormous potential they can offer. However, as the processing of sensory data often results in imprecise outcome, measuring the quality of information (QoI) in these systems has become an important issue. the measurement of QoI is usually performed by processing the elementary data provided by the heterogeneous sensors, which is also influenced by the techniques involved in sensor management. However, the effect of context, such as environmental geometry, sensor placement, orientation, time, and other parameters in computing QoI has not yet been explored extensively in the literature. this paper proposes a context evolution model and studies its impact in the QoI computation. In particular, we show that the dynamic context information can be utilized to manage a multi-sensor system to improve its QoI.

关键词： sensors Lighting sensor phenomena and characterization sensor systems Image sensors Cameras Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Behavior Description Algorithm based on Home sensor data using Nonlinear Transformations

Behavior Description Algorithm based on Home Sensor data usi...

引用

5th international conference on Networked Sensing systems

作者： Fujii, Akinori Mori, Taketoshi Noguchi, Hiroshi Shimosaka, Masamichi Baba, Akira Sato, Tomomasa Univ Tokyo Bunkyo Ku Tokyo 1138656 Japan

ISBN: (纸本)9784907764319

this paper presents a behavior description algorithm from time-series data on daily life activities extracted using home sensors. In a previous work, we proposed a method of time-series data clustering based on Hidden Markov Models (HMMs). this method separates the time-series data in segments of equally short length, and applies a behavior label for each segment. However, the change points of behaviors are not clear and it is difficult to detect short length behavior. In this paper, we propose a new behavior description algorithm by introducing Singular Spectrum Transformation (SST), a nonlinear transformation used for change-point detection, and apply it to our previous method. this method enables more precise change-point detection and behavior labeling.

关键词： Change-Point Detection Behavior Labeling Singular Spectrum Transformation Hidden Markov Model Sensing Room

来源：评论

学校读者我要写书评

暂无评论

GPEB: Power-efficient geographic broadcasting in sensor networks

GPEB: Power-efficient geographic broadcasting in sensor netw...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Shibo Wu K. Selcuk Candan School of Computing and Informatics Arizona State University USA

Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. In this paper, we study the power efficiency issues related to geographic broadcast protocols in wireless sensor networks. Specifically, we study the problems in existing flooding based and pruning based broadcast algorithm and propose a new geographic power efficient broadcast algorithm to reduce the overlaps of broadcast coverage area and thus the total power consumption. the proposed algorithm is a hybrid protocol that combines broadcasts of maximum transmission radio range and forwards of much smaller transmission radio range. through simulation, we show that the GPEB protocol proposed in this paper can save total power consumption up to 23% compared to existing geographic broadcast protocols.

关键词： Power demand Protocols Distance measurement Floods Wireless sensor networks Broadcasting Redundancy

来源：评论

学校读者我要写书评

暂无评论

Quality-driven congestion control for target tracking in wireless sensor networks

Quality-driven congestion control for target tracking in wir...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Lei Chen Boleslaw K. Szymanski Joel W. Branch Rensselaer Polytechnic Institute Troy NY USA IBM Thomas J. Watson Research Center Hawthorne NY USA

this paper describes initial research in addressing the challenges of managing quality of information for wireless sensor network target tracking with multiple missions of various priorities tracking multiple targets. We address the use of a distributed market-based mechanism to equalize the information value loss (that itself is a function of quality of information (QoI)) of tracked targets across multiple tracking missions while managing network congestion arising as a result of tracking. this includes considering missionspsila priorities and starvation of missionspsila data updates. In support of this approach, we define QoI as a function of the precision of position prediction of a tracked target and the loss of information value as the product of QoI and the priority of the mission tracking the target.

关键词： Target tracking Delay Wireless sensor networks Position measurement Bandwidth Loss measurement Resource management

来源：评论

学校读者我要写书评

暂无评论

Adaptive QoS routing for significant events in wireless sensor networks

Adaptive QoS routing for significant events in wireless sens...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Erol Gelenbe Edith C.-H. Ngai Department of Electrical and Electronic Engineering Imperial College London

Wireless sensor networks (WSN) can report large volumes of slowly varying routine data, while important or significant events can be relatively rare. An important challenge is then to offer the significant or unusual data an adequate routing policy that will allow it to rapidly reach the sink nodes, despite the large volume of routine packets in the network. In this paper we introduce randomized re-routing (RRR), to detect the unusual events in a distributed manner, and dynamically transfer routine data packets to secondary paths in the network, while offering a fast track path with better QoS for the packets carrying unusual data. In this paper we describe the RRR algorithm and evaluate it with extensive simulations.

关键词： Wireless sensor networks Quality of service Delay Routing Transient analysis Monitoring Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Constant Factor Localized Algorithm for computing Connected Dominating Sets in Wireless sensor Networks

A Constant Factor Localized Algorithm for Computing Connecte...

引用

international conference on Parallel and distributed systems (ICPADS)

作者： Kamrul Islam Selim G. Akl Henk Meijer School of Computing Queen''s University Kingston ONT Canada

Connected dominating sets (CDSs) are probably the most common way of constructing virtual backbones for broadcasting operation in wireless sensor networks. this is because such backbones guarantee to reduce unnecessary message transmissions or flooding in the network. In this paper we propose a simple localized algorithm to construct a small-sized CDS. Considering the sensors deployed in the plane, our main idea is based on the computation of convex hulls of sensor nodes (nodes are considered points in the plane) in a localized manner and a simple coloring scheme, which produces a CDS in unit disk graphs whose size is at most 38*|MCDS| where |MCDS| is the size of a minimum CDS. To the best of our knowledge, this is a significant improvement over the best published results in the same context [5]. We also analyze grids and trees to compute the exact approximation ratios for the problem. We show that our algorithm produces an optimal CDS if the graph is a tree and in the case of grids the approximation factor is 2.

关键词： Computer networks Wireless sensor networks Spine Connectors Tree graphs Concurrent computing distributed computing Broadcasting Grid computing Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A framework for confronting key-swapping collusion attack on random pairwise key pre-distribution schemes for distributed sensor networks

A framework for confronting key-swapping collusion attack on...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Tran thanh Dai Johnson I. Agbinya University of Technology Sydney Australia

Random pairwise key pre-distribution schemes have been adopted extensively as a preferred approach to pairwise key agreement problem in distributed sensor networks. However, their practical applicability is threatened by the key-swapping collusion attack whose goal is to ruin critical applications that require collaborative efforts. In this paper, we propose a light-weight framework for thwarting the attack. Our framework is a winning combination of intermittent deployment strategy and one-way hash chain. the framework thereby evades undesirable requirements of functionalities and resources, topological pre-deployment knowledge, or costly location-based detection algorithms, yet maintaining network scalability. Moreover, the in-depth analysis shows in the optimistic situation the framework not only completely defeats the attack but also diminishes usability of non-collusion compromised nodes to attackers. Meanwhile, it still maintains network resilience at a remarkable level in the worst situation. Finally, the performance overheads are analysed to be acceptable for use in the current sensor node generation.

关键词： Cryptography Proposals Security Gain Scalability Silicon Base stations

来源：评论

学校读者我要写书评

暂无评论

Connectivity monitoring in wireless sensor networks

Connectivity monitoring in wireless sensor networks

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Mingze Zhang Mun Choon Chan A.L. Ananda School of Computing National University of Singapore Singapore

Connectivity monitoring is useful in practical deployment of wireless sensor network. In order to understand the behavior and performance bottleneck, knowledge of the network connectivity is crucial. In this paper, we propose a flexible and efficient connectivity monitoring algorithm (H 2 CM) that has three components and operates in a divide and conquer manner. the components include hop vector distance based filtering, Bloom filters and signature hashing and are designed to work with different combinations of network and neighbor set sizes. In simulation, communication cost reduction of H 2 CM compare to maximal compression of neighborhood information varies from 65% to 85% for large networks (> 1000 nodes) and from 40% to 70% for a medium size network (a few hundred nodes). We have also implemented the algorithm in TinyOS and evaluated its performance on a testbed with 34 motes.

关键词： Distance measurement Monitoring Arrays Network topology Topology Accuracy Information filters

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant event region detection in wireless sensor networks using statistical hypothesis test

Fault-tolerant event region detection in wireless sensor net...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Donglei Cao Beihong Jin Jiannong Cao Chinese Academy of Sciences China Institute of Software Chinese Academy and Sciences Department of computing Hong Kong Polytechnic University Hung Hom Hong Kong China

Most existing algorithms for fault-tolerant event region detection only assume that events are spatially correlated, but we argue that events are usually both spatially and temporally correlated. By examining the temporal correlation of sensor measurements, we propose a detection algorithm by applying statistical hypothesis test (SHT). SHT-based algorithm is more accurate in detecting event regions, and is more energy efficient since it avoids measurement exchanges. To improve the capability of fault recognition, we extend SHT-based algorithm by examining both spatial and temporal correlations of sensor measurements. the extended SHT-based algorithm can recognize almost all faults when sensor network is densely deployed.

关键词： Algorithm design and analysis Correlation Testing Detection algorithms Fault tolerance Wireless sensor networks Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 473 474 475 476 477 478 479 480 481 482 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：