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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

130 篇 期刊文献
80 篇 会议
3 篇 学位论文

馆藏范围

213 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

198 篇 工学
- 128 篇 计算机科学与技术...
- 102 篇 信息与通信工程
- 92 篇 电气工程
- 30 篇 仪器科学与技术
- 30 篇 电子科学与技术（可...
- 21 篇 机械工程
- 15 篇 软件工程
- 11 篇 控制科学与工程
- 3 篇 材料科学与工程（可...
- 2 篇 力学（可授工学、理...
- 2 篇 测绘科学与技术
- 2 篇 交通运输工程
- 2 篇 网络空间安全
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 石油与天然气工程
- 1 篇 环境科学与工程（可...
41 篇 理学
- 20 篇 数学
- 11 篇 物理学
- 9 篇 化学
- 7 篇 生物学
- 1 篇 地理学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 14 篇 管理科学与工程(可...
- 2 篇 公共管理
2 篇 经济学
- 2 篇 应用经济学
- 1 篇 理论经济学
1 篇 法学
- 1 篇 政治学
- 1 篇 社会学
1 篇 农学
1 篇 医学

主题

213 篇 barrier coverage
57 篇 wireless sensor ...
23 篇 wireless sensor ...
16 篇 mobile sensors
16 篇 sensor networks
15 篇 sensor deploymen...
12 篇 mobile sensor ne...
10 篇 intrusion detect...
10 篇 network lifetime
8 篇 approximation al...
8 篇 mobile sensor
7 篇 algorithms
7 篇 border surveilla...
7 篇 camera sensor ne...
7 篇 sensor network
6 篇 voronoi diagram
6 篇 computational ge...
6 篇 wireless sensor ...
6 篇 coverage
6 篇 directional sens...

机构

8 篇 chuzhou univ sch...
8 篇 ohio state univ ...
6 篇 univ new s wales...
6 篇 tamkang univ dep...
4 篇 northwestern pol...
4 篇 renmin univ chin...
4 篇 carleton univ sc...
4 篇 utah state univ ...
4 篇 anhui univ sch c...
4 篇 beijing jiaotong...
4 篇 city univ hong k...
4 篇 bar ilan univ fa...
4 篇 zhejiang univ st...
3 篇 n carolina cent ...
3 篇 carleton univ sc...
3 篇 duy tan univ fac...
3 篇 caritas inst hig...
3 篇 wesleyan univ de...
3 篇 st francis xavie...
2 篇 univ sci & techn...

作者

8 篇 chang chih-yung
7 篇 guo longkun
7 篇 lai ten h.
6 篇 narayanan lata
6 篇 opatrny jaroslav
6 篇 cheng teddy m.
6 篇 savkin andrey v.
5 篇 kim donghyun
5 篇 cheng chien-fu
5 篇 li deying
5 篇 wang haitao
5 篇 kranakis evangel...
5 篇 deng xianjun
4 篇 bar-noy amotz
4 篇 eftekhari mohsen
4 篇 wang bang
4 篇 zhao shenghui
4 篇 tokuta alade o.
4 篇 yang laurence t.
4 篇 tri gia nguyen

语言

209 篇 英文
4 篇 其他

检索条件"主题词=barrier coverage"

共 213 条记录，以下是71-80 订阅

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

详细简洁

排序：

Maximizing Surveillance Quality for barrier coverage in Rechargeable Sensor Networks 31

Maximizing Surveillance Quality for Barrier Coverage in Rech...

引用

31st IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Dong, Zaixiu Wen, Weimin Chen, Guilin Zhao, Shenghui Chang, Chih-Yung Chuzhou Univ Chuzhou Anhui Peoples R China Tamkang Univ New Taipei Taiwan

ISBN: (纸本)9781509060290

barrier coverage has received much attention in the last decade and has been an import issue in wireless sensor networks. In the previous study, a number of researchers have presented algorithms for coping with the barrier coverage problem. However, these studies consider that sensors are equipped with batteries and the sensing model applies Boolean Sensing Model (BSM). The sensor using battery as its energy source can lead to the battery change problem which is difficult and inconvenient. Unlike previous studies, this work aims to resolve the barrier coverage problem but considers solar-powered sensors and applies the Probabilistic Sensing Model (PSM). A barrier coverage mechanism, called MSQ (Maximizing surveillance quality algorithm), is proposed aiming to maximize boundary surveillance quality. Performance experiments show that the proposed MSQ mechanism outperforms existing studies in terms of surveillance quality.

关键词： barrier coverage wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

On Minimizing the Sum of Sensor Movements for barrier coverage of a Line Segment

On Minimizing the Sum of Sensor Movements for Barrier Covera...

引用

9th International Conference on Ad-Hoc Networks and Wireless

作者： Czyzowicz, Jurek Kranakis, Evangelos Krizanc, Danny Lambadaris, Ioannis Narayanan, Lata Opatrny, Jaroslav Stacho, Ladislav Urrutia, Jorge Yazdani, Mohammadreza Univ Quebec Outaouais Dept Informat Gatineau PQ J8X 3X7 Canada Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Wesleyan Univ Dept Math & Comp Sci Middletown CT 06459 USA Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada Concordia Univ Dept Comp Sci Montreal PQ H3G 1M8 Canada Simon Fraser Univ Dept Math Burnaby BC V5A 1S6 Canada Univ Nacl Autonoma Mexico Math Inst Coyoac 04510 DF Mexico Ciudad Univ Invest Cient Coyoacan 04510 DF Mexico

ISBN: (纸本)9783642147845

A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensors in arbitrary initial positions on the line (not necessarily inside I) and the sensing ranges of the sensors, we are interested in finding final positions of sensors which establish a barrier coverage of I so that the sum of the distances traveled by all sensors from initial to final positions is minimized. It is shown that the problem is NP complete even to approximate up to constant factor when the sensors may have different sensing ranges. When the sensors have an identical sensing range we give several efficient algorithms to calculate the final destinations so that the sensors either establish a barrier coverage or maximize the coverage of the segment if complete coverage is not feasible while at the same time the sum of the distances traveled by all sensors is minimized. Some open problems are also mentioned.

关键词： Mobile Sensor barrier coverage Line segment Efficient Algorithm NP-complete Movement Optimization

来源：评论

学校读者我要写书评

暂无评论

Maximizing the Lifetime of Sliding Wireless Sensors in barrier coverage

Maximizing the Lifetime of Sliding Wireless Sensors in Barri...

引用

International Conference on Mechatronics and Applied Mechanics (ICMAM 2011)

作者： Yang, Tao Fan, PanGuo Mu, DeJun Northwestern Polytech Univ Sch Automat Xian 710072 Shaanxi Peoples R China

ISBN: (纸本)9783037853801

Wireless sensor network is always deployed in specific area for intrusion detection and environmental monitoring. The sensor nodes suffer mostly from their limited battery capacity. Maximizing the lifetime of the entire networks is mainly necessary considered in the design. Sliding the sensors in different barriers under the optimal barrier construction is a good solution for both maximizing network lifetime and providing predetermined coverage ratio. The simulation results demonstrate that the scheme can effectively reduce the energy consumption of the wireless sensor network and increase the network lifetime.

关键词： wireless sensor network barrier coverage energy consumption

来源：评论

学校读者我要写书评

暂无评论

Scheduling Rechargeable UAVs for Long Time barrier coverage 26

Scheduling Rechargeable UAVs for Long Time Barrier Coverage

引用

26th IEEE International Conference on Parallel and Distributed Systems (IEEE ICPADS)

作者： Han, Zhouqing Zhu, Xiaojun Xu, Lijie Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing Peoples R China Collaborat Innovat Ctr Novel Software Technol & I Nanjing Peoples R China

ISBN: (纸本)9781728190747

We consider barrier coverage applications where a set of UAVs are deployed to monitor whether intruders pass through a line, i.e., the barrier. Due to limited energy supply of UAVs, a charging pile is used to recharge UAVs. The problem is to place UAVs on top of the barrier and schedule them to the charging pile such that the barrier is seamlessly covered and the total number of UAVs is minimized We decompose the problem into subproblems by dividing the barrier into disjoint subsegments and covering each subsegment independently. We prove a theoretical lower bound on the minimum number of UAVs required to cover the barrier forever. We then propose two scheduling strategies. In the first strategy, only fully recharged backup UAVs will be scheduled to take over UAVs running out of energy. If there are enough UAVs, this strategy can cover the barrier forever. The second strategy is proposed to deal with the situation that the number of UAVs is insufficient. Under the strategy, if no backup UAV is fully recharged, the one with the most battery energy will be selected to take over the monitoring task. When the number of UAVs is insufficient, the barrier can still be covered for a long time. We analytically derive the number of UAVs required by the first strategy, and the monitoring duration of the second strategy in case of insufficient UAVs. Simulations verify the effectiveness of the proposed solutions.

关键词： rechargeable UAVs barrier coverage scheduling monitoring energy limitation

来源：评论

学校读者我要写书评

暂无评论

Optimization of Full-View barrier coverage with Rotatable Camera Sensors 37

Optimization of Full-View Barrier Coverage with Rotatable Ca...

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Gao, Xiaofeng Yang, Rui Wu, Fan Chen, Guihai Zhou, Jinguang Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China Univ Illinois Urbana IL 61801 USA

ISBN: (纸本)9781538617915

In all the researches in wireless sensor networks, cameras are increasingly utilized for their surveillance capabilities. In this paper, we elaborately discuss about the problem of Full-View barrier coverage with Rotatable Camera Sensors (FBR), including weakly and strongly connected versions. FBR is proven to be NP-hard in this paper by reducing Group Steiner Tree problem to it. Our goal is to reduce sensor number when guaranteeing the surveillance capabilities at the same time. Correspondingly, we introduce a novel weighed graph structure called Full-View barrier Graph. We transform weak version problem into a pseudo one-dimension one and propose W-GraProj algorithm with the help of dynamic programming;in strong version problem, we introduce two centralized algorithms (S-Dijkstra, S-Thorup), respectively aiming to save sensor number and to reduce time complexity. Moreover, we rigorously analyze the correctness and time complexity for each algorithm. In addition, the mass number of experiments are conducted to validate the efficiency of all algorithms, which prove that our structures and algorithms can construct a full-view barrier with fewer camera sensors compared with previous researches.

关键词： full-view coverage barrier coverage visual network rotatable camera sensors

来源：评论

学校读者我要写书评

暂无评论

Poster: Quadratic-Time Algorithms for Optimal Min-Max barrier coverage with Mobile Sensors on the Plane 41

Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrie...

引用

41st IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Yao, Pei Guo, Longkun Yu, Jiguo Fuzhou Univ Ctr Discrete Math Fuzhou Peoples R China Qilu Univ Technol Sch Comp Sci & Tech Jinan Peoples R China

ISBN: (纸本)9781665445139

Emerging applications impose the min-max line barrier coverage (LBC) problem that aims to minimize the maximum movement of the sensors for the sake of balancing energy consumption. In the paper, we devise an algorithm for LBC that finds an optimal solution within a runtime O (n(2)), improving the previous state-of-art runtime O (n(2) log n) due to [7]. The key idea to accelerating the computation of the optimum solutions is to use approximation solutions that are obtained by our devised approximation algorithm. Numerical experiments demonstrate our algorithms outperform all the other baselines including the previous state-of-art algorithm.

关键词： Fast algorithm barrier coverage optimal solution mobile sensor approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

BSQ: barrier coverage Mechanism for Guaranteeing Surveillance Quality in Wireless Sensor Networks 31

BSQ: Barrier Coverage Mechanism for Guaranteeing Surveillanc...

引用

31st IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Shao, Xuemei Chen, Guilin Zhao, Shenghui Liu, Jinjun Chang, Chih-Yung Chuzhou Univ Chuzhou Anhui Peoples R China Tamkang Univ New Taipei Taiwan

ISBN: (纸本)9781509062317

barrier coverage is known as one of the most important applications in wireless sensor networks. Most existing studies adopted the Boolean Sensing Model (BSM) which assumes that sensor can detect the object falling in the sensing range of that sensor. Another sensing model, called Elfes Sensing Model (ESM), which assumes that the probability of sensing is a probabilistic value depending on the distance between sensor and object. The ESM model is more practical than BSM model since it considers the interference and other environmental conditions. This paper considers the ESM and proposes a distributed mechanism, called BSQ ( pbarrier coverage for guaranteeing Surveillance Quality), for constructing a barrier coverage. The proposed BSQ aims to maximize the weakest sensing quality of barrier boundary while satisfying the minimum numbers of sensors. Experimental study reveals that the proposed BSQ outperforms existing related schemes in terms of surveillance quality and hardware cost.

关键词： Wireless sensor networks barrier coverage Elfes Sensing Model surveillance quality

来源：评论

学校读者我要写书评

暂无评论

Distributed barrier coverage with Relocatable Sensors

引用

21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Eftekhari, Mohsen Flocchini, Paola Narayanan, Lata Opatrny, Jaroslav Santoro, Nicola Concordia Univ Dept Comp Sci & Soft Engn Montreal PQ Canada Univ Ottawa Sch El Eng & Comp Sci Ottawa ON Canada Carleton Univ Sch Comp Sci Ottawa ON Canada

ISBN: (纸本)9783319096209;9783319096193

A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. barrier coverage is achieved by a set of sensors if every point on the barrier is covered by some sensor in the set. Assuming n identical, anonymous, and relocatable sensors are placed initially at arbitrary positions on a line segment barrier, we are interested in the following question: under what circumstances can they independently make decisions and movements in order to reach final positions whereby they collectively cover the barrier? We assume each sensor repeatedly executes Look-Compute-Move cycles: it looks to find the positions of sensors in its visibility range, it computes its next position, and then moves to the calculated position. We consider only oblivious or memoryless sensors with sensing range r and visibility range 2r and assume that sensors can move at most distance r along the barrier in a move. Under these assumptions, it was shown recently that if the sensors are fully synchronized, then there exists an algorithm for barrier coverage even if sensors are unoriented, that is, they do not distinguish between left and right [7]. In this paper, we prove that orientation is critical to being able to solve the problem if we relax the assumption of tight synchronization. We show that if sensors are unoriented, then barrier coverage is unsolvable even in the semi-synchronous setting. In contrast, if sensors agree on a global orientation, then we give an algorithm for barrier coverage, even in the completely asynchronous setting. Finally, we extend the result of [4] and show that convergence to barrier coverage by unoriented sensors in the semi-synchronous model is possible with bounded visibility range 2r + rho (for arbitrarily small rho > 0) and bounded mobility range r.

关键词： sensor networks barrier coverage distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved Fast Algorithms for Optimal Min-Max Line barrier coverage with Mobile Sensors on the Plane 21

Improved Fast Algorithms for Optimal Min-Max Line Barrier Co...

引用

24th International Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems

作者： Yao, Pei Guo, Longkun Li, Peng Lin, Jiawei Fuzhou Univ Fuzhou Peoples R China Google Incorp Kirkland WA USA

ISBN: (纸本)9781450390774

Emerging applications raise the min-max line barrier coverage (LBC) problem that aims to minimize the maximum movement of the sensors for the sake of balancing energy consumption. In this paper, we devise an exact algorithm to optimally solve LBC within a runtime of O(n(2)), comparing favorably to the previous state-of-art runtime O(n(2) log n), where n is the number of sensors. To achieve the improvement, we accelerate the computation of optimum solutions by using a novel approximation algorithm. Numerical experiments demonstrated that our algorithms outperform all the other baselines, including the previous state-of-art algorithm.

关键词： Fast algorithm barrier coverage optimal solution mobile sensor approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Achieving full-view barrier coverage with mobile camera sensors

Achieving full-view barrier coverage with mobile camera sens...

引用

International Conference on Networking and Network Applications (NaNA)

作者： Liu, Xiaolan Yang, Bin Zhao, Shenghui Fan, Yuanyuan Chuzhou Univ Sch Comp & Informat Engn Chuzhou 239000 Peoples R China Chuzhou Univ Sch Math & Finance Chuzhou 239000 Peoples R China

ISBN: (纸本)9781467398039

barrier coverage is a critical issue in wireless sensor networks for many practical applications, e.g., national border monitoring, security surveillance and intruder detection, etc. Its aim is to detect intruders that attempt to cross the protected region. Available works mainly focused on the barrier coverage of static directional sensors (e.g., cameras), which leads to a waste of redundant camera sensors with limited coverage area and sensing angles. In this paper, we study how to achieve full-view barrier coverage with mobile camera sensors. We first deploy mobile camera sensors to form full-view barrier coverage in a random environment. Then we propose a novel full-view barrier covered model to select mobile camera sensors. Finally, we analyze and optimize the number of camera sensors required for this specific model. Extensive simulation results are provided to illustrate that our proposed solution outperforms others in terms of minimum number of camera sensors.

关键词： Camera Sensors barrier coverage Full-view coverage Mobile Sensors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：