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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Trajectory Approximation for Resource Constrained Mobile sensor Networks

Trajectory Approximation for Resource Constrained Mobile Sen...

引用

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

作者： Murtaza, Ghulam Kanhere, Salil S. Ignjatovic, Aleksandar Jurdak, Raja Jha, Sanjay Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia CSIRO Autonomous Syst Lab Brisbane Qld Australia

ISBN: (纸本)9781479946181

Low-power compact sensor nodes are being increasingly used to collect trajectory data from moving objects such as wildlife. The size of this data can easily overwhelm the data storage available on these nodes. Moreover, the transmission of this extensive data over the wireless channel may prove to be difficult. The memory and energy constraints of these platforms underscores the need for lightweight online trajectory compression albeit without seriously affecting the accuracy of the mobility data. In this paper, we present a novel online Polygon Based Approximation (PBA) algorithm that uses regular polygons, the size of which is determined by the allowed spatial error, as the smallest spatial unit for approximating the raw GPS samples. PBA only stores the first GPS sample as a reference. Each subsequent point is approximated to the centre of the polygon containing the point. Furthermore, a coding scheme is proposed that encodes the relative position (distance and direction) of each polygon with respect to the preceding polygon in the trajectory. The resulting trajectory is thus a series of bit codes, that have pair-wise dependencies at the reference point. It is thus possible to easily reconstruct an approximation of the original trajectory by decoding the chain of codes starting with the first reference point. Encoding a single GPS sample is an O(1) operation, with an overall complexity of O(n). Moreover, PBA only requires the storage of two raw GPS samples in memory at any given time. The low complexity and small memory footprint of PBA make it particularly attractive for low-power sensor nodes. PBA is evaluated using GPS traces that capture the actual mobility of flying foxes in the wild. Our results demonstrate that PBA can achieve up to nine-fold memory savings as compared to Douglas-Peucker line simplification heuristic. While we present PBA in the context of low-power devices, it can be equally useful for other GPS-enabled devices such smartphones and car nav

关键词： Animal Habitat monitoring Flying Foxes GPS trajectory approximation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Data Selection for Maximum Coverage in sensor Networks with Cost Constraints

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

引用

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

作者： Rager, Scott T. Ciftcioglu, Ertugrul N. La Porta, Thomas F. Leung, Alice Dron, William Ramanathan, Ram Hancock, John Penn State Univ University Pk PA 16802 USA Raytheon BBN Technol Cambridge MA 02138 USA Artistech Inc Fairfax VA 22030 USA

ISBN: (纸本)9781479946181

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 algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Enhancement and Evaluation of ieee 802.11ah Multi-Access Point Network using Restricted Access Window Mechanism

Performance Enhancement and Evaluation of IEEE 802.11ah Mult...

引用

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

作者： Raeesi, Orod Pirskanen, Juho Hazmi, Ali Talvitie, Jukka Valkama, Mikko Tampere Univ Technol FI-33720 Tampere Finland Broadcom Corp Tampere Finland

ISBN: (纸本)9781479946181

Internet of Things (IoT) and Machine-to-Machine (M2M) applications are typically characterized by moderate investment costs to the M2M devices and infrastructure, in addition to the high reliability and energy efficiency requirements. The new Sub-1 GHz WiFi standard, namely the ieee 802.11ah, is being introduced to address these requirements deploying its recently specified MAC and PHY features and mechanisms. In this paper, we present an extensive analysis of ieee 802.11ah network performance by means of realistic system level simulations. In particular, we focus on realistic performance evaluation and enhancement study of the ieee 802.11ah network when multi-access points (multi-APs) with relatively high number of associated stations (STAs) are considered. The performance evaluation of the multi-AP ieee 802.11ah network considers one of the main proposed MAC enhancement schemes for collision reduction, namely, the Restricted Access Window (RAW) mechanism. The analysis results confirm the importance of this novel mechanism to improve substantially the overall system performance from both network throughput and energy efficiency perspectives. Overall, the technical findings reported in this article strengthen the prospects of ieee 802.11ah as one of the key enabling technologies for wide-scale low-cost and energy-efficient M2M deployments and IoT applications in the future.

关键词： ieee 802.11ah Internet of Things Machine-to-Machine multi-APs Restricted Access Window

来源：评论

学校读者我要写书评

暂无评论

Context-Oriented Programming for Adaptive Wireless sensor Network Software

Context-Oriented Programming for Adaptive Wireless Sensor Ne...

引用

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

作者： Afanasov, Mikhail Mottola, Luca Ghezzi, Carlo Politecn Milan Milan Italy SICS Swedish ICT Kista Sweden

ISBN: (纸本)9781479946181

We present programming abstractions for implementing adaptive Wireless sensor Network (WSN) software. The need for adaptability arises in WSNs because of unpredictable environment dynamics, changing requirements, and resource scarcity. However, after about a decade of research in WSN programming, developers are still left with no dedicated support. To address this issue, we bring concepts from Context-Oriented Programming (COP) down to WSN devices. Contexts model the situations that WSN software needs to adapt to. Using COP, programmers use a notion of layered function to implement context-dependent behavioral variations of WSN code. To this end, we provide language-independent design concepts to organize the context-dependent WSN operating modes, decoupling the abstractions from their concrete implementation in a programming language. Our own implementation, called CONESC, extends nesC with COP constructs. Based on three representative applications, we show that CONESC greatly simplifies the resulting code and yields increasingly decoupled implementations compared to nesC. For example, by model-checking every function in either implementations, we show a similar to 50% reduction in the number of program states that programmers need to deal with, indicating easier debugging. In our tests, this comes at the price of a maximum 2.5% (4.5%) overhead in program (data) memory.

关键词： context embedded languages programming self-adaptivity sensor networks Wireless sensor networks Programming WSN gene Language embedding National Electrical Safety Code (NESC) Computer personnel resource scarcity CARD16 gene sensor networks Computer Programming Languages design concept

来源：评论

学校读者我要写书评

暂无评论

Harnessing Non-Uniform Transmit Power Levels for Improved Sequence Based Localization

Harnessing Non-Uniform Transmit Power Levels for Improved Se...

引用

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

作者： Deora, Suvil Krishnamachari, Bhaskar Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781479946181

Sequence-based localization (SBL) is a technique whereby a node is localized based on the ranked sequence of signal strengths obtained from a set of beacon nodes. SBL effectively partitions the area into regions corresponding to unique ranked sequences. Prior work has developed SBL under the assumption that all beacons have the same transmit power. In this work, we consider beacons with unequal transmit power for sequence-based localization and present heuristic algorithms for joint transmit power optimization and beacon placement. We show through comprehensive simulations that a novel enhancement of SBL utilizing optimized non-uniform transmit powers, coupled with careful beacon placement, which we refer to as NU-SBL, can dramatically improve the area partitioning compared to traditional SBL. However, in evaluating these schemes under stochastic fading, we find that the original SBL with optimized location performs nearly as well or slightly better than NU-SBL in many cases. We introduce another scheme, that we refer to as NU-SBL-ZOOM, which further allows the power levels to be optimized non-uniformly so as to focus in on a particular smaller region within the larger localization space. NU-SBL-ZOOM is found to perform much better in terms of both area partitioning as well as location error in the presence of fading.

关键词： calibration free indoor localization location optimization location sequence particle filter power optimization sequence based localization wifi wireless sensor network Transmitter power Wi-Fi short base line Particle filters Wireless sensor networks Beacons location error fading color

来源：评论

学校读者我要写书评

暂无评论

A Survey on (mobile) wireless sensor network experimentation testbeds

A Survey on (mobile) wireless sensor network experimentation...

引用

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

作者： Tonneau, Anne-Sophie Mitton, Nathalie Vandaele, Julien Inria Lille Nord Europe Lille France

ISBN: (纸本)9781479946181

With the development of new technologies, these last years have witnessed the emergence of a new paradigm: the Internet of Things (IoT) and of the physical world. We are now able to communicate and interact with our surrounding environment through the use of multiple tiny sensors, RFID technologies or small wireless robots. This allows a set of new applications and usages to be envisioned ranging from logistic and traceability purposes to emergency and rescue operations going through the monitoring of volcanos or forest fires. However, all this comes with several technical and scientific issues like how to ensure the reliability of wireless communications in disturbed environments, how to manage efficiently the low resources (energy, memory, etc) or how to set a safe and sustainable maintenance. All these issues are addressed by researchers all around the world but solutions designed for IoT need to face real experimentations to be validated. To ease such experimentations for IoT, several experimental testbeds have been deployed offering diverse and heterogeneous services and tools. This article studies the different requirements and features such facilities should offer and survey the different experimental facilities currently available for the community, the different hardware used (as sensors and robots) and the scope of their services. We expect this survey assist a potential user to easily choose the one to use regarding his own needs. Finally, we identify existing gaps and difficulties and investigate new directions for such facilities.

关键词： Experimentation platforms Internet of Things Mobility Testbed Internet of things experimentation mobility Rescue Robot CARRIER SYSTEM ambient environment Wireless sensor networks sensors Legal Services

来源：评论

学校读者我要写书评

暂无评论

Robust Compressive Data Gathering in Wireless sensor Networks with Linear Topology

Robust Compressive Data Gathering in Wireless Sensor Network...

引用

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

作者： Mahmudimanesh, Mohammadreza Suri, Neeraj Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781479946181

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.

关键词： Data Collection Methods linear topology Wireless sensor networks civil construction Load balancing WSN gene carbon monosulfide CONTAINMENT SPRAY Cesium Ganglia Messages

来源：评论

学校读者我要写书评

暂无评论

Low-Power Listening Goes Multi-Channel

Low-Power Listening Goes Multi-Channel

引用

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

作者： Al Nahas, Beshr Duquennoy, Simon Iyer, Venkatraman Voigt, Thiemo SICS Swedish ICT AB Kista Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781479946181

Exploiting multiple radio channels for communication has been long known as a practical way to mitigate interference in wireless settings. In Wireless sensor Networks, however, multi-channel solutions have not reached their full potential: the MAC layers included in TinyOS or the Contiki OS for example are mostly single-channel. The literature offers a number of interesting solutions, but experimental results were often too few to build confidence. We propose a practical extension of low-power listening, MiCMAC, that performs channel hopping, operates in a distributed way, and is independent of upper layers of the protocol stack. The above properties make it easy to deploy in a variety of scenarios, without any extra configuration/scheduling/channel selection hassle. We implement our solution in Contiki and evaluate it in a 97-node testbed while running a complete, out-of-the-box low-power IPv6 communication stack (UDP/RPL/6LoWPAN). Our experimental results demonstrate increased resilience to emulated WiFi interference (e.g., data yield kept above 90% when ContikiMAC drops in the 40% range). In noiseless environments, MiCMAC keeps the overhead low in comparison to ContikiMAC, achieving performance as high as 99% data yield along with sub-percent duty cycle and sub-second latency for a 1-minute inter-packet interval data collection.

关键词： 6LoWPAN Channel Hopping Contiki IoT Low Power MAC Multichannel Wireless sensor Networks MAXIMUM ACCEPTABLE CONTAMINATION Media Access Protocol LOW POWER Wireless sensor networks MULTICHANNEL wireless channels Auscultation Listening

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Dron, Wilfried Duquennoy, Simon Voigt, Thiemo Hachicha, Khalil Garda, Patrick Univ Paris 06 UMR 7606 Lab Informat Paris 6 F-75005 Paris France CNRS UMR7606 LIP6 F-75005 Paris France SICS Swedish ICT AB Uppsala Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781479946181

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.

关键词： Firmware

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：