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

Graph Cellular Automata approach to the maximum lifetime coverage problem in wireless sensor networks

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2016年第2期92卷 153-164页

作者： Tretyakova, Antonina Seredynski, Franciszek Bouvry, Pascal Cardinal Stefan Wyszynski Univ Dept Math & Nat Sci Woycickiego 1-3 PL-01938 Warsaw Poland Univ Luxembourg CSC Res Unit Luxembourg Luxembourg

In this paper, we propose a distributed algorithm based on a generalization of the Cellular Automata concept called Graph Cellular Automata (GCA) to solve the maximum lifetime coverage problem (MLCP) in wireless sensor networks (WSNs). In GCA, we adapt life-like state transition functions inspired by Conway's Game of Life in order to solve the problem. The goal of this paper is to study the quality of state transition functions for an objective provided by the MLCP in WSNs. The proposed algorithm possesses all the advantages of a localized algorithm, i.e., using only some knowledge about neighbors, a WSN is able to self-organize in such a way as to prolong its lifetime, at the same time preserving the required coverage ratio of the target field. Our experimental results show that certain rules are better solvers of the given problem than others. The paper also presents the results of an experimental study of the proposed algorithm and comparison with a centralized Genetic Algorithm.

关键词： coverage control maximum lifetime coverage problem cellular automata wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Graph - Based Cellular Automata Approach to maximum lifetime coverage problem in Wireless Sensor Networks 28

Graph - Based Cellular Automata Approach to Maximum Lifetime...

引用

28th IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)

作者： Tretyakova, Antonina Seredynski, Franciszek Bouvry, Pascal Cardinal Stefan Wyszynski Univ Warsaw Dep Math & Nat Sci Woycickiego 1-3 PL-01938 Warsaw Poland Univ Luxembourg CSC Res Unit L-1359 Luxembourg Luxembourg

ISBN: (纸本)9781479941162

In this paper, we propose a novel localized algorithm based on Graph Cellular Automata concept to solve maximum lifetime coverage problem (MLCP) in Wireless Sensor Networks (WSNs). The proposed algorithm possesses all advantages of localized algorithm, i.e. based only on some knowledge about the neighbors, WSN can be reorganized preserving required coverage ratio and prolonging lifetime of the WSN. The paper presents results of experimental study of the proposed algorithm and comparison with recently proposed centralized evolutionary algorithms [1]. The first simulation results show that the proposed algorithm in some cases achieves the same results as centralized algorithm in terms of lifetime(q) metric presented recently in [2] and [3].

关键词： coverage control Genetic algorithms maximum lifetime coverage problem

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithm - based Solutions to maximum lifetime coverage problem in Wireless Sensor Networks

Evolutionary Algorithm - based Solutions to Maximum Lifetime...

引用

2nd IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC)

作者： Tretyakova, Antonina Seredynski, Franciszek Polish Japanese Inst Informat Technol Koszykowa 86 PL-02008 Warsaw Poland Cardinal Stefan Wyszynski Univ Warsaw Dep Math & Natural Sci PL-01938 Warsaw Poland Siedlce Univ Nat Sci & Human Comp Sci Dept PL-08110 Siedlce Poland

ISBN: (纸本)9781467329255;9781467329224

The paper analyzes three recently proposed algorithms, which diner not only in the method of finding solution to the maximum lifetime coverage problem, but also in approaches to formulation of the problem. In order to compare the algorithms: (1) they were adapted to the common assumptions such as the same scenario of WSN work and the same characteristics, i.e. a size of target field, a number of sensors N, a sensing range R-s were used, (2) special sensor network simulator was implemented. Evaluation of lifetime was made according to introduced metrics: minT(q) and maxT(q). The paper presents the results of an experimental study. Based on the results of experiments, conclusions about the validity of the assumptions of algorithms, quality of solutions and possible improvements are drawn.

关键词： wireless sensor networks maximum lifetime coverage problem genetic algorithm memetic algorithm

来源：评论

学校读者我要写书评

暂无评论

maximum lifetime coverage problems with Battery Recovery Effects

Maximum Lifetime Coverage Problems with Battery Recovery Eff...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Fu, Norie Suppakitpaisarn, Vorapong Kimura, Kei Kakimura, Naonori Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan JST ERATO Kawarabayashi Large Graph Project Tokyo Japan Univ Tokyo Dept Math Informat Tokyo 1138654 Japan Univ Tokyo Grad Sch Arts & Sci Tokyo 1138654 Japan

ISBN: (纸本)9781479935123

Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear programming problem with exponential size, and has a constant-factor approximation algorithm. In reality, however, batteries of sensors have recovery effects, which is a phenomenon that the deliverable energy in batteries can be replenished by itself if it is left idling for sufficient duration. Thanks to that effects, we can obtain much longer lifetime of sensors if each sensor is forced to take a sleep at some interval. In this paper, we introduce two models that extend the MLCP, incorporating battery recovery effects. The first model represents battery recovery effects in a deterministic way, while the second one uses a probabilistic model to imitate the effects. We then propose efficient algorithms that work for both models by extending approximation algorithms for the original MLCP. Numerical experiments show that the lifetime of our schedule is 10-40% longer than one without battery recovery effects.

关键词： approximation theory linear programming telecommunication scheduling wireless sensor networks MLCP battery recovery effect constant-factor approximation algorithm linear programming problem maximum lifetime coverage problem probabilistic model sensor scheduling wireless sensor network Approximation algorithms Approximation methods Batteries Heuristic algorithms Mathematical model Numerical models Schedules

来源：评论

学校读者我要写书评

暂无评论

Enhancing lifetime coverage in Wireless Sensor Networks: A Learning Automata Approach 24th

Enhancing Lifetime Coverage in Wireless Sensor Networks: A L...

引用

24th International Conference on Computational Science (ICCS)

作者： Gasior, Jakub Cardinal Stefan Wyszyriski Univ Dept Math & Nat Sci Warsaw Poland

ISBN: (纸本)9783031637858;9783031637834

This paper focuses on enhancing the lifespan of the Wireless Sensor Network (WSN) by integrating a distributed Learning Automaton into its operation. The proposed framework seeks to determine an optimized activity schedule that extends the network's lifespan while ensuring that the monitoring of designated target areas meets predefined coverage requirements. The proposed algorithm harnesses the advantages of localized algorithms, including leveraging limited knowledge of neighboring nodes, fostering self-organization, and effectively prolonging the network's longevity while maintaining the required coverage ratio in the target field.

关键词： Wireless sensor networks Self-organization Learning automata maximum lifetime coverage problem

来源：评论

学校读者我要写书评

暂无评论

Scheduling Sensors Activity in Wireless Sensor Networks 9th

Scheduling Sensors Activity in Wireless Sensor Networks

引用

9th International Conference on Computational Collective Intelligence (ICCCI)

作者： Tretyakova, Antonina Seredynski, Franciszek Guinand, Frederic Cardinal Stefan Wyszynski Univ Warsaw Dept Math & Nat Sci Warsaw Poland Univ Le Havre LITIS Lab Le Havre France

ISBN: (纸本)9783319670744;9783319670737

In this paper we consider Maximal lifetime coverage problem in Wireless Sensor Networks which is formulated as a scheduling problem related to activity of sensors equipped at battery units and monitoring a two-dimensional space in time. The problem is known as an NP-hard and to solve it we propose two heuristics which use specific knowledge about the problem. The first one is proposed by us stochastic greedy algorithm and the second one is metaheuristic known as Simulated Annealing. The performance of both algorithms is verified by a number of numerical experiments. Comparison of the results show that while both algorithms provide results of similar quality, but greedy algorithm is slightly better in the sense of computational time complexity.

关键词： maximum lifetime coverage problem Metaheuristics Energy-efficient coverage preserving protocol

来源：评论

学校读者我要写书评

暂无评论

A Learning Automata-Based Approach to lifetime Optimization in Wireless Sensor Networks 20th

A Learning Automata-Based Approach to Lifetime Optimization ...

引用

20th International Conference on Artificial Intelligence and Soft Computing (ICAISC)

作者： Gasior, Jakub Seredynski, Franciszek Cardinal Stefan Wyszynski Univ Dept Math & Nat Sci Warsaw Poland

ISBN: (纸本)9783030879860;9783030879853

The paper examines the problem of lifetime optimization in Wireless Sensor Networks with an application of a distributed epsilon-Learning Automaton. The scheme aims to find a global activity schedule maximizing the network's lifetime while monitoring some target areas with a given measure of requested coverage ratio. The proposed algorithm possesses all the advantages of a localized algorithm, i.e., using only limited knowledge about neighbors, the ability to self-organize in such a way as to prolong the lifetime, and, at the same time, preserving the required coverage ratio of the target field. We present the preliminary results of an experimental study comparing the proposed solution with two centralized algorithms providing an exact (Integer Linear Programming (ILP)) and approximated solution (Genetic Algorithm (GA)) of the studied problem.

关键词： Learning automata Self-organization Wireless Sensor Networks maximum lifetime coverage problem

来源：评论

学校读者我要写书评

暂无评论

Application of Local Search with Perturbation Inspired by Cellular Automata for Heuristic Optimization of Sensor Network coverage problem 12th

Application of Local Search with Perturbation Inspired by Ce...

引用

12th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Trojanowski, Krzysztof Mikitiuk, Artur Napiorkowski, Krzysztof J. M. Cardinal Stefan Wyszynski Univ Warsaw Warsaw Poland

ISBN: (纸本)9783319780542;9783319780535

A cellular automata inspired approach to the problem of effective energy management in a sensor network is presented. The network consisting of a set of sensors is disseminated over an area where a number of points of interest (POI) is localized. The aim is to maximize the time when a sufficient number of POIs is monitored by active sensors. A schedule of sensor activity over time is a solution of this problem. A new heuristic algorithm inspired by a cellular automata engine is proposed. It searches for such schedules maximizing the lifetime of the sensor network. We also present a set of test cases for experimental evaluation of our approach. The proposed algorithm is experimentally tested using these test cases and the obtained results are statistically verified to prove significant contribution of the algorithm components.

关键词： Local search Sensor networks maximum lifetime coverage problem Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Sensor Network Schedule Adaptation for Varying Operating Temperature 18th

Sensor Network Schedule Adaptation for Varying Operating Tem...

引用

18th International Conference on Ad-Hoc Networks and Wireless (AdHoc-Now)

作者： Trojanowski, Krzysztof Mikitiuk, Artur Cardinal Stefan Wyszynski Univ Warsaw Poland

ISBN: (纸本)9783030318314;9783030318307

A problem of the sensor network lifetime maximization is typically solved for a fixed temperature, which means that the sensor battery performance is constant over the network time. However, networks usually have to operate in the varying temperature conditions, for example, outdoors, or in unheated rooms. The operating temperature variations influence network lifetime. Notably, sensors may discharge faster in temperatures below the one determined at the planning stage. Thus, the network cannot guarantee the required level of coverage over its entire lifetime. In this paper, we test network lifetime for the systems operating in conditions typical for the moderate climate zone in February and March. We also propose a method of the sensor schedule adaptation to the varying temperature conditions. The results show that appropriate rearrangement of slots in a schedule may significantly decrease the schedule corruption caused by the premature discharge of the sensors.

关键词： maximum lifetime coverage problem Schedule optimization Adaptation to varying temperature

来源：评论

学校读者我要写书评

暂无评论

Run-Time Schedule Adaptation Methods for Sensor Networks coverage problem 1

引用

19th International Conference on Computer Information Systems and Industrial Management

作者： Trojanowski, Krzysztof Mikitiuk, Artur Grzeszczak, Jakub A. Cardinal Stefan Wyszynski Univ Warsaw Warsaw Poland

ISBN: (数字)9783030476793

ISBN: (纸本)9783030476786;9783030476793

In this paper, we study run-time adaptation methods of a schedule of sensor activity generated for ideal temperature conditions. Such a schedule cannot be completed in low-temperature conditions due to a shorter lifetime of sensor batteries. We proposed several methods of selecting the next slot to be executed when the currently scheduled slot is unfeasible. Our experiments showed that in most cases, the best method is the one selecting the next slot based on computing the mean and standard deviation values of the battery load level for all the sensors active in a given slot.

关键词： maximum lifetime coverage problem Schedule optimization Adaptation to varying temperature

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：