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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

235 篇 会议
1 篇 期刊文献

馆藏范围

236 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

192 篇 工学
- 150 篇 计算机科学与技术...
- 138 篇 电气工程
- 53 篇 信息与通信工程
- 43 篇 测绘科学与技术
- 22 篇 软件工程
- 12 篇 控制科学与工程
- 11 篇 机械工程
- 7 篇 电子科学与技术（可...
- 7 篇 生物工程
- 5 篇 仪器科学与技术
- 3 篇 动力工程及工程热...
- 2 篇 生物医学工程（可授...
- 2 篇 网络空间安全
- 1 篇 光学工程
- 1 篇 建筑学
18 篇 理学
- 8 篇 数学
- 8 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 统计学（可授理学、...
11 篇 管理学
- 8 篇 管理科学与工程(可...
- 5 篇 图书情报与档案管...
- 3 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
1 篇 文学
- 1 篇 新闻传播学

主题

97 篇 wireless sensor ...
20 篇 sensors
15 篇 protocols
14 篇 wireless sensor ...
11 篇 internet of thin...
9 篇 monitoring
7 篇 cloud computing
7 篇 peer-to-peer com...
7 篇 energy efficienc...
6 篇 wireless communi...
6 篇 distributed comp...
6 篇 sensor networks
5 篇 telecommunicatio...
5 篇 throughput
5 篇 ganglia
5 篇 energy consumpti...
5 篇 distributed syst...
5 篇 mobile computing
5 篇 ubiquitous compu...
4 篇 sensor placement

机构

3 篇 tech univ carolo...
3 篇 college of compu...
2 篇 univ michigan an...
2 篇 uppsala univ upp...
2 篇 vrije univ bruss...
2 篇 georgia state un...
2 篇 institute of dat...
2 篇 tech univ darmst...
2 篇 swiss fed inst t...
2 篇 department of co...
2 篇 faculty of compu...
2 篇 global energy in...
2 篇 katholieke univ ...
2 篇 univ manchester ...
2 篇 key laboratory o...
2 篇 colorado sch min...
2 篇 tech univ carolo...
2 篇 univ otago dept ...
2 篇 univ york dept c...
1 篇 fed univ santa m...

作者

5 篇 wolf lars
4 篇 poettner wolf-ba...
4 篇 buesching felix
3 篇 li dongsheng
3 篇 lai zhiquan
3 篇 voigt thiemo
2 篇 gnawali omprakas...
2 篇 aderohunmu femi ...
2 篇 lo re giuseppe
2 篇 suri neeraj
2 篇 chuang cheng-lon...
2 篇 bai lin
2 篇 muthukkumarasamy...
2 篇 mitton nathalie
2 篇 lo chun
2 篇 kawamura takao
2 篇 chen chia-pang
2 篇 badache nadjib
2 篇 liu mingyan
2 篇 van der graaf sh...

语言

235 篇 英文
1 篇 中文

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

共 236 条记录，以下是71-80 订阅

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

详细简洁

排序：

Using Feedback Control within WSN's to meet Application Requirements

Using Feedback Control within WSN's to meet Application Requ...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Fairbairn, Mark Louis Bate, Iain Univ York Dept Comp Sci York YO10 5GH N Yorkshire England

Currently the main approach used to save power within WSN9;s is to employ reactive MAC schemes that detect when the network is becoming busy and adapt to provide an increase in available bandwidth. Once the traffic... 详细信息

ISBN: (纸本)9780769550411

Currently the main approach used to save power within WSN's is to employ reactive MAC schemes that detect when the network is becoming busy and adapt to provide an increase in available bandwidth. Once the traffic becomes lighter the available bandwidth is reduced to save power. While this works well with bursty sporadic traffic, there is a clear trade-off between latency of response and power savings. Other problems with this approach include hard to derive parameters along with their poor performance in periodic sense-and-send applications due to their reactive nature. We propose an adaptive feedback-based scheme that adjusts the duty cycle of the the motes to reduce the power consumed in typical sense-and-send applications by 58.4%, while still meeting a minimal level of service specified by the operator. Such an adaptive scheme is necessary to minimise power consumption as the complete network characteristics are unknown prior to deployment, and can change during runtime. Our approach is independent of node distribution and is also MAC layer agnostic, unlike the current state-of-the-art, whilst consuming less power. Our approach provides a simple method for the application designer to modify its behaviour, whilst allowing WSNs to operate longer and provide the same level of service as current approaches.

关键词： access protocols adaptive control feedback telecommunication control telecommunication power management wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Group Communication in Constrained Environments using CoAP-based Entities

Group Communication in Constrained Environments using CoAP-b...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Ishaq, Isam Hoebeke, Jeroen Van den Abeele, Floris Moerman, Ingrid Demeester, Piet Ghent Univ iMinds Dept Informat Technol INTEC Ghent Belgium

ISBN: (纸本)9780769550411

the Constrained Application Protocol (CoAP) is a new Internet protocol that is currently being standardized. CoAP allows access to the drastically increasing number of smart objects and their sensing resources from virtually anywhere. It is a light-weight protocol designed to cope with the restrictions imposed by the limited resources (CPU, memory, power,.) of many smart objects. Depending on the application, information from individual objects might not be sufficient, reliable, or useful. An application may need to aggregate and/or compare data from a group of objects in order to obtain accurate results. Although multicast may be used to transmit the same request to several objects, multicast communication with smart objects has some disadvantages. Programming individual requests is another solution but lacks flexibility and opportunities for reusability. In this paper we propose a novel CoAP-based approach for communication with a group of resources across multiple smart objects. this approach organizes the group of resources that should be accessed into a new CoAP resource, called an entity, and nicely integrates several important aspects of entity management: creation, validation, usage and manipulation. In order to demonstrate the feasibility of this approach we present an implementation and experimental validation.

关键词： Internet of things CoAP sensors wireless sensor networks group communication entities

来源：评论

学校读者我要写书评

暂无评论

Automatic sensor drift detection and correction using Spatial Kriging and Kalman filtering

Automatic Sensor drift detection and correction using Spatia...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Kumar, Dheeraj Rajasegarar, Sutharshan Palaniswami, Marimuthu Univ Melbourne Dept Elect & Elect Engn Melbourne Vic 3010 Australia

ISBN: (纸本)9780769550411

Internet-of-things (IoT) is a concept referring to interconnected people and objects and smart city is one of the many applications of IoT. Wireless sensor Network (WSN) is a specific technology that helps to create "Smart Cities". It aims at creating a distributed network of intelligent sensor nodes which can measure various parameters for efficient management of the city. the data thus collected through a range of sensors is processed and is delivered wirelessly in real-time to the citizens or the appropriate authorities. Since the application framework for smart city application is huge, it would require a large number of different types of sensors for its implementation and the project could be viable only if we use low resolution, low precision but inexpensive sensors. the sensors in sensor network can suffer from random or systematic errors. Most common problem with inexpensive sensors used in WSNs for smart city applications is of drift and bias. they can be calibrated at the time of deployment, but they develop drift, which is the slow change in the reading of sensor from actual value as time progresses. In this paper we have proposed a framework to automatically detect and correct the drift of the sensor nodes to keep the WSN usable. Kriging based interpolation of the sensor readings of neighboring sensors is used to predict actual value at the sensor node and the measured drift is then kalman filtered to get correct drift estimates. We have demonstrated the results of this algorithm on real sensor data obtained from Intel Research Berkeley Laboratory deployment and shown that our system is able to detect and correct smooth drift and bias generated in the sensors. We have also shown that our system is robust with respect to the number of sensor nodes drifting and significantly outperforms the traditional averaging based interpolation methods.

关键词： Internet of things Kalman filters geophysical techniques interpolation statistical analysis wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Hole Approximation-Dissemination Scheme for Bounded-Stretch Routing in sensor Networks

Hole Approximation-Dissemination Scheme for Bounded-Stretch ...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Nguyen, Phi-Le Nguyen, Khanh-Van Ha Noi Univ Sci & Technol Hanoi Vietnam

ISBN: (纸本)9781479946181

the routing stretch in a sensor network with a large hole can be controlled if the network nodes have certain information about the hole location and shape, possibly by using some mechanism for hole boundary approximation and information dissemination. Here, the nodes on the hole boundary cooperate to approximately compute the hole shape, and then a compact description info can be created and disseminated to the surrounding area. However, a finer approximation (for smaller stretch) leads to a higher cost of dissemination, which could unlikely be affordable for the sensors. We provide an insightful analysis to this fundamental trade-off of the hole approximation problem, using a geometric model. Based on this we discuss an efficient approximation-dissemination scheme using a natural, heuristic approximation technique. For reasonable conditions (network is dense enough apart from the hole), we assure that the routing stretch is under a predefined threshold. alpha > 1 while the dissemination cost is also under tight control. Our initial experiment results also confirm that our approach is significantly more efficient and economical, compared to existing proposals.

关键词： Energy Saving Routing hole Routing protocol Routing stretch sensor network sensor networks Routing protocols Holes Network routing energy saving Energy conservation Stretch approximation Dissemination Information Dissemination network node

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Deterministic Steiner Tree Maintenance in sensor Networks

Near-Optimal Deterministic Steiner Tree Maintenance in Senso...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Sharma, Gokarna Busch, Costas Louisiana State Univ Sch Elect Engn & Comp Sci Baton Rouge LA 70803 USA

ISBN: (纸本)9781479946181

We consider the group communication maintenance problem between a set of k mobile agents that are tracked by a static sensor network. We develop a scalable deterministic distributed algorithm for maintaining a Steiner tree of the agents so that group communication between them can be provided in the minimum cost possible. the main idea is that our algorithm maintains a virtual tree of mobile agents which can be immediately converted to an actual Steiner tree at all times. Our algorithm achieves the Steiner tree with total length at most O(log k) times the length of the minimum Steiner tree in the constant-doubling graph model. the total communication cost (messages) to maintain the Steiner tree is only O(min{log n, logD}) times the optimal communication cost, where n and D, respectively, are the number of nodes and the diameter of the network. We also develop improved algorithms for the k-center, sparse aggregation, and distributed matching problems. Experimental evaluation results show the benefits of our algorithms compared to previous algorithms. these four problems are NP-hard and, to the best of our knowledge, our algorithms are the first near-optimal deterministic algorithms for maintaining approximate solutions to these problems with low maintenance costs in a distributed setting.

关键词： sensor network Mobile agents Hierarchical structure Steiner tree k-center Aggregation Matching

来源：评论

学校读者我要写书评

暂无评论

Reliability-Based Splitting Algorithms for Time-Constrained distributed Detection in WSNs

Reliability-Based Splitting Algorithms for Time-Constrained ...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Laitrakun, Seksan Coyle, Edward J. Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

ISBN: (纸本)9780769550411

We consider distributed detection applications for a fusion center that has a limited time to collect, weight and fuse local decisions to produce a global decision in a wireless sensor network that uses a random access protocol. When this time is not long enough to collect decisions from all nodes in the network, a strategy is needed for collecting those with the highest reliability. this is accomplished by incorporating a reliability-based splitting algorithm into the random access protocol: the collection time is divided into frames and only nodes with a specified range of reliabilities compete for the channel within each frame. Nodes with the most reliable decisions attempt transmission in the first frame;nodes with the next most reliable set of decisions attempt in the next frame;etc. To ensure that the results we derive are lower bounds on the detection performance that would be seen in practice, the local decisions that arrive within a frame are assigned the smallest reliability in the range associated with that frame. Two performance measures are used: Detection Error Probability (DEP) and Asymptotic Relative Efficiency (ARE) of the proposed scheme relative to a TDMA-based scheme. We then show how to minimize the DEP by determining the reliability intervals that define which nodes attempt to transmit in each frame. Intervals that maximize the channel throughput will often, but not always, minimize the DEP of the proposed scheme. Necessary conditions for the optimality of the maximum throughput intervals are thus derived. Numerical results indicate that these conditions are often sufficient when the observation noise is Gaussian. From the ARE, we determine when the proposed scheme asymptotically outperforms a TDMA-based scheme.

关键词： Gaussian noise probability radio access networks radio transmitters random processes sensor fusion telecommunication network reliability time division multiple access wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Fast and Fault-Tolerant distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs

A Fast and Fault-Tolerant Distributed Algorithm for Near-Opt...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Bhatia, Ashutosh Hansdah, R. C. Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India

ISBN: (纸本)9781479946181

the time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. the primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. this would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. the algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.

关键词： Wireless sensor Networks Media Access Control TDMA scheduling

来源：评论

学校读者我要写书评

暂无评论

A Neighbour Disjoint Multipath Scheme for Fault Tolerant Wireless sensor Networks

A Neighbour Disjoint Multipath Scheme for Fault Tolerant Wir...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Hossain, A. K. M. Mahtab Sreenan, Cormac J. Fedor, Szymon Natl Univ Ireland Univ Coll Cork Dept Comp Sci Cork Ireland UTRC Ireland Ltd Cork Ireland

ISBN: (纸本)9781479946181

In this paper, we propose a "Neighbour Disjoint Multipath (NDM)" scheme that increases resilience against node or link failures in a wireless sensor network (WSN). Our algorithm chooses the shortest path between a sensor and the sink as the primary path, thus ensuring the algorithm is energy efficient under normal circumstances. In selecting the backup paths, we utilise the disjoint property to ensure that i) when there are k paths between source and sink, no set of k node failures can result in total communication break between them, and ii) by having (k - 1) spatially separated backup paths w.r.t. the primary path, the probability of simultaneous failure of the primary and backup paths is reduced in case of localised poor channel quality or node failures. Our algorithm not only ensures the node disjointedness characteristics of the constructed paths, but also tries to minimise the impact of localised node or link failures where a localised portion of the network may be unusable. We analyse the motivation behind our idea clearly, and discuss the algorithm in detail. We also compare the NDM scheme with other common multipath techniques such as node-disjoint and edge-disjoint approaches, and point out its effectiveness through simulation.

关键词： Neighbour disjoint multipath wireless sensor networks node-disjoint multipath edge-disjoint multipath resilience

来源：评论

学校读者我要写书评

暂无评论

Comparison of Accuracy Estimation Approaches for sensor Networks

Comparison of Accuracy Estimation Approaches for Sensor Netw...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Wen, Hongkai Xiao, Zhuoling Symington, Andrew Markham, Andrew Trigoni, Niki Univ Oxford Dept Comp Sci Oxford OX1 3QD England

ISBN: (纸本)9780769550411

With sensor technology gaining maturity and becoming ubiquitous, we are experiencing an unprecedented wealth of sensor data. In most sensing applications, users receive sensor measurements, which are prone to error. As a result, they are often annotated with some measure of uncertainty, such as the distribution variance or a confidence interval, and will be hereafter referred to as probabilistic measurements. the question that we address in this paper is how to estimate the accuracy of these probabilistic measurements, that is, how far they lie from the ground truth of the measured attribute. Existing studies on estimating the accuracy of probabilistic measurements in real sensing applications are limited in three ways. First, they tend to be application-specific. Second, they typically employ learning techniques to estimate the parameters of sensor noise models, and ignore alternative approaches that rely on simple state estimation without learning. third, they do not explore whether exploiting the dynamics of the monitored state can yield significant benefits in terms of accuracy estimation. In this paper, we address the above limitations as follows: We define the problem of accuracy estimation in a general way that applies to a wide spectrum of application scenarios. We then propose a taxonomy of accuracy estimation techniques, which include both state estimation and parameter learning. these techniques are further subdivided into static and dynamic, depending on whether they exploit knowledge of system dynamics. All different approaches in the taxonomy are then applied and compared with each other in the context of two real sensing applications. We discuss how they trade accuracy for computation cost, and how this tradeoff largely depends on the user's knowledge of the application scenario.

关键词： estimation theory probability state estimation wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Novel wake-up Receiver with Addressing Capability for Wireless sensor Nodes

A Novel wake-up Receiver with Addressing Capability for Wire...

引用

9th ieee international conference on distributed computing in sensor systems (dcoss)

作者： Petrioli, Chiara Spenza, Dora Tommasino, Pasquale Trifiletti, Alessandro Univ Roma La Sapienza Comp Sci Deparment Rome Italy Univ Roma La Sapienza Dept Informat Elect & Telecommun Engn Rome Italy

ISBN: (纸本)9781479946181

Emerging low-power radio triggering techniques for wireless motes are a promising approach to prolong the lifetime of Wireless sensor Networks (WSNs). By allowing nodes to activate their main transceiver only when data need to be transmitted or received, wake-up-enabled solutions virtually eliminate the need for idle listening, thus drastically reducing the energy toll of communication. In this paper we describe the design of a novel wake-up receiver architecture based on an innovative passband filter bank with high selectivity capability. the proposed concept, demonstrated by a prototype implementation, combines both frequency-domain and time-domain addressing space to allow selective addressing of nodes. To take advantage of the functionalities of the proposed receiver, as well as of energy-harvesting capabilities modern sensor nodes are equipped with, we present a novel wake-up-enabled harvesting-aware communication stack that supports both interest dissemination and convergecasting primitives. this stack builds on the ability of the proposed WuR to support dynamic address assignment, which is exploited to optimize system performance. Comparison against traditional WSN protocols shows that the proposed concept allows to optimize performance tradeoffs with respect to existing low-power communication stacks.

关键词： Wake-up radio communication stack energy harvesting wireless sensor networks Wireless sensor networks energy harvesting Receivers address assignment Ganglia Addressing Communication Research wireless

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共24页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：