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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,135 篇 会议
35 篇 期刊文献
4 册 图书

馆藏范围

3,174 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,909 篇 工学
- 1,673 篇 计算机科学与技术...
- 744 篇 信息与通信工程
- 711 篇 电气工程
- 502 篇 软件工程
- 254 篇 测绘科学与技术
- 227 篇 控制科学与工程
- 223 篇 机械工程
- 143 篇 动力工程及工程热...
- 90 篇 仪器科学与技术
- 59 篇 电子科学与技术（可...
- 51 篇 网络空间安全
- 48 篇 安全科学与工程
- 46 篇 交通运输工程
- 28 篇 生物工程
- 27 篇 土木工程
- 22 篇 建筑学
- 13 篇 化学工程与技术
272 篇 理学
- 148 篇 数学
- 53 篇 化学
- 41 篇 系统科学
- 35 篇 统计学（可授理学、...
- 32 篇 生物学
- 26 篇 物理学
221 篇 管理学
- 175 篇 管理科学与工程(可...
- 88 篇 图书情报与档案管...
- 57 篇 工商管理
28 篇 医学
- 20 篇 临床医学
- 11 篇 公共卫生与预防医...
25 篇 法学
- 22 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
10 篇 军事学
9 篇 文学
7 篇 农学
2 篇 教育学
1 篇 艺术学

主题

986 篇 wireless sensor ...
268 篇 sensor systems
223 篇 distributed comp...
182 篇 sensors
166 篇 wireless communi...
156 篇 protocols
150 篇 monitoring
113 篇 sensor networks
111 篇 routing
109 篇 computer network...
103 篇 sensor phenomena...
99 篇 internet of thin...
98 篇 energy consumpti...
98 篇 robot sensing sy...
96 篇 mobile communica...
89 篇 sensor nodes
86 篇 mobile computing
85 篇 energy efficienc...
80 篇 intelligent sens...
77 篇 computer archite...

机构

9 篇 nanjing univ sta...
9 篇 suny stony brook...
8 篇 department of co...
8 篇 school of comput...
7 篇 department of co...
7 篇 state key labora...
7 篇 department of co...
7 篇 hong kong univ s...
6 篇 dalian univ tech...
6 篇 department of el...
6 篇 department of co...
6 篇 missouri univ sc...
6 篇 michigan state u...
6 篇 key lab ubiquito...
6 篇 univ virginia de...
6 篇 univ illinois de...
6 篇 institute of com...
5 篇 college of compu...
5 篇 georgia state un...
5 篇 distributed syst...

作者

17 篇 dharma p. agrawa...
16 篇 sotiris nikolets...
13 篇 agrawal dharma p...
12 篇 abdelzaher tarek
11 篇 bar-noy amotz
11 篇 sarigiannidis pa...
11 篇 voigt thiemo
11 篇 nikoletseas soti...
11 篇 liu yunhao
10 篇 stankovic john a...
10 篇 wu jie
9 篇 panagiotis sarig...
9 篇 lars wolf
9 篇 rothermel kurt
9 篇 jiannong cao
8 篇 thomas lagkas
8 篇 vassiliou vasos
8 篇 lagkas thomas
8 篇 dai haipeng
8 篇 ulf kulau

语言

3,105 篇 英文
60 篇 其他
12 篇 中文

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

共 3174 条记录，以下是2291-2300 订阅

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

详细简洁

排序：

Time-Synchronization Free Localization in Large Scale Underwater Acoustic sensor Networks

Time-Synchronization Free Localization in Large Scale Underw...

引用

international conference on distributed computing systems Workshop

作者： Wei Cheng Andrew Thaeler Xiuzhen Cheng Fang Liu Xicheng Lu Zexin Lu Department of Computer Science George Washington University Washington D.C. DC USA Department of Computer Science University of Texas-Pan American Edinburgh TX UK School of Computer Science National University of Defense Technology Changsha Hunan China

We introduce and study the localization problem in large scale underwater acoustic sensor networks. Considering that depth information is typically available for underwater sensors, we transform the 3D underwater positioning problem into its two-dimensional counterpart via a projection technique. We then introduce a localization scheme specifically designed for large scale acoustic underwater sensor networks. The proposed localization scheme does not require time-synchronization in the network. This scheme relies on time-differences of arrival (TDoA) measured locally at a sensor to detect range differences from the sensor to three anchors that can mutually hear each other. We consider variations in the speed of sound and analyze the performance of the proposed scheme in terms of the number of localized nodes, location errors, and the number of reference nodes.

关键词： Large-scale systems Underwater acoustics Acoustic sensors Underwater vehicles Computer science Global Positioning System Bandwidth Intelligent sensors sensor systems USA Councils

来源：评论

学校读者我要写书评

暂无评论

A new broadcast-key management scheme for distributed wireless sensor networks

A new broadcast-key management scheme for distributed wirele...

引用

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

作者： YingZhi Zeng Yan Xia JinShu Su BaoKang Zhao WanRong Yu School of Computer National University of Defense Technology ChangSha Hunan China School of Computer and Communication Hunan University ChangSha Hunan China

The management of broadcast-key is one of the most important security problems in the distributed wireless sensor networks. Firstly, the broadcast-key should be calculated and used by each node. Secondly, the broadcast-key should also be updated according to the variation of security condition. In this paper, we propose a new broadcast-key management scheme which has many advantages over the famous muTESLA protocol. The analysis in this paper demonstrates its feasibility, efficiency and security for broadcast-key establishment and renewing in distributed wireless sensor networks.

关键词： Broadcasting Wireless sensor networks Computer network management Computer networks Cryptography Broadcast technology Technology management Computer security Protocols distributed computing

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Search in sensor Networks Using Simple Random Walks with Level Biased Steps

Energy Efficient Search in Sensor Networks Using Simple Rand...

引用

international conference on distributed computing systems Workshop

作者： Kiran K. Rachuri C. Siva Ram Murthy Indian Institute of Technology Madras Chennai India

Random walk is one of the widely used techniques for information discovery in unstructured networks like ad hoc wireless networks (AWNs) and wireless sensor networks (WSNs). In a random walk, instead of taking all steps uniform randomly, our idea is to modify random walk to take some level biased steps to improve its energy efficiency and latency which are important design parameters in WSNs. The level of a node is defined as the minimum number of hops required for a packet to reach the sink node from that node. We propose two walk based search protocols viz., several short random walks (SSRW) search and random walk with level biased jumps (RWLBJ) search, that use a combination of uniform random and level biased steps for energy efficient search in WSNs. The idea is that the biased steps in the proposed protocols decrease the correlation among visited sensor nodes which increases the node coverage of the protocols. We show by theoretical analysis that using biased steps in random walks increases their efficiency in terms of energy consumption and latency of search. We also show by extensive simulations that SSRW and RWLBJ are better choices compared to that of pure random walk in terms of the energy consumption and latency of search.

关键词： Energy efficiency Wireless sensor networks Delay Protocols Energy consumption Temperature sensors Query processing distributed computing conferences sensor systems

来源：评论

学校读者我要写书评

暂无评论

distributed sensor analysis for fault detection in tightly-coupled multi-robot team tasks

Distributed sensor analysis for fault detection in tightly-c...

引用

ieee international conference on Robotics and Automation (ICRA)

作者： Xingyan Li Lynne E. Parker Distributed Intelligence Laboratory Department of Electrical Engineering and Computer Science University of Tennessee Knoxville TN USA

This paper presents a distributed version of our previous work, called SAFDetection, which is a sensor analysis-based fault detection approach that is used to monitor tightly-coupled multi-robot team *** the centralized version of SAFDetection was shown to be successful, a shortcoming of the approach is that it does not scale well to large team sizes. The distributed SAFDetection approach addresses this problem by adapting and distributing the approach across team members. distributed SAFDetection has the same theoretic foundation as centralized SAFDetection, which maps selected robot sensor data to a robot state by using a clustering algorithm, and builds state transition diagrams to describe the normal behavior of the robot system. However, rather than processing multiple robots' sensor data centralized on a server, distributed SAFDetection performs feature selection and clustering on individual robots to build the normal behavior model of an individual robot and the entire robot team. Fault detection is also accomplished in a distributed manner. We have implemented this distributed approach on a physical robot team and in simulation. This paper presents the results of these experiments, showing that distributed SAFDetection is an efficient approach to detect both local and interactive faults in tightly-coupled multi-robot team tasks. Compared to the centralized version, this approach provides more scalability and reliability.

关键词： Fault detection Robot sensing systems Robotics and automation Orbital robotics Clustering algorithms Peer to peer computing sensor phenomena and characterization sensor systems Scalability distributed computing

来源：评论

学校读者我要写书评

暂无评论

Extending the event-based programming model to support sensor-driven ubiquitous computing applications

Extending the event-based programming model to support senso...

引用

ieee international conference on Pervasive computing and Communications (PerCom)

作者： Sean Reilly Mads Haahr Distributed Systems Group Department of Computer Science Trinity College Dublin Ireland

We propose an extension to the event-based programming model for sensor-driven ubiquitous computing applications. The extension consists of three abstractions: Multi-event handlers, event streams and execution policies. We believe that these additional abstractions simplify the task of writing applications in this domain. In this position paper we present the ex-tensions and demonstrate our prototype middleware implemented in C.

关键词： Ubiquitous computing Application software Filters Middleware Peer to peer computing Scalability Computer science Educational institutions Writing Prototypes

来源：评论

学校读者我要写书评

暂无评论

A Novel Asynchronous, Energy Efficient, Low Transmission Delay MAC Protocol for Wireless sensor Networks

A Novel Asynchronous, Energy Efficient, Low Transmission Del...

引用

international conference on distributed computing systems Workshop

作者： Saeed Rashwand Jelena Misic Vojislav Misic Subir Biswas Md Mahbubul Haque Department of Computer Science University of Manitoba Winnipeg Canada

Wireless sensor networks use battery-operated computing and sensing devices. It is often impractical or even impossible to charge/replace the exhausted batteries of the nodes. Thus, energy consumption is the main concern in a wireless sensor network. Moreover, a critical event detected by the sensor network should be delivered to the user as soon as possible. Thus, for sensor networks, both energy efficiency and transmission latency are important parameters. In this paper, we propose a novel asynchronous, duty cycled, energy efficient, and low transmission delay for wireless sensor networks, which addresses all the sources of energy waste to make the medium access more energy efficient, while keeping transmission delay *** currently available asynchronous contention-based MAC protocols require that proper strategies for sender and receiver nodes are provided to rendezvous. However, the proposed protocol does not rely on any rendezvous between sender and receiver. For evaluating the novel MAC protocol, we have simulated this protocol and two very efficient and established MAC protocols, RTS/CTS ieee 802.11 and S-MAC. The simulation results indicate that the proposed protocol has very good performance. In addition, as the results show, the novel protocol provides a very suitable balance between energy efficiency and transmission delay.

关键词： Energy efficiency Media Access Protocol Wireless application protocol Wireless sensor networks Access protocols Delay Computer networks Batteries Energy consumption Event detection

来源：评论

学校读者我要写书评

暂无评论

A dynamic clustering routing algorithm based on support degree for wireless sensor networks

A dynamic clustering routing algorithm based on support degr...

引用

ieee international conference on Intelligent computing and Intelligent systems (ICIS)

作者： Jing Yang Baoguo Xu Lu Hong Zhuqing Jiao School of Communications and Control Engineering Jiangnan University Wuxi China Electrical Engineering Guizhou University Guiyang China Department of Electronic Engineering Huaihai Institute of Technology Lianyungang China

For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a novel scheme of dynamic clustering routing algorithm (DCRA) based on support degree is proposed. The new approach lets sensors decide whether become a clusterhead (CH) according to the support degree coming from neighbors. Unlike traditional distributed clustering algorithms, DCRA combines energy, load balancing and topology information together by defining an objective function based on support degree. Furthermore, the clusterhead aggregates data and transmits the result to base station (sink node) along multiple paths. The new algorithm is completely distributed and location-unaware. Simulation results show that DCRA has great potential in efficiently distributing energy consumption and extending the network lifetime.

关键词： Routing Clustering algorithms Heuristic algorithms Wireless sensor networks Monitoring Load management Network topology Aggregates Base stations Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Greedy Convex Embeddings for sensor Networks

Greedy Convex Embeddings for Sensor Networks

引用

ieee international conference on Parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Yakir Berchenko Mina Teicher The Leslie and Susan Gonda Multidisciplinary Brain Research Center Bar-llan University Ramat-Gan Israel The Leslie and Susan Gonda Multidisciplinary Brain Research Center Department of Mathematics Bar-llan University Ramat-Gan Israel

Recent advances in systems of networked sensors have set the stage for smart environments which will have wide-ranging applications from intelligent wildlife monitoring to social applications such as health and elderly care service provisioning. Perhaps the most natural problem in sensor systems is the ¿efficient¿ propagation of a sensed local event. In order to address this problem, the notion of greedy embedding was defined by Papadimitriou and Ratajczak, where the authors conjectured that every 3-connected planar graph has a greedy embedding (possibly planar and convex) in the Euclidean plane. Recently, the greedy embedding conjecture was proved by Leighton and Moitra. However, their algorithm does not result in a drawing that is planar and convex in the Euclidean plane for all 3-connected planar graphs. Here we give a random algorithm for embedding 3-connected planar graphs a greedy convex embedding. Our convex embedding is especially useful for the case of sensor networks, where the position assigned to each sensor is the midpoint of the positions of its neighbors.

关键词： Routing Signal processing algorithms Intelligent sensors distributed computing sensor systems and applications sensor systems Ad hoc networks Global Positioning System Multimodal sensors Computer networks

来源：评论

学校读者我要写书评

暂无评论

EUL: an Efficient and Universal Localization Method for Wireless sensor Network

EUL: an Efficient and Universal Localization Method for Wire...

引用

ieee international conference on distributed computing systems

作者： Wei Xi Jizhong Zhao Xue Liu Xiang-Yang Li Yong Qi Dept. of Comp. Sci. and Tech. XV an Jiaotong Univ. School of Computer Science McGill University Dept. of Computer Science Illinois Inst of Tech. Dept. of Comp. Sci. and Tech. XV anJiaotong Univ.

ISBN: (纸本)9781424444816

Localization is a crucial service for various applications in wireless sensor networks (WSNs). Although most researches assume stationary nodes, sensor mobility can enrich the application scenarios. Existing dynamic localization approaches require high seed density or incur a large communication overhead. In order to address these problems, we propose an efficient rang-free localization algorithm, EUL, which utilizes the relationship between neighboring nodes to estimate their possible location boundaries. Our algorithm not only allows all the nodes to remain static or move freely but also reduces the dependence on seeds, which achieves a uniform energy distribution to address the excessive energy drain around seeds and lengthen the network lifetime. We have evaluated EUL together with other major dynamic localization approaches. Simulation results show that EUL outperforms existing approaches in terms of accuracy under many different mobility conditions.

关键词： Wireless sensor networks Computer science Application software Costs Energy consumption Computational efficiency Collaboration distributed computing Event detection Context awareness

来源：评论

学校读者我要写书评

暂无评论

An Automatically Composable OWL Reasoner for Resource Constrained Devices

An Automatically Composable OWL Reasoner for Resource Constr...

引用

international conference on Semantic computing

作者： Wei Tai Rob Brennan John Keeney Declan O'Sullivan Knowledge and Data Engineering Group School of Computer Science & Statistics Trinity College Dublin Dublin Ireland

ISBN: (纸本)9781424449620

Centralized semantic sensor network systems gradually show performance degradation as the scale of the sensor network increases. Thus systems based on distributed approaches with local, autonomous management features are urgently required. In order to achieve local autonomy, it is necessary to push semantics towards the edge of the sensor network, but this is hampered by the lack of availability of lightweight ontology processing and reasoning technologies that are cognizant of the limited resources available in sensor network nodes. This paper proposes an approach to dynamically and automatically compose an ontology reasoner to provide only the level of OWL reasoning required for a given application. A design and prototype implementation are presented, with initial evaluations confirming that this approach saves memory without loss of reasoning ability, which facilitates OWL reasoning on the resource constrained devices typical in sensor networks.

关键词： OWL Ontologies sensor systems Wireless sensor networks Prototypes Computer networks Fault diagnosis Sun Data engineering Computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共318页 << < 226 227 228 229 230 231 232 233 234 235 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：