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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,147 篇 会议
12 篇 期刊文献
2 册 图书

馆藏范围

1,161 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

829 篇 工学
- 728 篇 计算机科学与技术...
- 381 篇 电气工程
- 245 篇 信息与通信工程
- 200 篇 测绘科学与技术
- 196 篇 软件工程
- 177 篇 机械工程
- 89 篇 控制科学与工程
- 33 篇 动力工程及工程热...
- 23 篇 电子科学与技术（可...
- 21 篇 仪器科学与技术
- 12 篇 安全科学与工程
- 11 篇 交通运输工程
- 8 篇 网络空间安全
- 7 篇 土木工程
- 5 篇 建筑学
- 4 篇 力学（可授工学、理...
- 3 篇 光学工程
117 篇 理学
- 90 篇 数学
- 22 篇 统计学（可授理学、...
- 15 篇 物理学
- 9 篇 系统科学
- 8 篇 化学
- 5 篇 生物学
- 3 篇 大气科学
77 篇 管理学
- 58 篇 管理科学与工程(可...
- 32 篇 工商管理
- 32 篇 图书情报与档案管...
11 篇 医学
- 10 篇 临床医学
3 篇 经济学
- 3 篇 应用经济学
3 篇 法学
- 3 篇 社会学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

357 篇 wireless sensor ...
82 篇 distributed comp...
78 篇 sensors
61 篇 protocols
58 篇 distributed comp...
57 篇 sensor systems
56 篇 wireless communi...
43 篇 sensor networks
38 篇 energy consumpti...
37 篇 computer science
37 篇 routing
34 篇 monitoring
33 篇 mobile communica...
32 篇 delay
31 篇 wireless telecom...
30 篇 mobile computing
30 篇 computer network...
29 篇 internet of thin...
28 篇 sensor phenomena...
27 篇 wireless sensor ...

机构

7 篇 nanjing univ sta...
5 篇 suny stony brook...
4 篇 uppsala univ upp...
4 篇 college of compu...
4 篇 univ cyprus dept...
4 篇 school of electr...
4 篇 chalmers univ te...
3 篇 tech univ carolo...
3 篇 institute of ope...
3 篇 dalian univ tech...
3 篇 school of big da...
3 篇 univ fed minas g...
3 篇 univ missouri de...
3 篇 univ kiel kiel
3 篇 georgia state un...
3 篇 hamburg univ tec...
3 篇 department of co...
3 篇 washington univ ...
3 篇 eth dept comp sc...
3 篇 univ cyprus dept...

作者

10 篇 voigt thiemo
8 篇 bar-noy amotz
8 篇 vassiliou vasos
8 篇 kulau ulf
8 篇 nikoletseas soti...
7 篇 landsiedel olaf
7 篇 wolf lars
6 篇 xing guoliang
6 篇 thiemo voigt
6 篇 beferull-lozano ...
6 篇 rolim jose
6 篇 angelopoulos con...
6 篇 agrawal dharma p...
6 篇 duquennoy simon
5 篇 baltasar beferul...
5 篇 dai haipeng
5 篇 lars wolf
5 篇 cao jiannong
5 篇 sotiris nikolets...
5 篇 das sajal k.

语言

1,150 篇 英文
9 篇 其他
2 篇 中文

检索条件"任意字段=First IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2005"

共 1161 条记录，以下是361-370 订阅

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

详细简洁

排序：

Data Selection for Maximum Coverage in sensor Networks with Cost Constraints

Data Selection for Maximum Coverage in Sensor Networks with ...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Scott T. Rager Ertugrul N. Ciftcioglu Thomas F. La Porta Alice Leung William Dron Ram Ramanathan John Hancock The Pennsylvania State University University Park PA Raytheon BBN Technologies Cambridge MA Artistech Inc. Fairfax VA

In many deployments of wireless sensor networks (WSNs), the primary goal is to collect and deliver data from many nodes to a data sink. This goal must be met while considering limited resources, such as battery life, in the wireless nodes. In this work, we propose considering the content of generated data to make intelligent data and node selection decisions. We formally present the problem of maximizing coverage of this collected data while restricting individual node costs to remain within a given budget and provide an algorithm that provides the optimal solution. Next we consider the related problem of finding the optimal long-term average coverage subject to average cost constraints and give its solution, which uses Lyapunov Optimization techniques. For real world implementations, we also provide computationally feasible approximation algorithms of both problems along with proven bounds on their performance, including a novel technique that uses virtual queues for the average maximum coverage problem. Finally, we provide simulation results of all proposed algorithms. These results not only demonstrate the benefits of considering data content in scheduling, but also show the advantages from using the long-term average solution and the near-optimal performance of our greedy virtual queue approximation algorithm.

关键词： Approximation methods Approximation algorithms Wireless sensor networks Optimization Greedy algorithms Time factors Search problems

来源：评论

学校读者我要写书评

暂无评论

A Novel Wake-Up Receiver with Addressing Capability for Wireless sensor Nodes

A Novel Wake-Up Receiver with Addressing Capability for Wire...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Chiara Petrioli Dora Spenza Pasquale Tommasino Alessandro Trifiletti Computer Science Deparment University of Rome “La Sapienza” Department of Information Electronical and Telecommunications Engineering University of Rome “La Sapienza”

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 pass-band 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 converge casting 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.

关键词： Receivers Wireless sensor networks Sensitivity Prototypes Radio frequency Relays Protocols

来源：评论

学校读者我要写书评

暂无评论

Robust Compressive Data Gathering in Wireless sensor Networks with Linear Topology

Robust Compressive Data Gathering in Wireless Sensor Network...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Mohammadreza Mahmudimanesh Neeraj Suri Technical University of Darmstadt Germany

Wireless sensor Networks (WSNs) are deployed in a variety of topologies and configurations depending on specific applications and requirements. In this paper, we study a simple and yet very important class of the WSN topologies, the linear or chain topology in which the sensor Nodes (SNs) are connected in a series and gather the sensed data at a single base station or sink at the end of the chain. WSNs with linear topology have many practical applications, e.g., in infrastructure monitoring and surveillance of civil constructions. There is a large body of research on efficient data gathering techniques to transmit the sensed data over WSNs' limited communication bandwidth. In particular for linear topology, data collection technique has to put a balanced load on all SNs to avoid breakage of the chain at the exhausted nodes. Compressed Sensing (CS) is an efficient data collection technique for WSNs that fulfills these requirements. In a failure-free scenario, CS avoids exhausted nodes by balancing the communication and processing load on the SNs. In this paper, we examine the performance of a special implementation of CS for WSNs, called Compressive Data Gathering (CDG) when a SN in a chain WSN encounters a failure and cannot forward messages to the next hop. We propose a method to enhance the robustness of CDG in such failure scenarios by transmitting the messages to the next healthy node and excluding the failed samples from CS signal recovery mechanism. Evaluations show that our method effectively withstands the failures without sacrificing the accuracy of the collected data.

关键词： Wireless sensor networks Tin Vectors Topology Pollution measurement Data collection Temperature measurement

来源：评论

学校读者我要写书评

暂无评论

An Emulation-Based Method for Lifetime Estimation of Wireless sensor Networks

An Emulation-Based Method for Lifetime Estimation of Wireles...

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Wilfried Dron Simon Duquennoy Thiemo Voigt Khalil Hachicha Patrick Garda UPMC Univ Paris 6 LIP6 Paris France SICS Swedish ICT AB Sweden

Lifetime estimation in Wireless sensor Networks (WSN) is crucial to ensure that the network will last long enough (low maintenance cost) while not being over-dimensioned (low initial cost). Existing solutions have at least one of the two following limitations: (1) they are based on theoretical models or high-level protocol implementations, overlooking low-level (e.g., hardware, driver, etc.) constraints which we find have a significant impact on lifetime, and (2) they use an ideal battery model which over-estimates lifetime due to its constant voltage and its inability to model the non-linear properties of real batteries. We introduce a method for WSN lifetime estimation that operates on compiled firmware images and models the complex behavior of batteries. We use the MSPSim/Cooja node emulator and network simulator to run the application in a cycle-accurate manner and log all component states. We then feed the log into our lifetime estimation framework, which models the nodes and their batteries based on both technical and experimental specifications. In a case study of a Contiki RPL/6LoWPAN application, we identify and resolve several low-level implementation issues, thereby increasing the predicted network lifetime from 134 to 484 days. We compare our battery model to the ideal battery model and to the lifetime estimation based on the radio duty cycle, and find that there is an average over-estimation of 36% and 76% respectively.

关键词： Batteries Estimation Microprogramming Hardware Emulation Wireless sensor networks Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

international conference on distributed computing in sensor systems (dcoss)

作者： Ashutosh Bhatia R.C. Hansdah Dept. of Computer Science and Automation Indian Institute of Science Bangalore

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.

关键词： Time division multiple access Schedules Wireless sensor networks Heuristic algorithms Vectors Protocols Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Networked Sensing and distributed Kalman-Bucy Filtering based on Dynamic Average Consensus

Networked Sensing and Distributed Kalman-Bucy Filtering base...

引用

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

作者： George, Jemin US Army Res Lab Adelphi MD 20783 USA

ISBN: (纸本)9780769550411

This paper presents the formulation of distributed Kalman-Bucy filter algorithm for a network of autonomous sensors, which is modeled as a connected undirected graph. Development of the distributed Kalman-Bucy filter is formulated as two average consensus problems in terms of weighted inverse of measurement noise covariance matrices and weighted measurements. The proposed algorithm utilizes the static average consensus protocol to solve the first consensus problem and the proportional-integral based dynamic average consensus protocol to solve the latter. The distributed Kalman-Bucy filter algorithm is optimal in the sense that the performance of the proposed algorithm asymptotically approaches that of a centralized filter. Numerical simulations are presented to demonstrate the performance of the proposed scheme.

关键词： Kalman filters graph theory protocols sensor fusion wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Distributive Model-based sensor Fault Diagnosis in Wireless sensor Networks

Distributive Model-based Sensor Fault Diagnosis in Wireless ...

引用

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

作者： Lo, Chun Liu, Mingyan Lynch, Jerome P. Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9780769550411

This poster presents a distributed model-based fault detection algorithm which is based on local pair-wise verification. We first show that there exists a linear relationship between the outputs of any pair of sensors. Therefore, a network can be partitioned into sensor pairs, and the relationship between a pair of sensors can be modeled by a linear model. In addition to detecting general faults happened within a sensor pair, we developed an algorithm for identifying non-linearity type of fault without the use of reference sensors. Preliminary performance analysis shows that this scalable algorithm achieves high diagnosis accuracy. Communication power is also greatly reduced by the distributed nature of the algorithm.

关键词： fault diagnosis wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed computing Framework for Underwater Acoustic sensor Networks

Distributed Computing Framework for Underwater Acoustic Sens...

引用

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

作者： Pandey, Parul Pompili, Dario Rutgers State Univ Dept Elect & Comp Engn New Brunswick NJ 08903 USA

ISBN: (纸本)9780769550411

The goal of this paper is to enable near-realtime acquisition and processing of high resolution, high-quality, heterogeneous data from mobile and static sensing platforms to advance ocean exploration by providing infrastructure for a distributed computing framework. Reaching this goal will improve the efficiency of monitoring dynamic oceanographic phenomena such as phytoplankton growth and rate of photosynthesis, salinity and temperature gradient, and concentration of pollutants. resource provisioning framework for organizing the heterogeneous sensing, computing, and communication capabilities of static and mobile devices in the vicinity in order to form an elastic resource pool a hybrid static/mobile computing grid is presented. This local computing grid can be harnessed to enable innovative data- and compute-intensive mobile applications such as onshore near-real-time data processing, analysis and visualization, mission planning and online ocean adaptive sampling.

关键词： mobile computing underwater acoustic communication wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Uncovering the Impact of Minimum-Energy Routing on Lifetime of Wireless sensor Networks

Uncovering the Impact of Minimum-Energy Routing on Lifetime ...

引用

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

作者： Soylev, Arda Bicakci, Kemal Tavli, Bulent KTO Karatay Univ Dept Comp Engn Konya Turkey

ISBN: (纸本)9780769550411

It is well-known that in wireless sensor networks using minimum-energy paths to transfer data from sensor nodes to base station is not an energy-balancing option and not the optimal solution if lifetime, defined as the duration till the first node in the network exhausts all its energy, is of concern. However, the net effect of minimum-energy routing on network lifetime has not been studied in detail before. In this study, we present comparative analysis using both simulations and linear programming models to investigate this issue with respect to various system parameters such as energy model, network area and number of nodes. Our results show that network lifetime achieved with minimum-energy routing could be as low as 19.3% of the maximum achievable lifetime depending on the values of other system parameters.

关键词： Wireless sensor network linear programming network lifetime routing energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Lightweight Software Model for Target Localization in Wireless sensor Networks

Lightweight Software Model for Target Localization in Wirele...

引用

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

作者： Misra, Rajiv Shukla, Shailendra Chandel, Vivek Indian Inst Technol Patna Bihar India

ISBN: (纸本)9780769550411

In this poster, we present a new lightweight multi-threaded software model for target location detection system. Our localization algorithm is based on trilateration using RSSI for ranging. This work can be applied for collecting the location information of mobile sensor nodes in the network. Our software runs on the sensor nodes and on the base station. To support our clam we performed experimental analysis on telosb motes.

关键词： Localization RSSI Trilateration Software Model Wireless sensor Networks Tracking Experimentation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：