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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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...
186 篇 sensors
166 篇 wireless communi...
156 篇 protocols
150 篇 monitoring
111 篇 routing
111 篇 sensor networks
110 篇 computer network...
103 篇 sensor phenomena...
99 篇 internet of thin...
98 篇 energy consumpti...
98 篇 robot sensing sy...
96 篇 mobile communica...
89 篇 sensor nodes
87 篇 mobile computing
84 篇 energy efficienc...
79 篇 distributed data...
79 篇 intelligent sens...

机构

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 条记录，以下是2421-2430 订阅

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

详细简洁

排序：

Decoding code on a sensor node 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： von Rickenbach, Pascal Wattenhofer, Roger ETH Comp Engn & Networks Lab Zurich Switzerland

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and reliable code update mechanism becomes pressing. Reasons for updates are manifold ranging from fixing software bugs to retasking the whole sensor network. The scale of deployments and the potential physical inaccessibility of individual nodes asks for a wireless software management scheme. In this paper we present an efficient code update strategy which utilizes the knowledge of former program versions to distribute mere incremental changes. Using a small set of instructions, a delta of minimal size is generated. This delta is then disseminated throughout the network allowing nodes to rebuild the new application based on their currently running code. The asymmetry of computational power available during the process of encoding (PC) and decoding (sensor node) necessitates a careful balancing of the decoder complexity to respect the limitations of today's sensor network hardware. We provide a seamless integration of our work into Deluge, the standard TinyOS code dissemination protocol. The efficiency of our approach is evaluated by means of testbed experiments showing a significant reduction in message complexity and thus faster updates.

关键词： sensor nodes

来源：评论

学校读者我要写书评

暂无评论

distributed coordinate-free hole recovery

Distributed coordinate-free hole recovery

引用

ICC 2008 - 2008 ieee international conference on Communications Workshops

作者： Li, Xiaoyun Hunter, David K. Department of Computing and Electronic Systems University of Essex Colchester CO4 3SQ United Kingdom

ISBN: (纸本)9781424420513

This paper proposes a distributed coordinate-free non-triangulated hole recovery algorithm for sensor networks called 3MeSH-DR (Triangular Mesh distributed hole Recovery), which recovers coverage holes with the minimum number of redundant nodes using only connectivity information. If this hole cannot be triangulated by edges between pairs of nodes closer that 2 units from each other, the boundary of the hole is detected accurately with the minimum number of edges. It is shown to be error-free by thousands of simulations with different random topologies and node densities. Because of its high reliability and modest requirements for computing power and memory, 3MeSH-DR is an efficient solution for hole detection and recovery without location information in real sensor network applications. ©2008 ieee.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Coverage estimation in the presence of occlusions for visual sensor networks 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Qian, Cheng Qi, Hairong Viatronix Inc Stony Brook NY 11790 USA Univ Tennessee Knoxville TN 37996 USA

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

Visual coverage is an essential issue in the research on visual sensor networks. However, because of the presence of visual occlusions, the statistics of visual coverage blend the statistics of nodes and targets and are extremely difficult to derive. By assuming the deployment of nodes as a stationary Poisson point process and ignoring boundary effects, this paper presents the first attempt to estimate the probability that an arbitrary target in the field is visually k-covered. The major challenge for the estimation is how to formulate the probability (q) that a node captures a target in its visual range. To tackle this challenge, we first assume a visual detection model that takes visual occlusions into account and then derive several significant statistical parameters of q based on this model. According to these parameters, we can finally reconstruct the probability density function of q as a combination of a Binomial function and an impulse function. With the estimated coverage statistics, we further propose an estimate of the minimum node density that suffices to ensure a K-coverage across the field.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Routing efficiency of AODV and DSR protocols in ad-hoc sensor networks

Routing efficiency of AODV and DSR protocols in ad-hoc senso...

引用

28th international conference on distributed computing systems Workshops, ICDCS Workshops 2008

作者： Yang, Tao Ikeda, Makoto De Marco, Giuseppe Barolli, Leonard Durresi, Arjan Xhafa, Fatos 3-30-1 Wajiro-Higashi Higashi-Ku Fukuoka 811-0295 Japan Department of Systems and Information Engineering Toyota Technological Institute 2-12-1 Tenpaku-Hisakata Nagoya 468-8511 Japan 3-30-1 Wajiro-Higashi Higashi-Ku Fukuoka 811-0295 Japan Department of Computer and Information Science Indiana University Purdue University Indianapolis 723 W. Michigan Street SL 280 Indianapolis IN 46202 United States Department of Languages and Informatics Systems Polytechnic University of Catalonia C/Jordi Girona 1-3 08034 Barcelona Spain

ISBN: (纸本)9780769531731

In this paper we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model. We study the routing efficiency of the ad-hoc sensor network and compare the performance of two protocols for different scenarios using the routing efficiency concept. By computer simulations, we found that the routing efficiency of DSR protocol is better than AODV protocol. © 2008 ieee.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

An information theoretic framework for field monitoring using autonomously mobile sensors 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Morcos, Hany Atia, George Bestavros, Azer Matta, Ibrahim Boston Univ Dept Comp Sci 111 Cummington St Boston MA 02215 USA Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to efficiently answer queries with a known probability distribution over the spatial dimension. First, we propose a novel distributed information theoretic approach assuming knowledge of the distribution of the monitored phenomenon. Under this scheme, nodes minimize an entropic utility function that captures the average amount of uncertainty in queries given the probability distribution of query locations. Second, we propose a correlation-based technique, which only requires knowledge of the second-order statistics, relaxing the stringent constraint of a priori knowledge of the query distribution, while significantly reducing the computational overhead. We show that the proposed approaches considerably improve the average field estimation error. Further, we show that the correlation-based technique is robust to model mismatch in case of imperfect knowledge of the underlying generative correlation structure.

关键词： sensor nodes

来源：评论

学校读者我要写书评

暂无评论

N-LDA: N-layers data aggregation in sensor networks

N-LDA: N-layers data aggregation in sensor networks

引用

28th international conference on distributed computing systems Workshops, ICDCS Workshops 2008

作者： Rodhe, Ioana Rohner, Christian Department of Information Technology Uppsala University

ISBN: (纸本)9780769531731

We present a protocol for secure data aggregation in wireless sensor networks that offers end-to-end data confidentiality by using homomorphic functions and interleaved encryption. Hop-by-hop aggregation in sensor networks is an efficient way to save energy. Node compromises in hostile environments require protocols for data aggregation where the intermediate nodes contribute with their own values to the aggregated data without getting access to it. Homomorphic encryption schemes allow aggregation on ciphertext and thus can provide end-to-end data confidentiality. We propose a layered data aggregation protocol which ensures that, in the presence of less than n captured nodes, an attacker cannot get access to any aggregated data from the network. When more than n nodes are captured, the attacker can only get access to the aggregated values received by the captured nodes. Our protocol is resilient to node failure and no pre-built tree for data aggregation is needed. © 2008 ieee.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

EcoDAQ: A Case Study of a Densely distributed Real-Time System for High Data Rate Wireless Data Acquisition

EcoDAQ: A Case Study of a Densely Distributed Real-Time Syst...

引用

14th ieee international conference on Embedded and Real-Time computing systems and Applications

作者： Chen, Chong-Jing Chou, Pai H. Univ Calif Irvine Ctr Embedded Comp Syst Irvine CA 92697 USA Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (纸本)9780769533490

Densely distributed wireless real-time system must perform communication scheduling and protocols in addition to task scheduling to achieve schedulability and reliable communication. While many wireless sensor networks are densely distributed, they assume low duty cycling and trivial data packet rates, and the), cannot handle many real-world applications. To highlight these design issues, this paper presents a case study with EcoDAQ, a wireless data acquisition system with 50 sensor nodes streaming real-time data over the same frequency channel. To achieve reliable communication, we define a pulling protocol that minimizes node complexity while guaranteeing collision freedom on a given frequency channel. Our case study illustrates the impact of communication requirements on the rest of the systems including bus and processing speeds. Experimental results show that our monitoring station can sustain gathering accelerometer data from up to 50 nodes in one square meter area at up to 15,000 samples per second with minimal latency and show very high expandability, flexibility and reliability.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

sensor placement for 3-coverage with minimum separation requirements 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Kim, Jung-Eun Yoon, Man-Ki Han, Junghee Lee, Chang-Gun Seoul Natl Univ Sch Engn & Comp Sci Seoul South Korea Samsung Elect Co Ltd Suwon South Korea

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

sensors have been increasingly used for many ubiquitous computing applications such as asset location monitoring, visual surveillance, and human motion tracking. In such applications, it is important to place sensors such that every point of the target area can be sensed by more than one sensor. Especially, many practical applications require 3-coverage for triangulation, 3D hull building, and etc. Also, in order to extract meaningful information from the data sensed by multiple sensors, those sensors need to be placed not too close to each other-minimum separation requirement. To address the 3-coverage problem with the minimum separation requirement, this paper proposes two methods, so called, overlaying method and TRE-based method, which complement each other depending on the minimum separation requirement. For these two methods, we also provide mathematical analysis that can clearly guide us when to use the TRE-based method and when to use the overlaying method and also how many sensors are required. To the best of our knowledge, this is the first work that systematically addresses the 3-coverage problem with the minimum separation requirement.

关键词： sensor placement 3-coverage minimum separation requirement coverage redundancy

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient task mapping for data-driven sensor network macroprogramming 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Pathak, Animesh Prasanna, Viktor K. Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an energy-efficient initial placement of these tasks onto the nodes of the target network poses a set of interesting problems. We present a framework to model this task-mapping problem arising in WSN macroprogramming. Our model can capture task placement constraints, and supports easy specification of energy-based optimization goals. Using our framework, we provide mathematical formulations for the task-mapping problem for two different metrics - energy balance and total energy spent. Due to the complex nature of the problems, these formulations are not linear. We provide linearization heuristics for the same, resulting in mixed-integer programming (MIP) formulations. We also provide efficient heuristics for the above. Our experiments show that the our heuristics give the same results as the MIP for real-world sensor network macroprograms, and show a speedup of up to several orders of magnitude.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A distributed sensor Network for Real-Time Acoustic Traffic Monitoring and Early Queue Detection

A Distributed Sensor Network for Real-Time Acoustic Traffic ...

引用

4th international conference on sensor Technologies and Applications (sensorCOMM)

作者： Barbagli, B. Manes, I. Magrini G. Manes, A. Langer, G. Bacchi, M. Univ Florence Dept Elect & Telecommun Via S Marta 3 I-50100 Florence Italy Netsens Srl I-50019 Sesto Fiorentino Italy Autostrade Tech Spa I-50100 Florence Italy

ISBN: (纸本)9780769533308

A novel sensor network configuration is introduced for traffic surveillance in Intelligent Transportation systems. distributed sensor nodes based on passive acoustic transducers are non intrusively/obtrusively deployed at motorway road-side to provide real-time traffic data collection for dynamic queue/jam detection. The system is capable to provide a complete real-time picture of traffic flow at unprecedented time/space scale. The infrastructure is based on a stand-alone, install-and-forget architecture, featuring an energy efficient protocol for sensor networking and providing connectivity to back-end computing environment via TCP/IP over UMTS. Extensive experimental demonstration is given for long term operation on a motorway test site.

关键词： wireless sensor networks acoustic sensors cross correlation intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共318页 << < 239 240 241 242 243 244 245 246 247 248 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：