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

Optimal Deployment of Sensors along Freeway Corridors for Traffic Accident Detection

JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS 2023年第6期149卷

作者： Cao, Qian Bai, Qiaowen Li, Zhihui Li, Haitao Ma, Yongjian Jilin Univ Sch Transportat Changchun 130022 Peoples R China

Sensor deployment is important to the detection performance of traffic accidents on freeways. However, the temporally and spatially varying effects of accident risks are seldom considered in sensor deployment, which can induce a decrease in accident detection accuracy and detection timeliness. To address this problem, this paper proposes an optimal deployment method of sensors according to the temporal-spatial effect of accidents on traffic flow. Considering the uncertainty of traffic accidents, the temporal-spatial distribution of accident risk is estimated according to historical accident data. Then the kinematic wave model and Van Aerder model are introduced to analyze the temporal-spatial effect of accidents on traffic flow. To obtain the optimal locations of sensors, the sensor deployment problem is converted into a coverage problem on accident risk in time and space, and an optimal deployment model of sensors is built by considering the temporal-spatial effect of accident risk, the coverage rate on accident risk, the detection timeliness of the accident, and deployment cost. The particle swarm optimization algorithm is introduced to solve it. A case study is carried out to validate the proposed method using consistency, sensitivity, reliability, and comparison experiments. The results show that the proposed method is effective and reliable under different traffic volumes, and it outperforms the uniform spacing method in traffic accident detection.

关键词： Sensor deployment Traffic accident detection Temporal-spatial effect of accidents Freeway corridor coverage problem

来源：评论

学校读者我要写书评

暂无评论

Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical application to genomic and metagenomic projects

引用

BMC BIOINFORMATICS 2007年第1期8卷 70-70页

作者： Moriarty, John Marchesi, Julian R. Metcalfe, Anthony Natl Univ Ireland Univ Coll Cork Dept Math Boole Ctr Res Informat Cork Ireland Natl Univ Ireland Univ Coll Cork Aliementary Pharmabiot Ctr Cork Ireland Natl Univ Ireland Univ Coll Cork Dept Microbiol Cork Ireland

Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is of particular interest. Approximate distributions for the number of gaps have been given in the literature, one motivation being ease of computation. Error bounds for these approximate distributions have not been given. Results: We give bounds on the probability distribution of the number of gaps when a circle is covered by fragments of fixed size. The absolute error in the approximation is typically on the order of 0.1% at 10x coverage depth. The method can be applied to coverage problems on the interval, including edge effects, and applications are given to metagenomic libraries and shotgun sequencing.

关键词： Bacterial Artificial Chromosome coverage problem Bacterial Artificial Chromosome Library Related Bias coverage Depth

来源：评论

学校读者我要写书评

暂无评论

On Connected Multiple Point coverage in Wireless Sensor Networks

引用

INTERNATIONAL JOURNAL OF WIRELESS INFORMATION NETWORKS 2006年第4期13卷 289-301页

作者： Yang, Shuhui Dai, Fei Cardei, Mihaela Wu, Jie Patterson, Floyd Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA North Dakota State Univ Dept Elect & Comp Engn Fargo ND 58105 USA Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA North Dakota State Univ Elect & Comp Engn Fargo ND 58105 USA

We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a sensor. In some applications, when the network is sufficiently dense, area coverage can be approximated by guaranteeing point coverage. In this case, all the points of wireless devices could be used to represent the whole area, and the working sensors are supposed to cover all the sensors. Many applications related to security and reliability require guaranteed k-coverage of the area at all times. In this paper, we formalize the k-(Connected) coverage Set (k-CCS/k-CS) problems, develop a linear programming algorithm, and design two non-global solutions for them. Some theoretical analysis is also provided followed by simulation results.

关键词： coverage problem linear programming localized algorithms reliability wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Wireless Indoor Localization Using Passive RFID Tags

引用

Procedia Computer Science 2019年 155卷 210-217页

作者： Alseny Diallo Zaixin Lu Xinghui Zhao School of Engineering and Computer Science Washington State University Vancouver WA USA Amazon Inc. Seattle WA USA

Location-based services (LBSs) have recently become a vital part of life. Global Navigation Satellite Systems, e.g., GPS, have been used in a wide range of applications. These systems face a common challenge: their performance can be significantly affected by the presence of obstacles. For instance, when the target object is close to walls, buildings, trees, or located in indoor environments, GPS based services may not work correctly. However, in reality, the presence of obstacles is inevitable in many critical scenarios, such as disaster response and rescue. To address this challenge, we propose an indoor localization system which uses radio frequency identification (RFID) tags to localize moving targets. Our indoor localization algorithm derives the accurate location of a target object using a set of RFID tags. For tag deployment, we have developed a greedy algorithm that uses a novel score function guide the deployment, aiming to guarantee maximum coverage using a limited number of tags. The experimental results show our approach is effective in localizing target objects with high accuracy.

关键词： Indoor Localization RFID tags Wireless Technologies Radio Frequency coverage problem

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks

引用

SENSORS 2017年第2期17卷 413页

作者： Rashed, Sarmad Soyturk, Mujdat Marmara Univ Dept Comp Engn Fac Engn TR-34722 Istanbul Turkey

Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area (e.g., the regions that are hardly accessed by human beings). In such kinds of networks, data collection becomes one of the major issues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage-especially Unmanned Aerial Vehicles (UAVs)-is the most convenient approach to covering the area and accessing each sensor node in such a large-scale WSN. However, the operation of the UAV depends on some parameters, such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various UAV mobility patterns that follow different paths to sweep the operation area in order to seek the best area coverage with the maximum number of covered nodes in the least amount of time needed by the mobile sink. We also introduce a new metric to formulate the tradeoff between maximizing the covered nodes and minimizing the operation time when choosing the appropriate mobility pattern. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time to choose the appropriate mobility pattern.

关键词： unmanned aerial vehicle (UAV) cluster head mobility pattern coverage problem utilization quality of service

来源：评论

学校读者我要写书评

暂无评论

PROBABILISTIC MODELING AND ANALYSIS OF DNA FRAGMENTATION

引用

JOURNAL OF BIOLOGICAL SYSTEMS 2019年第2期27卷 281-307页

作者： Pourmohammadi, Reza Abouei, Jamshid Anpalacan, Alacan Yazd Univ Dept Elect Engn WINEL Res Lab Yazd Iran Ryerson Univ Dept Elect Comp & Biomed Engn Toronto ON Canada

Deoxyribonucleic Acid (DNA) sequencing has become indispensable to the modern biological and medicine sciences. DNA fragmentation is a preliminary step in a dominant technique called shotgun sequencing that provides a time and cost effective strategy for the DNA sequencing. In this paper, we propose a probabilistic model for the random DNA fragmentation and derive an average number of fragments with the suitable length along with the probability of covering the entire DNA strand through the de novo assembly or the referenced-based mapping assembly. We formulate the coverage problem in terms of the probability of bond breaking between nucleotides and the number of DNA molecules participating in the fragmentation process, and provide insights into the optimal DNA fragmentation. We obtain the lower bound for the minimum number of suitable fragments required to reconstruct the DNA strand with the specified reliability. We evaluate the derived results with our DNA Fragmentation Tool which demonstrate, the validity of these results based on our model. Finally, we update our model with respect to the fragments' size distribution of real data.

关键词： Random DNA Fragmentation Shotgun Sequencing coverage problem coverage Probability

来源：评论

学校读者我要写书评

暂无评论

An improved neighborhood-restricted association rule-based recommender system 13

An improved neighborhood-restricted association rule-based r...

引用

Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137

作者： R. Uday Kiran Masaru Kitsuregawa The University of Tokyo Meguro-ku Tokyo Japan

ISBN: (纸本)9781921770227

Association rule mining is an actively studied topic in recommender systems. A major limitation of an association rule-based recommender system is the problem of reduced coverage. It is generally caused due to the usage of a single global minimum support (minsup) threshold in the mining process, which leads to the effect that no association rules involving rare items can be found. To confront the problem, researchers have introduced Neighborhood-Restricted rule-based Recommender System (NRRS) using the concept of multiple minsups. We have observed that NRRS is computationally expensive to use and can recommend uninteresting products to the users. With this motivation, this paper proposes an improved NRRS using the relative support measure. We call the proposed system as NRRS++. Experimental results show that NRRS++ can provide better recommendations and is runtime efficient than NRRS.

关键词： coverage problem association rules recommender systems

来源：评论

学校读者我要写书评

暂无评论

Connected Area coverage Sets in Wireless Sensor Networks

Connected Area Coverage Sets in Wireless Sensor Networks

引用

第三届IEEE无线通讯、网络技术暨移动计算国际会议

作者： David Q. Liu Indiana University - Purdue University Fort Wayne Fort Wayne IN 46805USA

Wireless Sensor Networks consist of small senor nodes with limited battery and processing capability. During any time, a number of senor nodes must be kept active to sense the covered area and maintain the connectivity to the base station. This paper addresses the minimum connected area coverage set problem with equal sensing and communicating radii. With location information of its neighbor, each node selects minimum number of its neighbor nodes as sensing and forwarding nodes to cover the sensing area of itself and all its neighbors and guarantee the connectivity to all its two-hop neighbors. After exchanging the sensing and forwarding node set with its neighbors, each node decides whether it should be active. The active sensor nodes together guarantee area coverage and connectivity. The proposed algorithm is fully localized with O(nlogn ) time complexity and O(n) message complexity where n is the maximum number of neighbors.

关键词： coverage problem connectivity wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive and distributed sensor activation in WSN

Adaptive and distributed sensor activation in WSN

引用

International Conference on Wireless Communications and Signal Processing

作者： Mengyi Zhang Alban Goupil Maxime Colas Guillaume Gelle CReSTIC University of Reims Champagne-Ardenne

ISBN: (纸本)9781467376884

The selection of active units is an essential task for sensor networks because it allows to increase the service life of the networks while guaranteeing coverage. In this paper, we propose a fully distributed method for active units selection that automatically adapts to sensors extinction without activating unnecessary idle units. This method relies on both of the use of homology and the discrete Morse theory.

关键词： coverage problem Sensor's activation Homology groups Distributed algorithm Discrete vector field

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor Networks: Target-Barrier coverage with Static and Mobile Sensors 23

Wireless Sensor Networks: Target-Barrier Coverage with Stati...

引用

Proceedings of the 2023 12th International Conference on Networks, Communication and Computing

作者： Chien-Fu Cheng Bo-Ming Chen National Taiwan Ocean University Taiwan Tamkang University Taiwan

ISBN: (纸本)9798400709265

This paper investigates the issue of target-barrier coverage in wireless sensor networks that utilize both static and mobile sensors, resulting in enhanced fault tolerance and reliability. The main objective is to establish a reliable and dependable protective barrier around the target and detect any intrusion within its perimeter. The introduction of distance limits, namely boundlow and boundup, can ensure that the constructed barrier provides sufficient response time to report detected intrusions. This methodology is particularly well-suited for applications that demand high levels of dependability and fault tolerance, such as battlefield monitoring and intruder detection. Furthermore, by introducing mobile sensors in conjunction with static sensors, it will help increase the success rate of target-barrier construction and reduce the number of required scattered static sensors. Experimental simulations validate the proposed method and illustrate that it offers superior network lifetime compared to alternative approaches, while maintaining high levels of fault tolerance and reliability.

关键词： Target-barrier coverage coverage problem fault tolerance reliability wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：