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

A fast two-objective differential evolution for the two-objective coverage problem of WSNs

MEMETIC COMPUTING 2019年第1期11卷 89-107页

作者： Xu, Yulong Ye, Yangdong Zhang, Han Zhang, Wenbing Lv, Yali Zhengzhou Univ Sch Informat Engn Zhengzhou 450052 Peoples R China Henan Univ Tradit Chinese Med Sch Informat & Technol Zhengzhou 450046 Henan Peoples R China Peking Univ Coll Engn Intelligent Control Lab Beijing 100871 Peoples R China Yangzhou Univ Dept Math Yangzhou 225002 Jiangsu Peoples R China

The aim of this article is to study the two-objective coverage problem of wireless sensor networks (WSNs) by means of differential evolution algorithm. Firstly, in order to reduce the computing redundancy of multi-objective optimization, namely to reduce the number of individuals which participate in non-dominated solution sorting, we introduced a fast two-objective differential evolution algorithm (FTODE). The FTODE contains a fast non-dominated solution sorted and a uniform crowding distance calculation method. The fast sorting method just handles the highest rank individuals but not all individuals in the current population. Meanwhile, during the individuals sorted, it can choose some of individuals into next generation and reduce the time complexity. The uniform crowding distance calculation can enhance the diversity of population due to it will retain the outline of optimal solution set by choosing the individual uniformly. Secondly, we use the FTODE framework to research the two-objective coverage problem of WSNs. The two objectives are formulated as: the minimum number of sensor used and the maximum coverage rate. For this specific problem, decimal integer encoding are used and a recombination operation is introduced into FTODE, which performs after initialization and guarantees at least one critical target's sensor is divided into different disjoint sets. Finally, the simulation experiment shows that the FTODE provides competitive results in terms of time complexity and performance, and it also obtains better solutions than comparison algorithms on the two-objective coverage problem of WSNs.

关键词： Differential evolution (DE) Two-objective Non-dominated solution sorted Wireless sensor networks (WSNs) coverage problem

来源：评论

学校读者我要写书评

暂无评论

On the coverage problem in Device-to-Device Relay Networks

引用

IEEE COMMUNICATIONS LETTERS 2019年第11期23卷 2139-2143页

作者： Qu, Wanyue Li, Geng Zhao, Yuping Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China Yale Univ Dept Comp Sci POB 2158 New Haven CT 06520 USA

The device-to-device (D2D) relay technology is one of the key technologies in 5G networks, and its coverage problem is important as it determines key properties in network management. However, the traditional relay coverage theories (e.g., based on the received signal-to-interference-plus-noise ratio) are not optimal for D2D relay due to the dynamicity in backhaul resources of D2D relays. In this letter, we study the coverage problem in D2D relay networks with theoretical derivation and experimental simulation using stochastic geometry. In particular, we formulate the coverage problem to maximize the overall system downlink rate, and then the domain optimization problem is transformed into a 0-1 integer programming problem. We propose a novel algorithm to obtain the optimal solution by greedily including the best locations into the coverage. Simulation results verify the theoretical solution and show that the optimal coverage is surprisingly in an irregular shape that excludes the D2D relay. The results also obtain the best relay location and show the performance gain than the existing scheme.

关键词： Device-to-device communication Downlink Relay networks (telecommunications) Bandwidth Optimization Signal to noise ratio Device-to-device (D2D) relay coverage problem stochastic geometry

来源：评论

学校读者我要写书评

暂无评论

An Improved Artificial Plant Optimization Algorithm for coverage problem in WSN

引用

SENSOR LETTERS 2012年第8期10卷 1874-1878页

作者： Li, Jun Cui, Zhihua Sh, Zhongzhi Taiyuan Univ Sci & Technol Complex Syst & Computat Intelligence Lab Taiyuan 030024 Shanxi Peoples R China Chinese Acad Sci Inst Comp Technol Key Lab Intelligent Informat Proc Beijing 100190 Peoples R China

Artificial plant optimization algorithm (APOA) is a new evolutionary computation inspired by plant growing process. In APOA, three operators are designed including photosynthesis operator, phototropism operator and apical dominance operator, in which phototropism operator plays an important role for the branch growing direction, therefore, in this paper, a new phototropism operator is designed aiming to increase the search efficiency. To testify the performance, our proposed variant is used to solve coverage optimization problem which is one crucial problem in wireless sensor networks. Simulation results show our modification achieves better node distribution than other two algorithms.

关键词： APOA Apical Dominance Operator Photosynthesis Operator Phototropism Operator coverage problem

来源：评论

学校读者我要写书评

暂无评论

A Copula-Based Estimation of Distribution Algorithms for coverage problem of Wireless Sensor Network

引用

SENSOR LETTERS 2012年第8期10卷 1892-1896页

作者： Wang, Xiaoping Gao, Huimin Zeng, Jianchao Lanzhou Univ Technol Coll Elect & Informat Engn Lanzhou 730050 Peoples R China Jiaxing Univ Sch Business Jiaxing 314001 Peoples R China Jiaxing Univ Mech & Elect Engn Coll Jiaxing 314001 Peoples R China

One fundamental issue in wireless sensor network is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, a new copula-based estimation of distribution algorithms (EDAs), Scopula-EDAs, is introduced to solve this problem. Although applying copula theory to EDAs is a rising and promising research issue, how to choose the right copula becomes a hurdle to the research of copula-based EDAs. In order to solve the copula selection problem, an innovative and general method, called switched copula method is introduced, which can ignore how to determine a fixed copula beforehand, and evolve the copula selection process dynamically by organizing different kinds of copulas through a copula selection pool. The proposed algorithm is easy to implement and provides a balance between accuracy and efficiency of the copula selection, in the meantime it can be applied to the coverage problem conveniently. The experiment results validate the feasibility and efficiency of our algorithm.

关键词： EDAs Copula Selection coverage problem Wireless Sensor Network Optimization

来源：评论

学校读者我要写书评

暂无评论

The coverage problem in a wireless sensor network

引用

MOBILE NETWORKS & APPLICATIONS 2005年第4期10卷 519-528页

作者： Huang, CF Tseng, YC Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan

One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a given parameter. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k=1 is assumed. Applications of the result include determining insufficiently covered areas in a sensor network, enhancing fault-tolerant capability in hostile regions, and conserving energies of redundant sensors in a randomly deployed network. Our solutions can be easily translated to distributed protocols to solve the coverage problem.

关键词： ad hoc network computer geometry coverage problem ubiquitous computing wireless network sensor network

来源：评论

学校读者我要写书评

暂无评论

Improved differential evolution to solve the two-objective coverage problem of wireless sensor networks 28

Improved differential evolution to solve the two-objective c...

引用

第28届中国控制与决策会议

作者： XU Yulong Wang Xiaohui Zhang Han Institute of Information and Technology Henan University of Traditional Chinese Medicine Intelligent Control Laboratory College of EngineeringPeking University The 76315 Troops of PLA

ISBN: (纸本)9781467397155

Differential evolution(DE) is one of the most powerful stochastic real parameter optimizers of current *** this article,we aim to study the multi-objective differential evolution and use the improved algorithm to solve a two-objective coverage problem of wireless sensor networks(WSNs).It is found that there are some redundant operations in the classic multi-objective evolution based on the Pareto ***,we introduce a sorting method which only handles the highest rank individual in current *** introduced method sorts the individuals meanwhile chooses some of them into next *** the next generation is achieved,the method will finish the evolution of the current *** incorporate the proposed method into differential evolution to solve the two-objective coverage problem of *** provide the optimization model of this two-objective coverage problem and offer the encoding style of *** result shows that the improved algorithm has better performance than the classic multi-objective algorithms.

关键词： Differential Evolution(DE) multi-objective non-dominated solution sorted wireless sensor networks(WSNs) coverage problem

来源：评论

学校读者我要写书评

暂无评论

The coverage problem in a wireless sensor network

The coverage problem in a wireless sensor network

引用

2nd International Workshop on Wireless Sensor Networks and Application (WSNA 2003)

作者： Huang, CF Tseng, YC Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan

关键词： ad hoc network computer geometry coverage problem ubiquitous computing wireless network sensor network

来源：评论

学校读者我要写书评

暂无评论

Research on Optimal coverage problem of Wireless Sensor Networks

Research on Optimal Coverage Problem of Wireless Sensor Netw...

引用

WRI International Conference on Communications and Mobile Computing

作者： Wang, Xueqing Sun, Fayi Kong, Xiangsong China Univ Min & Technol Beijing Sch Mech & Civil Engn China Beijing 100083 Peoples R China Weifang Univ Sci & Technol Shandong Peoples R China

ISBN: (纸本)9780769535012

In a wireless sensor network, the size of radio nodes has direct relation to the cost of total wireless sensor networks, and at the same time, the problem is closely connected to wireless sensor networks' performance, such as robust, fault-tolerance, and further more, it is considered at first as wireless sensor networks are designed. Therefore, the research on the size of radio nodes has significant meanings of theory and practice to design of wireless sensor networks. The paper simplifies complex coverage problem step by step. By means of math modeling, theoretical analysis and formula deducting, classical geometric theories and the method of mathematics induction are adopted, at last, the analysis formula of minimum number of nodes is theoretically educed under circumstances of entire and seamless coverage in WSN. In addition, it is worth mentioning that the conclusion is the full same with computing the number of communication nodes of wireless sensor networks.

关键词： Wireless sensor networks coverage problem sensor field sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Research on Efficient coverage problem of Node in Wireless Sensor Networks

Research on Efficient Coverage Problem of Node in Wireless S...

引用

International Conference on Industrial Mechatronics and Automation

作者： Wang Xue-qing Zhang Shu-qin China Univ Min & Technol Beijing Sch Mech & Civil Engn Beijing 100083 Peoples R China Zhongyuan Univ Technol Sch Comp Sci Zhengzhou 450007 Peoples R China

ISBN: (纸本)9781424438181

efficient coverage area and efficient coverage area ratio of node are put forward by analysis of coverage problem of wireless sensor networks (WSN). It is theoretically proved through math modeling, theoretical analysis and formula deducting that how much the maximum efficient coverage area, the maximum efficient coverage area ratio, the maximum of net efficient coverage area and the maximum of net efficient coverage area ratio of node is if full seamless coverage is met in wireless sensor networks. At last, the analysis formula is given that minimum number of radio nodes is demanded in a given sensor field if the field is covered fully and seamlessly. The formula resolves a math problem of wireless sensor networks in theory. The research on the size of nodes has significant meanings of theory research and networks designing of wireless sensor networks.

关键词： wireless sensor networks (WSN) coverage problem seamless coverage efficient coverage area efficient coverage area ratio

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor Network coverage problem Using Modified Fireworks Algorithm 12

Wireless Sensor Network Coverage Problem Using Modified Fire...

引用

12th International Wireless Communications & Mobile Computing Conference (IWCMC)

作者： Tuba, Eva Tuba, Milan Simian, Dana Univ Belgrade Fac Math Belgrade Serbia John Naisbitt Univ Fac Comp Sci Belgrade Serbia Lucian Blaga Univ Fac Sci Sibiu Romania

ISBN: (纸本)9781509003044

Wireless sensor networks are emerging technology with increasing number of applications, and consequently an active research area. One of the problems pertinent to wireless sensor networks is the coverage problem with number of definitions, depending on the assumed conditions. In this paper we consider hard optimization area coverage problem with the goal of finding optimal sensor nodes positions that maximize probabilistic coverage of the area of interest. For such type of optimization problem swarm intelligence stochastic metaheuristics have been successfully used. In this paper we propose a modified enhanced fireworks algorithm for wireless sensor network coverage problem and compare it with other approaches from literature, where our algorithm proved to be very robust and better, considering all conducted tests.

关键词： Wireless sensor networks coverage problem Fireworks algorithm Swarm intelligence Metaheuristic optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：