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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,162 篇 会议
96 篇 期刊文献
18 册 图书

馆藏范围

6,276 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,615 篇 工学
- 3,854 篇 计算机科学与技术...
- 1,633 篇 信息与通信工程
- 1,600 篇 电气工程
- 1,586 篇 软件工程
- 614 篇 控制科学与工程
- 325 篇 机械工程
- 316 篇 动力工程及工程热...
- 260 篇 测绘科学与技术
- 202 篇 电子科学与技术（可...
- 192 篇 仪器科学与技术
- 140 篇 交通运输工程
- 132 篇 网络空间安全
- 130 篇 安全科学与工程
- 97 篇 生物工程
- 93 篇 石油与天然气工程
- 74 篇 材料科学与工程（可...
- 62 篇 化学工程与技术
- 59 篇 生物医学工程（可授...
- 55 篇 建筑学
842 篇 理学
- 437 篇 数学
- 154 篇 物理学
- 138 篇 生物学
- 130 篇 系统科学
- 109 篇 化学
- 104 篇 统计学（可授理学、...
631 篇 管理学
- 463 篇 管理科学与工程(可...
- 271 篇 图书情报与档案管...
- 157 篇 工商管理
130 篇 医学
- 112 篇 临床医学
64 篇 法学
56 篇 经济学
- 56 篇 应用经济学
31 篇 教育学
22 篇 农学
11 篇 文学
11 篇 军事学

主题

1,106 篇 wireless sensor ...
199 篇 sensor systems
184 篇 monitoring
178 篇 distributed comp...
175 篇 wireless communi...
164 篇 sensor nodes
160 篇 sensors
150 篇 protocols
144 篇 cloud computing
140 篇 internet of thin...
136 篇 wireless sensor ...
136 篇 distributed comp...
131 篇 routing
105 篇 sensor networks
102 篇 energy consumpti...
101 篇 security
100 篇 real-time system...
96 篇 computational mo...
91 篇 sensor phenomena...
90 篇 robot sensing sy...

机构

11 篇 nanjing univ sta...
10 篇 suny stony brook...
9 篇 department of co...
9 篇 department of co...
8 篇 univ ottawa sch ...
7 篇 college of compu...
7 篇 college of compu...
7 篇 chitkara univers...
7 篇 state key labora...
7 篇 queens univ sch ...
7 篇 city univ hong k...
7 篇 institute of com...
7 篇 distributed syst...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 cent south univ ...
6 篇 department of co...
6 篇 missouri univ sc...
6 篇 cent s univ sch ...
6 篇 carleton univ de...

作者

18 篇 dustdar schahram
13 篇 wu jie
12 篇 yang yang
11 篇 stankovic john a...
11 篇 wehrle klaus
11 篇 wang wei
11 篇 schahram dustdar
11 篇 cao jiannong
11 篇 agrawal dharma p...
10 篇 voigt thiemo
10 篇 rothermel kurt
10 篇 liu yunhao
9 篇 wang guojun
9 篇 nikoletseas soti...
9 篇 wang xin
9 篇 abdelzaher tarek
8 篇 bar-noy amotz
8 篇 duerr frank
8 篇 vassiliou vasos
8 篇 kulau ulf

语言

6,205 篇 英文
53 篇 其他
18 篇 中文
1 篇 土耳其文

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

共 6276 条记录，以下是4841-4850 订阅

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

详细简洁

排序：

Probabilistic estimation of end-to-end path latency in Wireless sensor Networks

Probabilistic estimation of end-to-end path latency in Wirel...

引用

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

作者： Ramon Serna Oliver Gerhard Fohler Technische UniversitäT Kaiserslautern Kaiserslautern Germany

ISBN: (纸本)9781424451142

the inherent properties of wireless sensor networks (WSN) disqualify most classic methods targeting timeliness guarantees. Assumptions of such methods as well as a restrictive notion of timeliness borrowed from classic real-time systems clash with the indeterminism of realistic scenarios. In this paper, we introduce a generalized notion of timeliness which allows to provide meaningful performance metrics under unreliable conditions, common in WSN. We present a probabilistic metric to capture the level of confidence for the timeliness performance without restricting its applicability. It consists of the estimation of the end-to-end delay distribution function by using current local state information of intermediate hops, which requires low memory and computational resources. this metric represents a hook to adaptive QoS as it is constantly updated at run-time and reflects the actual network status. Extensive simulation results underline the validity of the method and its applicability.

关键词： Delay Wireless sensor networks Protocols Frequency synchronization Clocks Peer to peer computing Oscillators Collaboration Broadcasting Frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Delay and energy efficiency tradeoffs for data collections and aggregation in large scale wireless sensor networks

Delay and energy efficiency tradeoffs for data collections a...

引用

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

作者： Chao Ren Xufei Mao Ping Xu GuoJun Dai ZhanHuai Li School of CS Northwestern Polytechnical University China Department of Computer Science Illinois Institute of Technology Chicago USA Institute of Computer Application Technology Hangzhou Dianzi University China

In this paper, we study efficient data collection and aggregation problem in wireless sensor networks. We first propose efficient distributed algorithms for data collection problem with approximately the minimum delay, or the minimum number of messages to be sent by all wireless nodes, or the minimum total energy consumption by all wireless nodes respectively. For example, given an algorithm A for data collection, let ¿ T , ¿ M , and ¿ E be the approximation ratio of A in terms of time complexity, message complexity, and energy complexity respectively. We then show that, for data collection, there are networks of n nodes and maximum degree ¿, such that ¿ M¿E = ¿(¿) for any algorithm. In addition, we analytically proved that all our proposed methods are either optimum or within constants factor of the optimum. We further present the message, energy, time complexity and studied the complexity tradeoffs for data aggregation problem.

关键词： Energy efficiency Large-scale systems Wireless sensor networks Costs distributed algorithms Temperature sensors Algorithm design and analysis Chaos Computer science Computer applications

来源：评论

学校读者我要写书评

暂无评论

Hash-based sequential aggregate and forward secure signature for unattended wireless sensor networks

Hash-based sequential aggregate and forward secure signature...

引用

2009 6th Annual international conference on Mobile and Ubiquitous systems: Networking and Services, MobiQuitous 2009

作者： Yavuz, Attila Altay Ning, Peng Department of Computer Science North Carolina State University Raleigh NC 27695 United States

ISBN: (纸本)9789639799592

Unattended Wireless sensor Networks (UWSNs) operating in hostile environments face great security and performance challenges due to the lack of continuous real-time communication between senders (sensors) and receivers (e.g., mobile data collectors, static sinks). the lack of real-time communication forces sensors to accumulate the sensed data possibly for long time periods, along with the corresponding signatures for authentication purposes. Moreover, non-real-time characteristic of UWSNs makes sensors vulnerable especially to active adversaries, which compromise sensors and extract all data stored in them. Hence, it is critical to have forward security property such that even if the adversary can compromise the current keying materials, she cannot modify or forge authenticated data generated before the node compromise. Forward secure and aggregate signatures are cryptographic primitives developed to address these issues. Unfortunately, existing forward secure and aggregate signature schemes either impose substantial computation and storage overhead, or do not allow public verifiability, thereby impractical for resource-constrained UWSNs. In order to address these problems, we propose a new class of signature schemes, which we refer to as Hash-Based Sequential Aggregate and Forward Secure Signature (HaSAFSS). Such a scheme allows a signer to sequentially generate a compact, fixed-size, and publicly verifiable signature at a nearly optimal computational cost. We propose two HaSAFSS schemes, Symmetric HaSAFSS (Sym-HaSAFSS) and Elliptic Curve Cryptography (ECC) based HaSAFSS (ECC-HaSAFSS). Both schemes integrate the efficiency of MAC-based aggregate signatures and the public verifiability of bilinear map based signatures by preserving forward security via Timed-Release Encryption (TRE). We demonstrate that our schemes are secure under appropriate computational assumptions. We also show that our schemes are significantly more efficient in terms of both computational an

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

On the Connected k-Coverage Problem in Heterogeneous sensor Nets: the Curse of Randomness and Heterogeneity

On the Connected k-Coverage Problem in Heterogeneous Sensor ...

引用

ieee international conference on distributed computing systems

作者： Habib M. Amman John Giudici Wireless Sensor and Mobile Ad-Hoc Networks (WiSeMAN) Research Lab Department of Computer Science Hofstra University Hempstead NY 11549 USA

ISBN: (纸本)9781424444816

Coverage is an essential task in sensor deployment for the design of wireless sensor networks. While most existing studies on coverage consider homogeneous sensors, the deployment of heterogeneous sensors represents more accurately the network design for real-world applications. In this paper, we focus on the problem of connected k-coverage in heterogeneous wireless sensor networks. Precisely, we distinguish two deployment strategies, where heterogeneous sensors are either randomly or pseudo-randomly distributed in afield. While the first deployment approach considers a single layer of heterogeneous sensors, the second one proposes a multi-tier architecture of heterogeneous sensors to better address the problems introduced by pure randomness and heterogeneity.

关键词： Random Number Generators sensors Wireless sensor networks Coverage Heterogeneous sensor placement multi-tier deployment Network design one layer

来源：评论

学校读者我要写书评

暂无评论

Pattern formation using multiple robots

Pattern formation using multiple robots

引用

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

作者： Jun Zeng Daoyong Liu Alei Liang Haibing Guan School of Software Shanghai JiaoTong University Shanghai China Department of Computer Science & Engineering Shanghai JiaoTong University Shanghai China

Pattern formation is one of typical problems in the field of multi-robot cooperation. It can be applied to complex application scenarios such as region coverage and path exploration. Compare to traditional multi-robot coordination algorithm, the method based on swarm robots to solve the issue of pattern formation has better scalability and dynamic adaptability and robustness. In this demo, we propose a scalable algorithm using a modified gradient descent technique which allows a swarm of robots to form a letter, such as `A'. In this demo, we verify our algorithm through experimentation in a team of self-organized robots, in which communication with each other is through Zigbee network.

关键词： Pattern formation Robot kinematics Robotics and automation Robustness Mathematical model Software Scalability ZigBee Error correction distributed control

来源：评论

学校读者我要写书评

暂无评论

A scheme for efficient tracking of dynamic event region in wireless sensor networks

A scheme for efficient tracking of dynamic event region in w...

引用

international conference on Mobile and Ubiquitous systems: Networking and Services (MobiQuitous)

作者： Yang Yang Satoshi Fujita Graduate School of Engineering Hiroshima University Hiroshima Japan

In this paper, we propose a distributed scheme to recognize the shape of a dynamic event region in wireless sensor networks; i.e., a scheme to track the shape of a part of a given field concerned with a dynamic event such as gas leakage and a fire. the basic idea of our proposed scheme is to identify several critical points in a given event region, and to periodically check the criticalness of such points. the performance of the scheme is experimentally evaluated by simulation. the result of simulations indicates that the proposed event tracking scheme correctly recognizes the move of an event region with sufficiently small number of transmitted messages compared with a centralized tracking scheme.

关键词： Wireless sensor networks Monitoring Shape Fires Wireless communication distributed computing Medical services Discrete event simulation Microelectronics Communications technology

来源：评论

学校读者我要写书评

暂无评论

How to break LU matrix based key predistribution schemes for Wireless sensor Networks

How to break LU matrix based key predistribution schemes for...

引用

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

作者： Bo Zhu Yanfei Zheng Yaowei Zhou Kefei Chen Department of Computer Science and Engineering Shanghai JiaoTong University Shanghai China School of Information Security Engineering Shanghai JiaoTong University Shanghai China

A key predistribution scheme for wireless sensor networks was proposed by Choi and Youn in 2005, which is based on LU decomposition of symmetric matrix. After that, several key predistribution schemes were designed on the basis of Choi and Youn's original scheme. In this paper, we carefully investigate a mathematical theorem about symmetric matrix, by following which adversaries could easily obtain the secret keys deployed via Choi and Youn's scheme. We also analyze all the schemes derived from Choi and Youn's and point out their vulnerabilities. In addition, we propose a revised scheme avoiding the security flaw.

关键词： Wireless sensor networks Public key Mobile ad hoc networks Ad hoc networks Computer science Mobile computing Communication system security Routing protocols Fabrics Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A Large-Scale Service-Oriented sensor Grid Infrastructure

A Large-Scale Service-Oriented Sensor Grid Infrastructure

引用

Consumer Communications and Networking conference, CCNC ieee

作者： Hock Beng Lim Mudasser Iqbal Wenqiang Wang Yuxia Yao Intelligent Systems Center Nanyang Technological University Singapore

Based on our proposed semantics-based service-oriented model, we are building a large-scale sensor grid infrastructure that can seamlessly integrate heterogeneous sensor resources from different projects distributed across a wide geographical area. this model has several important features. First, it connects heterogeneous sensor resources via the Internet to automatically collect and aggregate sensor data in real-time. Second, the varied types and formats of sensor data are linked to the ontology of the respective sensor resource and the data is converted into a standard ontology-based (OWL) format in order to bind data semantics with the data for ease of access and processing. third, the sensor data are stored in a large-scale distributed data archive whose schema is also derived from the common concepts found in the ontologies of various sensor nodes. Fourth, the sensor grid integrates computational resources for the compute-intensive processing of sensor data. Fifth, the sensor data can be conveniently accessed and shared via the Web through mash-ups, blogs and Web-services such as Google Earth and Microsoft's sensorMap. We are developing techniques and tools to publish, query, process, visualize, archive and search the vast amount of sensor data efficiently.

关键词： Large-scale systems Ontologies Grid computing Large scale integration Internet Aggregates OWL Blogs Earth Data visualization

来源：评论

学校读者我要写书评

暂无评论

Protecting Neighbor Discovery Against Node Compromises in sensor Networks

Protecting Neighbor Discovery Against Node Compromises in Se...

引用

ieee international conference on distributed computing systems

作者： Donggang Liu iSec Laboratory CSE Department The University of Texas at Arlington

ISBN: (纸本)9781424444816

the neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile environments. However, these methods can only protect neighbor relations between benign nodes. A compromised node can easily circumvent them and setup false neighbor relations with sensor nodes in many places, impacting the network at a large scale. this paper presents a theoretic model for neighbor discovery in sensor networks and describes a fundamental security limitation and a generic attack against this model. the paper then proposes an efficient and localized solution based on a security property achievable during sensor deployment. this technique provides a threshold security guarantee in dealing with compromised sensor nodes. the analytical and simulation studies show that the technique is practical and effective for sensor networks.

关键词： sensor networks Neighbor sensor placement Ganglia Network routing

来源：评论

学校读者我要写书评

暂无评论

Intrusion detection in Gaussian distributed Wireless sensor Networks

Intrusion detection in Gaussian distributed Wireless Sensor ...

引用

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

作者： Yun Wang Weihuang Fu Dharma P. Agrawal Department of Computer Science Southern Illinois University Edwardsville Edwardsville USA Department of Computer Science University of Cincinnati Cincinnati USA

Intrusion detection in a Wireless sensor Network (WSN) is of significant importance in many applications to detect malicious or unexpected intruder(s). the intruder can be an enemy in a battlefield, or a unusual environmental change in a chemical industry etc. With uniform distribution, the detection probability is the same for any point in a WSN. However, some applications may require different degrees of detection probability at different locations in the deployment area. Gaussian distributed WSNs (i.e., normal distribution) can provide differentiated detection capabilities at different locations and are widely deployed in practice. In view of this, this paper analyzes the problem of intrusion detection in a Gaussian distributed WSN, by characterizing intrusion detection probability with respect to intrusion distance and network deployment parameters. Two detection models are considered: single-sensing detection and multiple-sensing detection. Effects of different network parameters on the intrusion detection probability are examined in details. this work allows us to analytically formulate the intrusion detection probability within a certain intrusion distance under various application scenarios, therefore provides insight for directing the application-specific WSN deployment such as intrusion detection.

关键词： Intrusion detection Wireless sensor networks Partitioning algorithms Algorithm design and analysis Parameter estimation Geometry Hardware Goniometers Software algorithms Laboratories

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 481 482 483 484 485 486 487 488 489 490 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：