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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,067 篇 会议
45 篇 期刊文献
5 册 图书

馆藏范围

5,117 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,134 篇 工学
- 3,184 篇 计算机科学与技术...
- 1,613 篇 电气工程
- 1,553 篇 信息与通信工程
- 1,282 篇 软件工程
- 556 篇 控制科学与工程
- 345 篇 动力工程及工程热...
- 265 篇 仪器科学与技术
- 251 篇 电子科学与技术（可...
- 201 篇 机械工程
- 112 篇 测绘科学与技术
- 111 篇 安全科学与工程
- 106 篇 网络空间安全
- 104 篇 石油与天然气工程
- 93 篇 交通运输工程
- 77 篇 环境科学与工程（可...
- 77 篇 生物工程
- 76 篇 生物医学工程（可授...
- 74 篇 材料科学与工程（可...
- 65 篇 化学工程与技术
832 篇 理学
- 442 篇 数学
- 207 篇 物理学
- 125 篇 化学
- 123 篇 统计学（可授理学、...
- 102 篇 系统科学
- 99 篇 生物学
574 篇 管理学
- 442 篇 管理科学与工程(可...
- 199 篇 图书情报与档案管...
- 172 篇 工商管理
101 篇 医学
- 82 篇 临床医学
- 65 篇 基础医学(可授医学...
64 篇 经济学
52 篇 法学
40 篇 农学
25 篇 军事学
14 篇 教育学
6 篇 文学
3 篇 艺术学

主题

620 篇 wireless sensor ...
168 篇 sensor nodes
140 篇 sensor systems
138 篇 distributed comp...
122 篇 wireless sensor ...
95 篇 sensor networks
93 篇 distributed powe...
92 篇 internet of thin...
87 篇 energy efficienc...
85 篇 monitoring
81 篇 cloud computing
81 篇 distributed comp...
72 篇 computer network...
71 篇 sensors
68 篇 protocols
65 篇 routing
63 篇 security
59 篇 wireless communi...
59 篇 real-time system...
58 篇 computer archite...

机构

12 篇 maharishi school...
12 篇 jiangsu high tec...
12 篇 ieee
10 篇 college of elect...
9 篇 chitkara univers...
9 篇 chitkara univers...
8 篇 karnataka bangal...
8 篇 henan univ inst ...
8 篇 payame noor univ...
8 篇 wuhan univ sch c...
7 篇 beijing univ pos...
7 篇 tu wien distribu...
6 篇 dalian univ tech...
6 篇 college of techn...
6 篇 shanghai jiao to...
6 篇 centre for inter...
6 篇 univ pittsburgh ...
6 篇 indian sch mines...
6 篇 centre for cyber...
6 篇 chinese acad sci...

作者

14 篇 han zhijie
10 篇 dustdar schahram
10 篇 china
10 篇 zhang wei
9 篇 barolli leonard
8 篇 wang lei
8 篇 liu xue
7 篇 liu yang
6 篇 stankovic john a...
6 篇 xhafa fatos
6 篇 zakaria a.
6 篇 lin chi
6 篇 li wei
6 篇 abdelzaher tarek
6 篇 mukherjee nandin...
6 篇 li hui
5 篇 sarigiannidis pa...
5 篇 yang yang
5 篇 shakaff a.y.m.
5 篇 prasad ramjee

语言

4,968 篇 英文
142 篇 其他
7 篇 中文

检索条件"任意字段=3rd IEEE International Conference on Distributed Computing in Sensor Systems"

共 5117 条记录，以下是4421-4430 订阅

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

详细简洁

排序：

Query scoping for the sensor Internet

Query scoping for the sensor Internet

引用

3rd ieee international conference on Pervasive Services (ICPS 2006)

作者： Frank, Christian Roduner, Christof Noda, Chie Kellerer, Wolfgang ETH Dept Comp Sci Zurich Switzerland DoCoMo Commun Lab Europe Future Networking Lab Munich Germany

ISBN: (纸本)1424402379

In a large scale distributed system with a large number of sensors interconnected through a wide-area network infrastructure, it is advantageous not to disseminate a query to all available sensors, but only to a subset of the most-relevant ones. We target an application scenario where mobile phones trace users' objects (which are equipped with small identification tags), distribute useful context information related to these objects, and are able to locate them when lost or misplaced. For locating a lost object, the proposed algorithm - parameterized with a data model of the application domain - is able to explore a wide range of heuristics based on history data present in the system (on objects, users, and their past location), similarly to the way a human user would re-iterate all that she/he knows about a lost object in order to locate it. As the proposed algorithm uses the data present in the system to parameterize its execution, it is generic enough to be applied to other application domains.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Data Rate Adaptive Route Optimization for sink mobility support in wireless sensor networks 3rd

引用

3rd international conference on distributed computing and Internet Technology

作者： In, Jeongsik Kim, Jae-Wan Hwang, Kwang-il Lee, Jihoon Eom, Doo-Seop Korea Univ Sch Elect Engn Sungbuk Ku 1 5 Ka Seoul 136701 South Korea Samsung Adv Inst Technol I Networking Lab Suwon 449712 South Korea

ISBN: (纸本)9783540683797

Mobile sinks pose several challenges for network protocol design. While moving, a sink should continuously update its topological position information in the sensor nodes to maintain paths. This may require large signaling overhead, resulting in excessive energy consumption. Various schemes have been proposed to reduce the path management overhead. In many of these schemes, the sinks only maintain paths from active sources to reduce the overhead. While reducing the path management overhead, this approach introduces other problems. In this paper, Data Rate Adaptive Route Optimization (DRARO) scheme is proposed. DRARO provides a method for adjusting the route optimization level depending on the amount of data traffic, to minimize overall energy consumption. In addition, DRARO provides ceaseless connection for every sensor nodes and its performance is not affected by the number or movement of the. sensing targets.

关键词： sensor networks routing mobility

来源：评论

学校读者我要写书评

暂无评论

Improved dynamic power management in wireless sensor networks

引用

3rd international conference on Ubiquitous Intelligence and computing

作者： Lin, Chuan He, Yanxiang Xiong, Naixue Yang, Laurence T. Wuhan Univ State Key Lab Software Engn Sch Comp Wuhan 430072 Peoples R China Wuhan Univ Sch Math & Stat Wuhan 430072 Peoples R China St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 2W5 Canada

ISBN: (纸本)3540380914

Wireless sensor networks play a key role in monitoring remote or inhospitable physical environments. One of the most important constraints is the energy efficiency problem. Power conservation and power management must be taken into account at all levels of the sensor networks system hierarchy. Especially, DPM (Dynamic Power Management) technology, which shuts down the devices when not needed and wake them up when necessary, has been widely used in sensor networks. In this paper, we modify the sleep state policy developed by Simunic and Chdrakasan in [1] and deduce a new threshold satisfies the sleep-state transition policy. Nodes in deeper sleep states consume lower energy while asleep, but require longer delays and higher latency costs to awaken. Implementing dynamic power management with considering the battery status and probability of event generation will reduce the energy consumption and prolong the whole lifetime of the sensor networks. The sensor network consumed less energy in our simulation than that in [1].

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

A time-cognizant dynamic crash recovery scheme suitable for distributed real-time main memory databases

A time-cognizant dynamic crash recovery scheme suitable for ...

引用

3rd international conference on Autonomic and Trusted computing

作者： Xiao, Yingyuan Liu, Yunsheng Chen, Xiangyang Liu, Xiaofeng Tianjin Univ Technol Dept Comp Sci & Engn Tianjin 300191 Peoples R China Huazhong Univ Sci & Technol Software Coll Wuhan 430074 Peoples R China Wuhan Inst Technol Sch Comp Sci & Engn Wuhan 430073 Peoples R China

ISBN: (纸本)354038619X

Rapid and efficient recovery in the event of site crash is very important for distributed real-time main memory database system. In this paper, the recovery correctness criteria of distributed real-time main memory databases are first given. Then, a time-cognizant dynamic crash recovery scheme (TCDCRS) based on log is presented. TCDCRS uses nonvolatile RAM as logging store and integrates the properties of partitioned logging, ephemeral logging and real-time logging in order to reduce the logging cost as possible during the normal running. During restart recovery after site crashes, a dynamic recovery method based on the classification recovery strategy, which supports concurrent of system services and recovery processing, is adopted to decrease the downtime to the most extent. Experiments and evaluations show that TCDCRS has better performances than traditional recovery schemes in two aspects: the missing deadlines ratio of transactions and the time of system denying services after crashes.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Queueing delay analysis of ieee 802.11e EDCA

Queueing delay analysis of IEEE 802.11e EDCA

引用

3rd international conference on Wireless on Demand Network systems and Services, WONS 2006

作者： Engelstad, Paal E. Østerbø, Olav N. Telenor R and D 1331 Fornebu Norway Universitetsstudiene på Kjeller UniK University Graduate Center Norway

The majority of analytical work on the performance of ieee 802.11 [1] focuses on predicting the throughput and the mean delay of only the medium access, although higher layer applications and protocols are interested in the total performance of the MAC layer. Seen in this perspective, surprisingly little focus has been on predicting the queueing delay. The main contribution of this paper opposed to other works is that it presents the full delay distribution through the z-transform. As a result, the mean medium access delay is found by the first order moment of the transform, and the mean queueing delay by the second order moment. Together this gives the average total delay associated with the MAC layer. The z-transform is derived from an analytical model that works in the whole range from a lightly loaded, non-saturated channel to a heavily congested, saturated medium. The model describes the priority schemes of the Enhanced distributed Channel Access (EDCA) mechanism of the ieee 802.11e standard [2]. EDCA provides class-based differentiated Quality of Service (QoS) to ieee 802.11 WLANs, and distinguishes between four different traffic classes - called Access Categories (AC). By setting the number of ACs to one, and by using an appropriate parameter setting, the results presented are also applicable to the legacy 802.11 distributed Coordination Function (DCF) [1]. The model predictions are calculated numerically and validated against simulation results. A good match between the analytical predictions and simulations was observed.

关键词： ieee Standards

来源：评论

学校读者我要写书评

暂无评论

Decomposing data-centric storage query hot-spots in sensor networks

Decomposing data-centric storage query hot-spots in sensor n...

引用

3rd Annual international conference on Mobile and Ubiquitous System - Networking and Services

作者： Aly, Mohamed Chrysanthis, Panos K. Pruhs, Kirk Univ Pittsburgh Dept Comp Sci Pittsburgh PA 15260 USA

ISBN: (纸本)9781424404988

Arising when a large percentage of queries is accessing data stored in few sensor nodes, query hot-spots reduce the Quality of Data (QoD) and the lifetime of the sensor network. All current In-Network Data-Centric Storage (INDCS) schemes fail to deal with query hot-spots resulting from skewed query loads as well as skewed sensor deployments. In this paper we present two algorithms to locally detect and decompose query hot-spots, namely Zone Partitioning (ZP) and Zone Partial Replication (ZPR). We build both algorithms on top of the DIM scheme, which has been shown to exhibit the best performance among all INDCS schemes. Experimental evaluation illustrates the efficiency of ZP/ZPR in decomposing query hot-spots while increasing QoD as well as energy savings by balancing energy consumption among sensor nodes.

关键词： sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for power-aware scheduling of wireless sensor networks with rate and duty-cycle constraints

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Kannan, Rajgopal Wei, Shuangqing Louisiana State Univ Dept Comp Sci Baton Rouge LA 70803 USA Louisiana State Univ Dept Elect & Comp Engn Baton Rouge LA 70803 USA

ISBN: (纸本)3540352279

We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Since traditional optimization methods using Lagrange multipliers do not work well and are computationally expensive given the non-convex constraints, we develop fully polynomial approximation schemes (FPAS) for finding optimal schedules by considering restricted versions of the problem using multiple discrete power levels. We first show a simple dynamic programming solution that optimally solves the restricted problem. For two fixed transmit power levels (0 and P), we then develop a 2-factor approximation for finding the optimal fixed transmission power level per time slot, P opt, that generates the optimal (minimum) energy schedule. This can then be used to develop a (2, 1 + ε)-FPAS that approximates the optimal power consumption and rate constraints to within factors of 2 and arbitrarily small ε > 0, respectively. Finally, we develop an algorithm for computing the optimal number of discrete power levels per time slot (O(1/ε)), and use this to design a (1, 1 + ε)-FPAS that consumes less energy than the optimal while violating each rate constraint by at most a 1 + ε factor. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Bidirectional data aggregation scheme for wireless sensor networks

引用

3rd international conference on Ubiquitous Intelligence and computing

作者： Cho, Sungrae Georgia So Univ Dept Comp Sci Statesboro GA 30460 USA

ISBN: (纸本)3540380914

In this paper, bidirectional data aggregation (BDA) scheme is proposed for wireless sensor networks. Traditionally, data aggregation bas been performed in backward direction (from source to sink) where each node in the network combines data from its child nodes. BDA algorithm, however, aggregates sensory data in both directions (sink to sources and sources to sink) when the sink is interested in gathering singular aggregates such as MAX and MIN. In forward aggregation (sink to sources), each node tags its sensor reading to the ongoing query only if its local reading is not redundant. Node receiving the tagged query suppresses its response if its local reading is redundant. By doing so, we can limit a number of redundant and unnecessary responses from the sensor nodes, saving energy. Performance evaluation shows that BDA algorithm significantly improves energy-efficiency as well as provides an accurate response for a given singular query in the presence of time-varying sensor readings.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

SIPCache: A distributed SIP location service for mobile ad-hoc networks

SIPCache: A distributed SIP location service for mobile ad-h...

引用

3rd Annual international conference on Mobile and Ubiquitous System - Networking and Services

作者： Leggio, Simone Miranda, Hugo Raatikainen, Kimmo Rodrigues, Luis Univ Helsinki FIN-00014 Helsinki Finland Univ Lisbon P-1699 Lisbon Portugal

ISBN: (纸本)9780780397910

Internet-based communication is currently in a hype. People utilize Internet services more and more to communicate with each other e.g., via VoIP or chat. The next step would be to reutilize the same applications to achieve ubiquitous communication, anytime and anywhere, also where network support is not available, such as in ad-hoe networks. Existing Internet protocols must be modified for working in the ad-hoc server-less environment. The Session Initiation Protocol (SIP) is a fundamental element in the Internet for establishing multimedia communication sessions. However SIP cannot be used in ad-hoc networks, as it relies on the support of SIP servers in the network;e.g, in ad-hoc networks it is not possible to locate SIP users since the assistance of a dedicated SIP server is missing. A solution for this problem is presented in this paper which describes and evaluates a fully decentralized mechanism for locating SIP users in ad-hoc networks.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

MAX: A maximal transmission concurrency MAC for wireless networks with regular structure

MAX: A maximal transmission concurrency MAC for wireless net...

引用

3rd international conference on Broadband Communications Networks and systems

作者： Mangharam, Rahul Rajkumar, Raj Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9781424404247

Multi-hop wireless networks facilitate applications in metropolitan area broadband, home multimedia, surveillance and industrial control networks. Many of these applications require high end-to-end throughput and/or bounded delay. Random access link-layer protocols such as Carrier Sense Multiple Access (CSMA) which are widely used in single-hop networks perform poorly in the multi-hop regime and provide no end-to-end QoS guarantees. The primary causes for their poor performance are uncoordinated interference and unfairness in exclusive access of the shared wireless medium. Furthermore, random access schemes do not leverage spatial reuse effectively and require routes to be linkaware. In this paper, we propose and study MAX, a time-division-multiplexed resource allocation framework for multi-hop networks with regular topologies. MAX tiling delivers optimal end-to-end throughput across arbitrarily large regularly structured networks while providing bounded delay. It outperforms CSMA-based random access protocols by a factor of 5 to 8. The MAX. approach also supports network services including flexible uplink and downlink bandwidth management, deterministic route admission control, and optimal gateway placement. MAX has been implemented on ieee 802.15.3 embedded nodes and a test-bed of 50 nodes has been deployed both indoors and outdoors.

关键词： multi-hop wireless networks sensor networks medium access controller scheduling algorithms topology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 439 440 441 442 443 444 445 446 447 448 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：