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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
41 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

4,129 篇 工学
- 3,182 篇 计算机科学与技术...
- 1,609 篇 电气工程
- 1,553 篇 信息与通信工程
- 1,282 篇 软件工程
- 555 篇 控制科学与工程
- 344 篇 动力工程及工程热...
- 264 篇 仪器科学与技术
- 249 篇 电子科学与技术（可...
- 201 篇 机械工程
- 112 篇 测绘科学与技术
- 111 篇 安全科学与工程
- 106 篇 网络空间安全
- 103 篇 石油与天然气工程
- 93 篇 交通运输工程
- 77 篇 生物工程
- 76 篇 环境科学与工程（可...
- 76 篇 生物医学工程（可授...
- 71 篇 材料科学与工程（可...
- 65 篇 化学工程与技术
829 篇 理学
- 443 篇 数学
- 204 篇 物理学
- 124 篇 化学
- 123 篇 统计学（可授理学、...
- 102 篇 系统科学
- 98 篇 生物学
572 篇 管理学
- 440 篇 管理科学与工程(可...
- 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 ...
98 篇 sensor networks
93 篇 distributed powe...
92 篇 internet of thin...
85 篇 monitoring
82 篇 cloud computing
82 篇 distributed comp...
81 篇 energy efficienc...
74 篇 sensors
72 篇 computer network...
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,747 篇 英文
359 篇 其他
9 篇 中文

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

共 5113 条记录，以下是4391-4400 订阅

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

详细简洁

排序：

An energy efficient and accurate slot synchronization scheme for wireless sensor networks

An energy efficient and accurate slot synchronization scheme...

引用

3rd international conference on Broadband Communications Networks and systems

作者： Dai, Lillian Basu, Prithwish Redi, Jason BBN Technol 10 Moulton St Cambridge MA 02138 USA

ISBN: (纸本)9781424404247

Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot misalignment over time and can result in catastrophic data loss in such systems. We propose a simple network-wide slot synchronization scheme (Slot-Sync and Slot-Resync) suitable for duty-cycling wireless sensor networks. The proposed scheme attains high accuracy by circumventing dominant sources of error inherent in traditional time synchronization protocols. At moderate duty-cycle frequencies, the proposed scheme also has the unique advantage of eliminating re-synchronization (re-sync) overhead completely, thereby achieving slot re-sync essentially for free. We provide an energy efficient slot guard time and resync interval design for the proposed scheme and analyze several spanning tree structures for slot-alignment message propagation. In addition, we derive upper bounds on the synchronization (sync) error for a family of trees. Through simulations, we compare the spanning trees we propose to those used for time sync in literature and show up to 80% reduction in sync error and up to 70% reduction in energy needed for slot-alignment message propagation by choosing appropriate tree structures.

关键词： Clock drift Guard time Slot synchronization Spanning tree Synchronization error Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Scalable and low-cost acoustic source localization for wireless sensor networks

引用

3rd international conference on Ubiquitous Intelligence and computing, UIC 2006

作者： You, NgBin Cha, HoJung Department of Computer Science Yonsei University Shinchon-dong 134 Seodaemum-gu oul 120-749 Korea Republic of

ISBN: (纸本)3540380914

Typical applications of wireless sensor networks require scalability because they are deployed in a large area. Conventional centralized systems for acoustic source localization experience practical difficulties since they focus on high accuracy in a small area rather than scalability in a large region. In this paper, we present a scalable and light-weight acoustic source localization system suitable for use with resource constrained hardware. The distributed mechanism has low complexity and an error-tolerant algorithm for construction of a feasible system in a real environment. The proposed system has been implemented and validated by experiments in a real environment. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Lifetime maximization of sensor networks under connectivity and k-coverage constraints

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Mo, Wei Qiao, Daji Wang, Zhengdao Iowa State Univ Ames IA 50011 USA

ISBN: (纸本)3540352279

In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network with n sensors deployed independently and uniformly in a square field of unit area. Each sensor is active with probability p, independently from others, and each active sensor can sense a disc area with radius rs. Moreover, considering the inherent irregularity of a sensor's sensing range caused by time-varying environments, we model the sensing radius rs as a random variable with mean r0 and variance r0²σs². Two active sensors can communicate with each other if and only if the distance between them is smaller than or equal to the communication radius rc. The key contributions of this paper are: (1) we introduce a new definition of a wireless sensor network's lifetime from a novel probabilistic perspective, called ω-lifetime (0 < ω < 1). It is defined as the expectation of the time interval during which the probability of guaranteeing connectivity and k-coverage simultaneously is at least ω;and (2) based on the analysis results, we propose a near-optimal scheduling algorithm, called PIS (Pre-planned Independent Sleeping), to achieve the network's maximum ω-lifetime, which is validated by simulation results, and present a possible implementation of the PIS scheme in the distributed manner. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

TPOD: A trust-based incentive mechanism for peer-to-peer live broadcasting

TPOD: A trust-based incentive mechanism for peer-to-peer liv...

引用

3rd international conference on Autonomic and Trusted computing

作者： Tang, Yun Sun, Lifeng Luo, Jianguang Yang, Shiqiang Zhong, Yuzhuo Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)354038619X

The prevalence of emerging peer-to-peer (P2P) live broadcasting applications has practically demonstrated that they could scale to reliably support a large population of end users. However, these systems potentially suffer from two major threats: peers generally interact with unfamiliar partners without the benefit of trusted third party or verification authority, resulting in poor service if meeting with unreliable upstream nodes, while peers essentially tend to be selfish when it comes to the duty rather than the benefits and hence undermine the system performance. The trust and cooperation issues motivate us to investigate the design of trust-based incentive mechanism which establishes trustful relationship among peers and balances what they take from the system with what they contribute. The proposed TPOD mechanism leverages the statistical analysis to the practical service logs of client-server and P2P systems and effectively offers incentive through service differentiation. It goes beyond existing approaches in the following four desirable properties: (1)Trust-based;(2)Practical-oriented;(3)Objective metrics about past behaviors and (4)distributed nature upon gossip-based overlay. The experiment results over PlanetLab verify its effectiveness.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed minimal time convergecast scheduling in wireless sensor networks

Distributed minimal time convergecast scheduling in wireless...

引用

26th ieee Internationa26th ieee international conference on distributed computing systems, ICDCS 2006

作者： Gandham, Shashidhar Zhang, Ying Huang, Qingfeng Department of Computer Science University of Texas Dallas Inc.

ISBN: (纸本)0769525407

We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm referred to as convergecast. We are interested in determining a TDMA schedule that minimizes the total time required to complete the convergecast. We consider a simple version of the problem wherein every node generates exactly one packet. We propose a distributed convergecast scheduling algorithm that requires at most 3N timeslots, where N represents the number of nodes in the network. Through extensive simulations, we demonstrate that actual number of timeslots needed is around 1.5N. In addition to time efficiency, we prove that our convergecast scheduling algorithm requires the nodes to buffer no more than two packets at any instance. We propose a sleep schedule that conserves more than 50% of the energy. We present simulation results for a real application scenario to show that our convergecast scheduling algorithm performs significantly better than existing convergecast algorithms. © 2006 ieee.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A distortion-aware scheduling approach for wireless sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Liaskovitis, Periklis Schurgers, Curt Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

ISBN: (纸本)3540352279

An important class of applications for wireless sensor networks is to use the sensors to provide samples of a physical phenomenon at discrete locations. Through interpolation-based reconstruction, a continuous map of the monitored environment can be built. In this paper, we leverage the spatial correlation characteristics of the physical phenomenon and find the minimum set of nodes that needs to be active at each point in time for a sufficiently accurate reconstruction. Furthermore, multiple such sets of nodes are found so that a different set can report at each point in time in a rotating fashion. This is crucial in improving network lifetime. To perform all related scheduling tasks we employ a novel approach which does not assume a-priori knowledge of the underlying phenomenon. Instead it jointly estimates process characteristics and performs node selection online. We illustrate that significant gains in network lifetime can be achieved with minimal impact on the overall reconstruction quality, measured in terms of distortion. © Springer-Verlag Berlin Heidelberg 2006.

关键词： spatial random process irregular sampling distortion lifetime energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Prototyping a prefetching scheme for location-dependent systems

Prototyping a prefetching scheme for location-dependent syst...

引用

ieee international conference on sensor Networks, Ubiquitous, and Trustworthy computing

作者： Zerioh, Karim Laurini, Robert Minist Natl Educ Dept Higher Educ & Sci Res Div Comp Sci 3 BisRue Innaoun Rabat Morocco Inst Natl Sci Appl LIRIS Lab F-69621 Villeurbanne France

ISBN: (纸本)0769525539

Advances in wireless networks, mobile devices and location tracking mechanisms are making location-aware applications more and more popular. While several prefetching schemes were proposed for mobile systems, very few ones exist for location-dependent applications. And at the best of our knowledge, there is no work describing implementation details of a prefetching scheme for location-dependent systems. In this paper, after a brief survey of information hoarding and prefetching mechanisms, we deduce some requirements for a successful prefetching scheme for location-aware applications, we show that the prefetching policy we previously proposed satisfies these requirements, and we describe a prototype implementing this policy. We describe the system architecture and detailed algorithms describing the tasks executed in the client and the server. We also discuss some additional steps that can be useful for saving energy consumption in the mobile device. An adequate data structure allows the server to have continuously an up to date image of the client's cache content.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Capacity requirements for the one-to-one backup option in MPLS fast reroute

Capacity requirements for the one-to-one backup option in MP...

引用

3rd international conference on Broadband Communications Networks and systems

作者： Martin, Ruediger Menth, Michael Canbolat, Korhan Univ Wurzburg Inst Comp Sci Dept Distributed Syst D-97070 Wurzburg Germany

ISBN: (纸本)9781424404247

MPLS fast reroute (MPLS-FRR) mechanisms deviate the traffic in case of network failures at the router closest to the outage location to achieve an extremely fast reaction time. We review the one-to-one backup and the facility backup that are options for MPLS-FRR to deviate the traffic via a detour or a bypass around the failed elements, respectively. Basically, the backup paths can take the shortest path that avoids the outage location from the point of local repair to the tail-end router or to the merge point with the primary path. We suggest two simple modifications that lead to a new path layout which can be implemented by one-to-one and by facility backup. We evaluate the backup capacity requirements, the length of the backup paths, and the number of backup paths per primary path in a parametric study regarding the network characteristics. Our proposals save a considerable amount of backup capacity compared to the standard mechanisms. They are suitable for application in practice since they are simple and conform to the standards.

关键词： protection and restoration MPLS fast reroute capacity planning

来源：评论

学校读者我要写书评

暂无评论

An optimal data propagation algorithm for maximizing the lifespan of sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Jarry, Aubin Leone, Pierre Powell, Olivier Rolim, Jose Univ Geneva Dept Informat CH-1211 Geneva 4 Switzerland

ISBN: (纸本)3540352279

We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing the energy among individual sensors and maximizing the message flow in the network are equivalent. We propose a distributed and adaptive data propagation algorithm for balancing the energy among sensors in the network. The mixed routing algorithm we propose allows each sensor node to either send a message to one of its immediate neighbors, or to send it directly to the base station, the decision being based on a potential function depending on its remaining energy. By considering a simple model of the network and using a linear programming description of the message flow, we prove the strong result that an energy-balanced mixed strategy beats every other possible routing strategy in terms of lifespan maximization. Moreover, we provide sufficient conditions for ensuring the dynamic stability of the algorithm. The algorithm is inspired by the gradient-based routing scheme but by allowing to send messages directly to the base station we improve considerably the lifespan of the network. As a matter of fact, we show experimentally that our algorithm is close to optimal and that it even beats the best centralized multi-hop routing strategy. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

A congestion control technique for the near-sink nodes in wireless sensor networks

引用

3rd international conference on Ubiquitous Intelligence and computing

作者： Moon, SungHyun Lee, SungMin Cha, HoJung Yonsei Univ Dept Comp Sci Seoul 120749 South Korea

ISBN: (纸本)3540380914

Without congestion control techniques specifically designed for sensor network applications, the system may not function properly due to data transmission failure. Moreover, most many-to-one communication schemes adopted by sensor network applications cause a practical congestion problem called the funneling effect. With this problem, the hottest area is confined to the connection between the sink and its neighbors. In order to solve the bottleneck problem, we propose a congestion-control technique which uses adaptive time-slot scheduling and a service-differentiated technique. The simulation results show that the proposed method outperforms the conventional technique.

关键词： Congestion control (communication)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 436 437 438 439 440 441 442 443 444 445 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：