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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Optimisation problems based on the maximal breach path measure for wireless sensor network coverage 1

引用

3rd international conference on distributed computing and Internet Technology, ICDCIT 2006

作者： Gupta, Anirvan Dutta Bishnu, Arijit Sengupta, Indranil Department of Computer Science and Engineering Indian Institute of Technology Kharagpur721302 India

ISBN: (数字)9783540683803

ISBN: (纸本)9783540683797

Coverage is a central issue in the design of wireless sensor networks. There are many measures for coverage, based on what aspect of surveillance quality we wish to address. Designing a network that achieves desired standards in terms of the measure chosen is a nontrivial problem. In this paper we take the Maximal Breach Path measure and formulate the sensor-network design problem as a geometric optimization problem. We present improved polynomial time algorithms for computing the aforesaid measure for a given sensor network. Also, as a first step toward solving the optimisation problem posed in this paper, we present a geometric transformation on a given configuration of sensors that brings the maximal breach to a "local optimal"-in the sense that the resulting breach is the best we can get keeping the topology of the starting configuration intact. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed job scheduling based on multiple constraints anycast routing

Distributed job scheduling based on multiple constraints any...

引用

3rd international conference on Broadband Communications Networks and systems

作者： Stevens, Tim De Leenheer, Marc De Turck, Filip Dhoedt, Bart Demeester, Piet Univ Ghent IMEC IBBT Dept Informat Technol Gaston Crommenlaan 8 Bus 201 B-9050 Ghent Belgium

ISBN: (纸本)9781424404247

As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resources located in the access- or core network, sounds very promising. In a consumer-oriented environment, characterized by a large diversity in connected devices, a transparent network-based request processing strategy offers a clear flexibility advantage, as the installation and configuration of extra software components on all client devices can be avoided. In this work, this is achieved by linking computational resources to an anycast group, which allows intermediate router nodes to decide upon the target server. It is shown in the paper that the anycast routing problem can be reduced to unicast routing. Consequently, unicast multiple constraints routing algorithms can be applied to compute an optimal path based on several server selection criteria, including server load, path delay, path cost, etc. For this purpose, we envision the SAMCRA algorithm. A new evaluation ordering strategy for previously computed sub-paths is introduced, which guarantees optimality for the complete SAMCRA path between source and destination. Simulation results show that an effective distribution of the job scheduling requests over the available resources can be achieved by applying the described algorithm.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A privacy preserving mining algorithm on distributed dataset

引用

3rd international conference on Fuzzy systems and Knowledge Discovery

作者： Shen Hui-zhang Zhao Ji-di Yang Zhong-zhi Shanghai Jiao Tong Univ Aetna Sch Management Shanghai 200052 Peoples R China

ISBN: (纸本)3540459162

The issue of maintaining privacy in data mining has attracted considerable attention over the last few years. The difficulty lies in the fact that the two metrics for evaluating privacy preserving data mining methods: privacy and accuracy are typically contradictory in nature. This paper addresses privacy preserving mining of association rules on distributed dataset. We present an algorithm, based on a probabilistic approach of distorting transactions in the dataset, which can provide high privacy of individual information and at the same time acquire a high level of accuracy in the mining result. Finally, we present experiment results that validate the algorithm.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

An energy efficient 3-dimensional wireless sensor cover

An energy efficient 3-dimensional wireless sensor cover

引用

Consumer Communications and Networking conference, CCNC ieee

作者： M.K. Watfa S. Commuri Department of Electrical and Computer Engineering University of Oklahama USA

来源：评论

学校读者我要写书评

暂无评论

GIST: Group-independent spanning tree for data aggregation in dense sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Jia, Lujun Noubir, Guevara Rajaraman, Rajmohan Sundaram, Ravi Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA

ISBN: (纸本)3540352279

Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions of optimal, i.e. under different cost metrics). However, all these schemes differ from one common failing - they construct an optimal tree for a given fixed subset of the sensors. In most practical scenarios, the sensor group is continuously and dynamically varying - consider for example the set of sensors scattered in a forest that are sensing temperatures above some specified threshold, during a wildfire. Given the limited computational and energy resources of sensor nodes it is impossible to either prestore the optimal tree for every conceivable group or to dynamically generate them on the fly. In this paper we propose the novel approach of constructing a single group-independent spanning tree (GIST) T for the network and then letting any sensor group S use the subtree induced by S on T, T_S as its group aggregation tree. The important question is, how does the quality of the subtree T_S compare to the optimal tree, OPTs, across different groups S. We consider two well-accepted measures - aggregation cost (sum over all links) and delay (diameter). We show that in polynomial time we can construct a GIST that simultaneously achieves O(log n)-approximate aggregation cost and O(1)-approximate delay, for all groups S. To the best of our knowledge GIST is the first construction with a nontrivial and provable performance guarantee that works for all groups. We provide a practical and distributed protocol for realizing GIST that requires only local knowledge. We show an Ω(n) lower bound for commonly accepted solutions such as MST and SPT (i.e. there exists a group for which the induced subtree performs poorly) and demonstrate by simulation that GIST is good not just in the worst case - it outperforms SPT and MST by between 30 and 60 per cent in realistic random scenarios. GIST is an ov

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Utilizing secure three hop links to agree pairwise keys in wireless sensor networks

引用

3rd international conference on Ubiquitous Intelligence and computing

作者： Wang, Gicheol Park, Dongsun Chonbuk Natl Univ CAIIT Jeonju 561756 South Korea Chonbu Natl Univ Div Elect & Informat Engn Jeonbuk 561756 South Korea

ISBN: (纸本)3540380914

Because sensor networks consist of devices with weak physical security, they are likely to be compromised by an attacker. So, it is very important to establish a pairwise key securely between the communicating nodes. However, utilizing one hop local keys are known to be very vulnerable to threats caused by compromised nodes. This paper proposes a scheme where each node establishes three hop local keys at network boot-up time and employs them for a later pairwise key establishment. When any two nodes agree a pairwise key, all nodes on the route between two nodes contribute to the agreement of the pairwise key. Here, the initial three hop local keys are employed for encrypting a secret key delivered from a node to other nodes. Therefore, the proposed scheme bothers attackers to compromise much more nodes than the scheme using one hop local keys only. The simulation results showed that the proposed scheme provides better performance and higher security than the one hop local key based scheme.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Bottleneck around base station in wireless sensor network and its solution

Bottleneck around base station in wireless sensor network an...

引用

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

作者： Padmanabh, Kumar Roy, Rajarshi Indian Inst Technol Kharagpur 721302 West Bengal India

ISBN: (纸本)9781424404988

The sensor nodes in a network are connected to the outer world via a base station. Base stations (BS) have some back up power and it is not suppose to fail due to shortage of battery power. The nodes which are away from the base station communicate to it via the nodes which are in proximity of BS. So, the nodes which are nearer to BS have additional communication responsibilities of forwarding data of distant nodes. Thus the nodes which are in proximity of BS will run out of battery power very soon and create bottleneck for communication. In this paper we have proposed that if the density of sensor nodes increases as we move towards base station this effect can be minimized. We found the required exact density of the sensor nodes at a particular distance from BS to avoid bottleneck phenomenon around it. We have considered the real life scenario where the nodes generate data only when there is an event of interest with a given probability of occurrence. The main contribution of this paper with our proposed strategy is lifetime offered per unit cost of deployment is almost double.

关键词： wireless sensor network network lifetime maximum lifetime routing

来源：评论

学校读者我要写书评

暂无评论

A group based reputation system for P2P networks

A group based reputation system for P2P networks

引用

3rd international conference on Autonomic and Trusted computing

作者： Tian, Huirong Zou, Shihong Wang, Wendong Cheng, Shiduan Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100088 Peoples R China

ISBN: (纸本)354038619X

In large scale P2P networks, it is less likely that repeat interactions will occur between same peers for the asymmetric interests between them. So it is difficult to establish the direct trust relationship between peers and the network is vulnerable to malicious peers. A group based reputation system GroupRep for P2P networks is proposed in this paper to solve this problem. In GroupRep, the trust relationship is classified into three tiers: the trust relationship between groups, between groups and peers, and between peers. A peer evaluates the credibility of a given peer by its local trust information or the reference from the group it belonging to. A filtering cluster algorithm is proposed to filter unfair ratings provided by malicious peers. As a result, good peers are distinguished from malicious ones. Choosing the download source based on the trust value of responders can make good peers happy with the high ratio of the success query and the high satisfaction level under malicious collusive attacks with front peers.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Application-centric networking framework for wireless sensor nodes

Application-centric networking framework for wireless sensor...

引用

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

作者： Choi, Sukwon Cha, Hojung Yonsei Univ Dept Comp Sci Seoul 120749 South Korea

ISBN: (纸本)9781424404988

Wireless sensor network technology has found diverse applications in numerous fields. As the networking technology is refined in many ways, the need for system modulation with effective performance becomes essential. A multitude of architectures, which includes system abstraction and layering, has been proposed to solve the need at the operating system level. However, previous efforts do not qualify for networking architecture required by sensor networking, since they are aimed at hardware abstraction or protocol-based layering. In this paper, we classify developers into kernel, network and application developers and propose a network architecture that enables those developers to program independently. Network stack is separated into three different layers;MLL, NSL, DNL. This three-layered architecture provides an effective programming environment to sensor network developers by minimizing modification of other layers and maximizing reusability of the networking module. To validate the proposed mechanism, we implemented and assessed the performance with a few network algorithms and applications, based on the RETOS, which supports a dynamic loadable kernel module.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：