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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是2441-2450 订阅

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

详细简洁

排序：

Online estimation of effective delivery capability in delay-tolerant mobile sensor networks

Online estimation of effective delivery capability in delay-...

引用

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

作者： Yang, Zhipeng Dang, Ha Wu, Hongyi Center for Advanced Computer Studies University of Louisiana at Lafayette P.O. BOX 44330 Lafayette LA 70504 United States

ISBN: (纸本)9780769531731

The delay-tolerant mobile sensor network (DTMSN) distinguishes itself from conventional sensor networks by several unique characteristics, such as nodal mobility, sparse connectivity, delay tolerability, and fault tolerability. Being an opportunistic network where the communication links exist with certain probabilities only and thus become the scarcest resource, the routing metrics that have been commonly adopted in conventional networks do not reflect this unique network resource of DTMSN. Therefore, they may lead to poor network performance or even failure if used for routing in DTMSN. In this work, we investigate a simple and effective online estimation approach to obtain a converged and accurate parameter that reflects the node's effective delivery capability. Specifically, we devise an exponentially weighted moving average (EWMA) approach to effectively maintain and update the routing metrics. We prove that the expectation of the EWMA parameter converges to a constant when the nodes are under statically distributed mobility and the system becomes stable as time t → ∞, and the converged value is the average data delivery rate of the node. To further validate our discussion in a close-to-realistic mobility, we conduct simulations under the CRAWDAD mobility traces. The simulation results show that EWMA closely follows the variation of the actual delivery rate and thus serves as an effective metrics for efficient routing. © 2008 ieee.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

Efficient node discovery in mobile wireless sensor networks 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Dyo, Vladimir Mascolo, Cecilia UCL Dept Comp Sci Gower St London WC1E 6BT England Univ Cambridge Comp Lab Cambridge CB3 OFD England

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to just several days, or demands considerable maintenance efforts (e.g., in terms of battery substitution). A large portion of the energy of sensor applications is spent in node discovery as nodes need to periodically advertise their presence and be awake to discover other nodes for data exchange. The optimization of energy consumption, which is generally a hard task in fixed sensor networks, is even harder in mobile sensor networks, where the neighbouring nodes change over time. In this paper we propose an algorithm for energy efficient node discovery in sparsely connected mobile wireless sensor networks. The work takes advantage of the fact that nodes have temporal patterns of encounters and exploits these patterns to drive the duty cycling. Duty cycling is seen as a sampling process and is formulated as an optimization problem. We have used reinforcement learning techniques to detect and dynamically change the times at which a node should be awake as it is likely to encounter other nodes. We have evaluated our work using real human mobility traces, and the paper presents the performance of the protocol in this context.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

Towards diagnostic simulation in sensor networks 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Khan, Mohammad Maifi Hasan Abdelzaher, Tarek Gupta, Kamal Kant Univ Illinois Dept Comp Sci Chicago IL 60680 USA

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

While deployment and practical on-site testing remains the ultimate touchstone for sensor network code, good simulation tools can help curtail in-field troubleshooting time. Unfortunately, current simulators are successful only at evaluating system performance and exposing manifestations of errors. They are not designed to diagnose the root cause of the exposed anomalous behavior. This paper presents a diagnostic simulator, implemented as an extension to TOSSIM [6]. It (i) allows the user to ask questions such as "why is (some specific) bad behavior occurring?", and (ii) conjectures on possible causes of the user-specified behavior when it is encountered during simulation. The simulator works by logging event sequences and states produced in a regular simulation run. It then uses sequence extraction, and frequent pattern analysis techniques to recognize sequences and states that are possible root causes of the user-defined undesirable behavior. To evaluate the effectiveness of the tool, we have implemented the directed diffusion protocol and used our tool during the development process. During this process the tool was able to uncover two design bugs that were not addressed in the original protocol. The manifestation of these two bugs were same but the causes of failure were completely different - one was triggered by node reboot and the other was triggered by an overflow of timestamps generated by the local clock. The case study demonstrates a success scenario for diagnostic simulation.

关键词： sensor network diagnostic simulation frequent pattern mining

来源：评论

学校读者我要写书评

暂无评论

Frugal sensor assignment 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Johnson, Matthew P. Rowaihy, Hosam Pizzocaro, Diego Bar-Noy, Amotz Chalmers, Stuart La Porta, Thomas Preece, Alun CUNY Grad Ctr Dept Comp Sci New York NY 10021 USA Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Cardiff Univ Sch Comp Sci Cardiff CF10 3AX S Glam Wales Univ Aberdeen Dept Comp Sci Aberdeen AB9 1FX Scotland

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In general, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In the dynamic setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help based on the value of the mission, the sensor's remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A receiver-based opportunistic forwarding protocol for mobile sensor networks

A receiver-based opportunistic forwarding protocol for mobil...

引用

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

作者： Li, Lian Ma, Jian Sun, Limin Chen, Canfeng Beijing Institute of Technology Beijing China Naval Aeronautical and Astronautical University Yantai China Nokia Research Center Beijing China Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769531731

In mobile sensor networks, the mobility of nodes leads to frequent changes of network topology, therefore the communication links between source nodes and Sink vary dynamically. The Receiver-based Routing protocols do not need to establish global routing between source nodes and Sink, but allow the neighbor nodes of the sender to contend for the forwarding right under certain rules, and only the contention winner has the right to forward data. Existing Receiver-based Routing protocols can be applied to the mobile sensor networks, but they suffer from some disadvantages in the fields of forwarding priority calculation, data collisions, multicast suppression and routing void. A Receiver-based Opportunistic Forwarding protocol (ROF) was proposed in this paper. The ROF protocol optimized the forwarding priority calculation, and designed a dual-channel based forwarding right contention mechanism, which dealt with the data collision and multicast suppression problem better, and put forward an efficient mechanism for routing void bypass. The simulation results show that ROF is excellent in the aspects of communication consumption, forwarding delay and reliability. © 2008 ieee.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

The (k,l) coredian tree for ad hoc networks

The (k,l) coredian tree for ad hoc networks

引用

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

作者： Dvir, Amit Segal, Michael Department of Communication Systems Engineering Ben Gurion University of the Negev Israel

ISBN: (纸本)9780769531731

In this paper, we present new efficient strategy for constructing a wireless tree network containing n nodes of diameter Δ while satisfying the QoS requirements such as bandwidth and delay. Given a tree network T, a coredian path is a path in T that minimizes the centdian function, a k-coredian tree is a subtree of T with k leaves that minimizes the centdian function, and a (k, l)-coredian tree is a subtree of T with k leaves and diameter l at most that minimizes the centdian function. The (k, l)-coredian tree can serve as a backbone for a network, where intermediate nodes belong to the backbone and the leaves serve as the heads of the clusters covering the rest of the network. We show that a coredian path can be constructed at O(Δ) time with O(n) messages and a k-coredian tree can be constructed at O(k) time with O(kn) messages. While a (k, l)-coredian tree can be constructed at O(n2) time with O(n2) messages. A simulation is presented for various values of n and k. © 2008 ieee.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

Towards a distributed clustering scheme based on spatial correlation in WSNs

Towards a distributed clustering scheme based on spatial cor...

引用

international Wireless Communications and Mobile computing conference, IWCMC 2008

作者： Le, Trong Duc Pham, Ngoc Duy Choo, Hyunseung School of Information and Communication Engineering Sungkyunkwan University Korea Republic of

ISBN: (纸本)9781424422029

In the development of various large-scale sensor systems, a particularly challenging problem is how to dynamically organize the sensor nodes into clusters and route the sensing information to a remote base station. By leveraging the spatial correlation, there have been some noteworthy clustering schemes proposed recently, such as EEDC and ASAP. However, they are based on an impractical assumption of single-hop network architecture, and the cluster construction communication cost is relatively high. With such motivation, we introduce a novel distributed clustering scheme to group the sensor nodes that have the highest similarity in observations into the same cluster and also construct a dynamic backbone of efficient data collection in wireless sensor networks. Accordingly, with a given spatial accuracy requirement, only part of the sensor nodes in each cluster should be required to work for sampling and data transmitting in order to save energy. Comprehensive computer simulations show that the proposed scheme significantly reduces the overall number of communications in the cluster construction phase, whilst maintaining the small variance between the readings of sensor nodes in the same clusters. © 2008 ieee.

关键词： sensor nodes

来源：评论

学校读者我要写书评

暂无评论

FIT: A flexible, light-weight, and real-time scheduling system for wireless sensor platforms 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Dong, Wei Chen, Chun Liu, Xue Zheng, Kougen Chu, Rui Bu, Jiajun Zhejiang Univ Coll Comp Sci 973 WSN Joint Lab Hangzhou 310027 Zhejiang Peoples R China McGill Univ Sch Comp Sci Montreal PQ H3A 2T5 Canada Natl Univ Def Technol Changsha Hunan Peoples R China

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

We propose FIT, a flexible, light-weight and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hierarchical framework supports customizable application-specific scheduling policies, hence FIT is very flexible. Second, FIT is light-weight in terms of minimizing thread number to reduce preemptions and memory consumption while at the same time ensuring system schedulability. We propose a novel Minimum Thread Scheduling Policy (MTSP) exploration algorithm within FIT to achieve this goal. Finally, FIT provides a detailed real-time schedulability analysis method to help check if application's temporal requirements can be met. We implemented FIT on MICAz motes, and carried out extensive evaluations. Results demonstrate that FIT is indeed flexible and light-weight for implementing real-time applications, at the same time, the schedulability analysis provided can predict the real-time behavior. FIT is a promising scheduling system for implementing complex real-time applications in sensor networks.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

Data collection with multiple mobile actors in underwater sensor networks

Data collection with multiple mobile actors in underwater se...

引用

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

作者： Wang, Jincheng Li, Deshi Zhou, Mi Ghosal, Dipak Wuhan University School of Electronic Information Wuhan 430079 China University of California Davis Department of Computer Science Davis CA 95616 United States

ISBN: (纸本)9780769531731

Underwater sensor Networks (USNs) could provide real time in-situ monitoring to supply high spatiotemporal resolution capability. However underwater environment represents many challenges for sensor networks. It has become an urgent problem to get high temporal precision sampling data from USNs and to prolong USNs' lifetime at the same time. In this paper, we present an underwater application model for collecting detail data from USNs with multiple mobile actors to get high temporal resolution capability. Our proposed complete strategy works in two ways: local base station collects sensors' data with regular time resolution, and mobile actors collect data from virtual clusters with high temporal resolution. We present three algorithms to accomplish the network model: a) area partitioning and actors scattering algorithm, b) sub-region optimizing algorithm, and c) virtual cluster formation algorithm. The paper present simulations to evaluate our proposed algorithms. The results indicates that our strategy can achieve lower end-toend delay which is one eighth of that by former methods, actors can collect high temporal resolution data through virtual clusters, local network alternates within two network states(local USN and virtual clusters) freely. At the same time, since the proposed approach does not reduce local USNs' lifetime, it has great potential in underwater network applications. © 2008 ieee.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

Automatic collection of fuel prices from a network of mobile cameras 1

引用

4th ieee international conference on distributed computing in sensor systems

作者： Dong, Y. F. Kanhere, S. Chou, C. T. Bulusu, N. Univ New S Wales Sch Comp Sci & Engn Sydney NSW Australia Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (数字)9783540691709

ISBN: (纸本)9783540691693

It is an undeniable fact that people want information. Unfortunately, even in today's highly automated society, a lot of the information we desire is still manually collected. An example is fuel prices where websites providing fuel price information either send their workers out to manually collect the prices or depend on volunteers manually relaying the information. This paper proposes a novel application of wireless sensor networks to automatically collect fuel prices from camera images of road-side price board (billboard) of service (or gas) stations. Our system exploits the ubiquity of mobile phones that have cameras as well as users contributing and sharing data. In our proposed system, cameras of contributing users will be automatically triggered when they get close to a service station. These images will then be processed by computer vision algorithms to extract the fuel prices. In this paper, we will describe the system architecture and present results from our computer vision algorithms. Based on 52 images, our system achieves a hit rate of 92.3% for correctly detecting the fuel price board from the image background and reads the prices correctly in 87.7% of them. To the best of our knowledge, this is the first instance of a sensor network being used for collecting consumer pricing information.

关键词： automatic data collection computer-vision-based sensing consumer pricing information gathering participatory sensor networks vehicular sensor networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共318页 << < 241 242 243 244 245 246 247 248 249 250 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：