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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,130 篇 会议
36 篇 期刊文献
4 册 图书

馆藏范围

3,170 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,909 篇 工学
- 1,672 篇 计算机科学与技术...
- 744 篇 信息与通信工程
- 711 篇 电气工程
- 502 篇 软件工程
- 254 篇 测绘科学与技术
- 227 篇 控制科学与工程
- 223 篇 机械工程
- 143 篇 动力工程及工程热...
- 90 篇 仪器科学与技术
- 59 篇 电子科学与技术（可...
- 51 篇 网络空间安全
- 48 篇 安全科学与工程
- 46 篇 交通运输工程
- 28 篇 生物工程
- 27 篇 土木工程
- 22 篇 建筑学
- 13 篇 化学工程与技术
272 篇 理学
- 148 篇 数学
- 53 篇 化学
- 41 篇 系统科学
- 35 篇 统计学（可授理学、...
- 32 篇 生物学
- 26 篇 物理学
221 篇 管理学
- 175 篇 管理科学与工程(可...
- 88 篇 图书情报与档案管...
- 57 篇 工商管理
28 篇 医学
- 20 篇 临床医学
- 11 篇 公共卫生与预防医...
25 篇 法学
- 22 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
10 篇 军事学
9 篇 文学
7 篇 农学
2 篇 教育学
1 篇 艺术学

主题

984 篇 wireless sensor ...
267 篇 sensor systems
223 篇 distributed comp...
182 篇 sensors
165 篇 wireless communi...
156 篇 protocols
149 篇 monitoring
113 篇 sensor networks
110 篇 routing
109 篇 computer network...
103 篇 sensor phenomena...
99 篇 internet of thin...
99 篇 robot sensing sy...
97 篇 energy consumpti...
96 篇 mobile communica...
89 篇 sensor nodes
86 篇 mobile computing
84 篇 energy efficienc...
80 篇 intelligent sens...
77 篇 computer archite...

机构

9 篇 nanjing univ sta...
9 篇 suny stony brook...
8 篇 department of co...
8 篇 school of comput...
7 篇 department of co...
7 篇 state key labora...
7 篇 department of co...
7 篇 hong kong univ s...
6 篇 dalian univ tech...
6 篇 department of el...
6 篇 department of co...
6 篇 missouri univ sc...
6 篇 michigan state u...
6 篇 key lab ubiquito...
6 篇 univ virginia de...
6 篇 univ illinois de...
6 篇 institute of com...
5 篇 college of compu...
5 篇 georgia state un...
5 篇 distributed syst...

作者

17 篇 dharma p. agrawa...
16 篇 sotiris nikolets...
13 篇 agrawal dharma p...
12 篇 abdelzaher tarek
11 篇 bar-noy amotz
11 篇 sarigiannidis pa...
11 篇 voigt thiemo
11 篇 nikoletseas soti...
11 篇 liu yunhao
10 篇 stankovic john a...
10 篇 wu jie
9 篇 panagiotis sarig...
9 篇 lars wolf
9 篇 rothermel kurt
9 篇 jiannong cao
8 篇 thomas lagkas
8 篇 vassiliou vasos
8 篇 lagkas thomas
8 篇 dai haipeng
8 篇 ulf kulau

语言

3,156 篇 英文
10 篇 中文
5 篇 其他

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

共 3170 条记录，以下是2741-2750 订阅

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

详细简洁

排序：

A practical method to form energy efficient connected K-coverage in wireless sensor networks

A practical method to form energy efficient connected K-cove...

引用

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

作者： Jiang, Zhen Kline, Robert Wu, Jie Dai, Fei Dept. of Computer Sci. Information Assurance Center West Chester University West Chester PA 19383 United States Dept. of Computer Sci. and Eng. Florida Atlantic University Boca Raton FL 33431 United States Dept. of Elec. and Computer Eng. North Dakota State University Fargo ND 58105 United States

ISBN: (纸本)0769525415

In the wireless sensor networks, an important issue of area coverage is to know how many sensor nodes are needed in a deployment under a certain kind of distribution. In that way, the nodes can be dense enough to form a complete and connected cover of interest area. Another issue that needs to be addressed is the "redundancy of connectivity" caused by the use of the well known sufficient condition that "the communication range R is at least twice the sensing range r". In this paper, we show our result in solving these problems, a practical method to form a connected k-coverage with a connected dominating set (CDS). By introducing a measure of node density called the biggest vacant square territory (BVST), we prove that the point coverage offered by a CDS implies area coverage of the area of interest. The 1-point-coverage of a CDS with a reduced R and a certain number of deploying sensors guarantees k-area-coverage, or simply k-coverage. Such assurance is verified via a simulation study on the CDS in [7] under random node distribution. © 2006 ieee.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

SenCar: An energy efficient data gathering mechanism for large scale multihop sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Ma, Ming Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)3540352279

In this paper, we propose a new data gathering mechanism for large scale multihop sensor networks. A mobile data observer, called SenCar, which could be a mobile robot or a vehicle equipped with a powerful transceiver and battery, works like a mobile base station in the network. SenCar starts the data gathering tour periodically from the static data processing center, traverses the entire sensor network, gathers the data from sensors while moving, returns to the starting point, and finally uploads data to the data processing center. Unlike SenCar, sensors in the network are static, and can be made very simple and inexpensive. They upload sensing data to SenCar when SenCar moves close to them. Since sensors can only communicate with others within a very limited range, packets from some sensors may need multihop relays to reach SenCar. We first show that the moving path of SenCar can greatly affect the network lifetime. We then present heuristic algorithms for planning the moving path/circle of SenCar and balancing traffic load in the network. We show that by driving SenCar along a better path and balancing the traffic load from sensors to SenCar, the network lifetime can be prolonged significantly. Our simulation results demonstrate that the proposed data gathering mechanism can greatly prolong the network lifetime compared to a network which has only a static observer, or a network in which mobile observer can only move along straight lines. © Springer-Verlag Berlin Heidelberg 2006.

关键词： SenCar wireless sensor networks data gathering load balancing

来源：评论

学校读者我要写书评

暂无评论

REDRP: Reactive energy decisive routing protocol for wireless sensor networks

引用

3rd international conference on Ubiquitous Intelligence and computing

作者： Wang, Ying-Hong Lin, Yi-Chien Fu, Ping-Fang Tsai, Chih-Hsiao TamKang Univ Dept Comp Sci & Informat Engn Taipei Taiwan

ISBN: (纸本)3540380914

The wireless sensor network (WSNs) was extensively deployed and researched for many applications in recently. By taking the advantage of smaller dimension, lower cost and simple structure of the sensor node, the more restrictions come together with sensors. Therefore, the limited power of sensor nodes is the most direct and difficult problem we meet. The limitation on the energy of sensor node makes the bottlenecks for designing the suitable routing protocols. In order to solve the problem of limited energy, the loading of nodes have to be distributed as possible as it can. If the energy consumption can be shared averagely by most nodes, then the lifetime of sensor networks will be enlarged. Thus we propose the routing protocol called Reactive Energy Decision Routing Protocol (REDRP) for sensor networking by considering several representative routing protocols in different structures. This protocol will create the routes in reactive routing method to transmit the data node gathered and the REDRP use the residual energy of nodes as the routing decision for energy-aware. As the results of simulation shows that the more fairness usage of sensor nodes, the total energy consumption of entire network will be distributed fairly by our protocol and the lifetime will also be increased.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Distance-sensitive information brokerage in sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Funke, Stefan Guibas, Leonidas J. Nguyen, An Wang, Yusu Stanford Univ Dept Comp Sci Stanford CA 94305 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)3540352279

In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms of interactions between nodes that are producers of information, e.g., those that have collected data, detected events, etc., and nodes that are consumers of information, i.e., nodes that seek data or events of certain types. Our overall goal in this paper is to construct efficient schemes allowing consumer and producer nodes to discover each other so that the desired information can be delivered quickly to those who seek it. Here, efficiency means both limiting the redundancy of where producer information is stored, as well as bounding the consumer query times. We introduce the notion of distance-sensitive information brokerage and provide schemes for efficiently bringing together information producers and consumers at a cost proportional to the separation between them - even though neither the consumers nor the producers know about each other beforehand. Our brokerage scheme is generic and can be implemented on top of several hierarchical routing schemes that have been proposed in the past, provided that they are augmented with certain key sideway links. For such augmented hierarchical routing schemes we provide a rigorous theoretical performance analysis, which further allows us to prove worst case query times and storage requirements for our information brokerage scheme. Experimental results demonstrate that the practical performance of the proposed approaches far exceeds their theoretical (worstcase) bounds. The presented algorithms rely purely on the topology of the communication graph of the sensor network and do not require any geographic location information. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Wireless Algoritnms, systems, and Applications-First international conference, WASA 2006, Proceedings

Wireless Algoritnms, Systems, and Applications-First Interna...

引用

First international conference on Wireless Algorithms, systems, and Applications, WASA 2006

ISBN: (纸本)3540371893

The proceedings contain 65 papers. The topics discussed include: a priority management scheme for high rate wireless personal area network;a generic software partitioning algorithm for pervasive computing;a new methodology of QoS evaluation and service selection for ubiquitous computing;energy aware multimedia messaging services across networks and across devices for mobile users;a memory efficient algorithm for packet classification;path selection of reliable data delivery in wireless sensor networks;an efficient and robust routing protocol for data aggregation;a density control algorithm for surveillance sensor networks;upper bound on operational lifetime of ultra wide band sensor network;a genetic algorithm on multi-sensor networks lifetime optimization;dependency-based dynamic component reconfiguration for wireless computing systems;and accusation resolution using security metrology.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

W-Grid: a cross-layer infrastructure for multi-dimensional indexing, querying and routing. in wireless ad-hoc and sensor networks 6

W-Grid: a cross-layer infrastructure for multi-dimensional i...

引用

6th international conference on Peer-to-Peer computing (P2P 2006)

作者： Moro, Gianluca Monti, Gabriele Univ Bologna Dept Elect Comp Sci & Syst Viale Venezia 52 I-47023 Cesena Italy

ISBN: (纸本)0769526799

Large scale wireless ad-hoc networks of computers, sensors, PDAs etc. (i.e. nodes) are revolutionizing connectivity and leading to a paradigm shift from centralized systems to highly distributed and dynamic environments. A plethora of routing algorithms have been proposed for the network path discovery ranging from broadcasting/flooding-based approaches to those using global positioning systems (GPS). In this paper we propose a novel decentralized infrastructure that self-organizes wireless devices in an ad-hoc network, where each node has one or more virtual coordinates through which both message routing and data management occur without reliance on either flooding/broadcasting operations or GPS. The resulting ad-hoc network does not suffer from the dead-end problem, which happens in geographic-based routing when a node is unable to locate a neighbor closer to the destination than itself. The multi-dimensional data management capability will be described showing, as an example, how the location service reduces to a simple query, like for any other data type. Extensive performance analysis and experiments have been conducted and the results compared to GPSR, which is considered the most efficient routing solution not using broadcast operations. Our approach shows significant performance gains.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Peer-to-peer collaborative signal processing for target tracking in wireless sensor networks

Peer-to-peer collaborative signal processing for target trac...

引用

5th international conference on Grid and Cooperative computing, GCC 2006

作者： Xue, Wang Sheng, Wang State Key Laboratory of Precision Measurement Technology and Instruments Department of Precision Instruments Tsinghua University Beijing 100084 China

ISBN: (纸本)0769526942

A distributed dynamic collaboration approach built in peer-to-peer (P2P) architecture is presented to acquire, transmit and process information in wireless sensor networks (WSNs). Several practically feasible measures of energy consumption and information utility was introduced in collaborative signal processing (CSP) for nodes selection. Then we introduce a target tracking method and present a simple but robust algorithm to integrate the results from multiple nodes. Furthermore, we introduce a progressive fusion tracking strategy based on P2P collaborative signal processing (P2P-CSP) mechanism. Finally, we illustrate an indoor tracking experiment, as well as compare the energy consumption and time delay of P2P-CSP and client/server mechanism. Experimental results verify that the proposed algorithm is a scalable, progressive, energy-efficient and robust way for target tracking. © 2006 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

ACM international conference Proceeding Series - Proceedings of the 3rd international conference on Quality of Service in Heterogeneous Wired/Wireless Networks

ACM International Conference Proceeding Series - Proceedings...

引用

3rd international conference on Quality of Service in Heterogeneous Wired/Wireless Networks

ISBN: (纸本)1595935371

The proceedings contain 57 paper. The topics discussed include: saturated throughput analysis of ieee 802.11e using two-dimensional Markov chain model;localized coverage boundary detection for wireless sensor networks;algorithm design for base station placement problems in sensor networks;distributed cooperative rate adaptation for energy efficiency in ieee 802.11-based multi-hop networks;multi-constrained soft-QoS provisioning in wireless sensor networks;clustering and load balancing in hybrid sensor networks with mobile cluster heads;a link performance model for multi-user wireless fading channels;an optimization framework for balancing throughput and fairness in wireless networks with QoS support;energy-balancing multipath routing protocol for wireless sensor networks;cluster-based routing protocol for mobile sensor networks;and stability-based multi-objective clustering in mobile ad hoc networks.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Mac address assignment in wireless sensor networks: A mixed strategy game approach

Mac address assignment in wireless sensor networks: A mixed ...

引用

2nd international conference on systems and Networks Communications, ICSNC 2006

作者： Kun, Tu Kun, Bi Naijie, Gu Wanli, Dong Xiaohu, Liu Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0769526993

In this paper, we address the problem of MAC address assignment in wireless sensor networks. A novel scheme for MAC address assignment is proposed to reduce the overhead. We model the problem from the game theoretical view, prove there exists a mixed strategy Nash equilibrium in the model, and propose a distributed address assign algorithm to achieve the equilibrium, which takes the advantage of the exploitation of spatial address reuse to save energy. Simulation results demonstrate that our algorithm is efficient even for very large-scale networks, which makes it a potential candidate for practical applications. © ieee.

关键词： Medium access control

来源：评论

学校读者我要写书评

暂无评论

Topological hole detection in sensor networks with cooperative neighbors

Topological hole detection in sensor networks with cooperati...

引用

2nd international conference on systems and Networks Communications, ICSNC 2006

作者： Kun, Bi Kun, Tu Naijie, Gu Wanli, Dong Xiaohu, Liu Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0769526993

In a wireless sensor network, the regions in which a large percentage of sensor nodes are not available may form holes in the network. In holes, sensor nodes may be depleted or not dense enough to communicate with others. So those holes may degrade some applications' performances in sensor networks. In this paper, we study the problem of detecting topological holes in sensor networks with no localization information in any node. We present a distributed cooperative scheme which is only based on the communication topology graph. To identify holes, each node only needs to exchange information with its 1-hop and 2-hop neighbors. With the cooperation of its 2-hop neighbors, each node could independently decide whether it is on the boundary of a hole. Experimental results demonstrate that our algorithm could indeed capture the characteristics of those boundary nodes and describe those holes in sensor networks of moderate node densities. © ieee.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共317页 << < 271 272 273 274 275 276 277 278 279 280 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：