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

Solving the target coverage problem in multilevel wireless networks capable of adjusting the sensing angle using continuous learning automata

引用

IET COMMUNICATIONS 2022年第2期16卷 151-163页

作者： Qarehkhani, Azam Golsorkhtabaramiri, Mehdi Mohamadi, Hosein Yadollahzadeh-Tabari, Meisam Islamic Azad Univ Babol Branch Dept Comp Engn Babol Iran Islamic Azad Univ Azadshahr Branch Dept Comp Engn Azadshahr Iran

Today, a directional sensor network is a popular environment for solving the target coverage problem. Monitoring all targets in a DSN is a crucial challenge to scholars working in this field of study. Adjusting the angle and range of the sensors can be an efficient technique for improving the network performance. In this way, the network has the most extended lifespan and, at the same time, spends the least time to find the best cover set. In this method, each sensor dynamically adjusts its own sensing angle in order to find the targets by choosing the best range. The present study proposed a continuous learning automata-based method to choose the optimum sensing angle for the sensors in a DSN. Then, to evaluate the proposed algorithm performance, its results were compared to those of a conventional automata-based method whose algorithm worked based on continuous automata. The comparative analysis confirmed the superiority of the proposed method over the conventional automata-based method regarding the extension of the network lifespan.

关键词： target coverage problem conventional automata-based method popular environment wireless sensor networks algorithm performance continuous learning automata-based method DSN directional sensor network multilevel wireless networks network lifespan network performance optimum sensing angle telecommunication computing continuous automata learning automata

来源：评论

学校读者我要写书评

暂无评论

Enhancing Quality of coverage for target coverage problem Using Discrete Haar Wavelet

引用

WIRELESS PERSONAL COMMUNICATIONS 2018年第4期101卷 1817-1837页

作者： Arivudainambi, D. Balaji, S. Sripathy, B. Vijayaraju, P. Anna Univ Chennai Dept Math CEG Campus Madras Tamil Nadu India

Quality of coverage is one of the fundamental issues in wireless sensor networks, particularly for the deterministic placement of sensors. One of the methods to improve the quality of coverage is to place the minimum number of sensors in the optimal position to cover the entire target. This paper proposes a discrete Haar wavelet transform for deterministic sensor placement in the target coverage problem. Dilation and translation of Haar wavelet transform are used for identifying the optimal position of sensors. Simulation results validate the performance of discrete Haar wavelet transform better than random placement in terms of optimal placement, quality of coverage and network traffic reduction.

关键词： Deterministic placement Haar wavelet Wireless sensor network target coverage problem

来源：评论

学校读者我要写书评

暂无评论

A Learning Automata-Based Solution to the Priority-Based target coverage problem in Directional Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2014年第3期79卷 2323-2338页

作者： Mohamadi, Hosein Salleh, Shaharuddin Ismail, Abdul Samad Univ Teknol Malaysia UTM Ctr Ind & Appl Math Johor Baharu 81310 Malaysia Univ Teknol Malaysia Fac Comp Dept Comp Sci Johor Baharu 81310 Malaysia

In recent years, directional sensor networks composed of directional sensors have attracted a great deal of attention due to their extensive applications. The main difficulties associated with directional sensors are their limited battery power and restricted sensing angle. Moreover, each target may have a different coverage quality requirement that can make the problem even more complicated. Therefore, satisfying the coverage quality requirement of all the targets in a specific area and maximizing the network lifetime, known as priority-based target coverage problem, has remained a challenge. As sensors are often densely deployed, organizing the sensor directions into several cover sets and then activating these cover sets successively is a promising solution to this problem. In this paper, we propose a learning automata-based algorithm to organize the directional sensors into several cover sets in such a way that each cover set can satisfy coverage quality requirement of all the targets. In order to verify the performance of the proposed algorithm, several simulations were conducted. The obtained results showed that the proposed algorithm was successful in extending the network lifetime.

关键词： Directional sensor networks target coverage problem Cover set formation Learning automata

来源：评论

学校读者我要写书评

暂无评论

The optimization of network lifetime with sensor deployment for target coverage problem in wireless sensor networks

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GA...

引用

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY 2017年第4期32卷 1155-1167页

作者： Ozdag, Recep Yuzuncu Yil Univ Muhendisl Fak Bilgisayar Muhendisligi Bolumu TR-65080 Van Turkey

Network lifetime is a critical factor in determining the effectiveness of Wireless Sensor Networks (WSNs). The optimization of the battery lives of the sensor nodes following the targets in terms of continuity of WSNs coverage in military and civil applications plays an important role in extending the network's lifetime. Since the sensor nodes that constitute WSNs have limited battery life, the energy of the sensors gradually decreases as a result of communicating among themselves and perceiving field of interest. Ultimately, the node consumes its energy completely and causes WSN to fail to function. For this reason, the optimization of the lifetime of WSNs has been one of the most frequently studied topics in the literature. In this article, it was aimed to optimize the lifetime of the network by performing dynamic distributions of the nodes provided that the coverage requirements (1 <= k <= 4) of the maximum four sensor nodes are met to find solution to the target coverage problem in WSNs. It was aimed to determine the accessible lifetime of the network by calculating the remaining battery life of the nodes and the upper limit of the network lifetime when the coverage requirements of the targets are met. In addition, Electromagnetism-Like (EM) algorithm, which is meta-heuristic in performing the dynamic distributions of sensor nodes, was taken as a basis, and a new energy-efficient algorithm was developed. The accessible network lifetimes calculated with this algorithm were compared with the Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO) algorithms in the literature. According to the obtained simulation results, it was found that the algorithm developed in reaching the upper limit of the network lifetime gave more optimum results.

关键词： Wireless sensor networks target coverage problem k-coverage requirement network lifetime sensor deployment

来源：评论

学校读者我要写书评

暂无评论

A New Learning Automata-Based Algorithm to the Priority-Based target coverage problem in Directional Sensor Networks 6

A New Learning Automata-Based Algorithm to the Priority-Base...

引用

6th International ICST Conference on Mobile Networks and Management (MONAMI)

作者： Salleh, Shaharuddin Marouf, Sara Mohamadi, Hosein Univ Teknol Malaysia Ctr Ind & Appl Math Johor Baharu Malaysia

ISBN: (纸本)9783319162928;9783319162911

One of the main operations in directional sensor networks (DSNs) is the surveillance of a set of events (targets) that occur in a given area and, at the same time, maximization of the network lifetime;this is due to limitation in sensing angle and battery power of the directional sensors. This problem gets more complicated by the possibility that targets may have different coverage requirements. In the present study, this problem is referred to as priority-based target coverage (PTC). As sensors are often densely deployed, organizing the sensors into several cover sets and then activating these cover sets successively is a promising solution to this problem. In this paper, we propose a learning automata-based algorithm to organize the directional sensors into several cover sets in such a way that each cover set could satisfy coverage requirements of all the targets. Several experiments are conducted to evaluate the performance of the proposed algorithm. The results demonstrated that the algorithms were able to contribute to solving the problem.

关键词： Directional sensor networks target coverage problem Cover set formation Learning automata

来源：评论

学校读者我要写书评

暂无评论

Improved Memetic Algorithm for Energy Efficient Sensor Scheduling with Adjustable Sensing Range

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第2期95卷 1737-1758页

作者： Arivudainambi, D. Balaji, S. Anna Univ Dept Math CEG Campus Madras Tamil Nadu India

In this paper, a novel improved memetic algorithm is proposed for maximizing the sensor covers from the randomly deployed sensors in a hostile environment. This is achieved by optimizing the sensing range of the sensors by reducing the redundant target coverage and partitioning the set of all sensors into several subsets or sensor covers in such a way that each sensor cover monitors the entire targets. Further, sensor covers are activated one after another for maximizing the lifetime of a sensor network. The proposed algorithm identifies the maximum number of sensor covers by selecting the best sensors and adjusts the required sensing range. Simulation results of various problem instances proves that network lifetime of improved memetic algorithm is 1.1662 times higher than the existing memetic algorithm and 1.6848 times higher than the existing genetic algorithm.

关键词： target coverage problem Sensor scheduling Memetic algorithm Wireless sensor network Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling of Directional Sensors with QoS Constraints to Enhance the Lifetime

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第1期124卷 741-761页

作者： Anitha, M. Somasundaram, P. Balaji, S. Swetha, S. St Josephs Coll Engn Dept Elect & Elect Engn Chennai Tamil Nadu India Anna Univ Dept Elect & Elect Engn Chennai Tamil Nadu India Vellore Inst Technol Chennai Campus Sch Adv Sci Chennai Tamil Nadu India Anna Univ Dept Math Chennai Tamil Nadu India

Wireless sensor networks have become one of the prominent and persuasive methods for surveillance of inaccessible physical areas and are employed in innumerable applications in various fields. Some applications may require directional sensor nodes in contrast to the conventional omnidirectional ones. Many challenges emerge during deployment of such sensor networks especially in terms of energy constraints. These sensor nodes are furnished with non-rechargeable energy sources which may lead to inefficiency in the network within a very short span of time. Conserving energy of the sensor nodes by organizing the sensor nodes into cover sets and actuating them one after the other, while ensuring maintenance of the complete coverage of all targets, is one of the common approaches to extend the network lifetime. This paper addresses Q-coverage problem of directional sensor networks in which each target is required to be covered by different number of sensor nodes for effective surveillance and Q-coverage constraints are considered while segregating the sensor nodes operating in different sensing directions to a different cover sets. An approach based on genetic algorithm is proposed to find an ideal solution to the directional Q-coverage problem and the simulation results confirm that the network lifetime is prolonged.

关键词： Directional sensor network Q-coverage problem target coverage problem

来源：评论

学校读者我要写书评

暂无评论

coverage and Connectivity-Based 3D Wireless Sensor Deployment Optimization

引用

WIRELESS PERSONAL COMMUNICATIONS 2020年第2期112卷 1185-1204页

作者： Arivudainambi, D. Pavithra, R. Anna Univ Dept Math Chennai 25 Tamil Nadu India

The wireless sensor network technology of Internet of Things (IoT) senses, collects and processes the data from its interconnected intelligent sensors to the base station. These sensors help the IoT to understand the environmental change and respond towards it. Thus sensor placement is a crucial device of IoT for efficient coverage and connectivity in the network. Many existing works focus on optimal sensor placement for two dimensional terrain but in various real-time applications sensors are often deployed over three-dimensional ambience. Therefore, this paper proposes a vertex coloring based sensor deployment algorithm for 3D terrain to determine the sensor requirement and its optimal spot and to obtain 100% target coverage. Further, the quality of the connectivity of sensors in the network is determined using Breadth first search algorithm. The results obtained from the proposed algorithm reveal that it provides efficient coverage and connectivity when compared with the existing methods.

关键词： Network connectivity Optimal sensor placement target coverage problem Vertex coloring

来源：评论

学校读者我要写书评

暂无评论

Toward Efficient Sensor Deployment in Internet of Things for target coverage and Sensor Connectivity

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2024年第3期70卷 5432-5440页

作者： Balaji, S. Pavithra, R. Arivudainambi, D. Varunkumar, K. A. Suresh, A. Omar, Marwan Bashir, Ali Kashif Vellore Inst Technol Sch Adv Sci Math Div Chennai Campus Chennai 600127 India Anna Univ Dept Math Chennai 600025 India SRM Inst Sci & Technol Fac E&T Sch Comp Dept Networking & Commun Kattankulathur 603203 India IIT Informat Technol & Management Warrenville IL 60555 USA Manchester Metropolitan Univ Dept Comp & Math Manchester M15 6BH England Woxsen Univ Woxsen Sch Business Hyderabad 502345 India

The Internet of Things (IoT) has become widely popular due to its rapid progress and broad range of practical uses, which have significantly impacted our daily lives. One such key utilization of IoT is making consumer electronics interactive, interconnected and self-responsible by means of sensors and Internet. Sensors play a crucial role as the primary technology that enables the Internet of Things (IoT) and its various applications. The inherent difficulty hinders the further growth of IoT. One such problem is utilizing minimum number of sensors to achieve maximum coverage and connectivity in the network. The most accurate method to encounter this issue is optimal Sensor Placement (OSP). OSP predetermines the sensor's position for its deployment to attain maximum network coverage and connectivity. Hence, this paper proposes a coverage and connectivity-preserving hierarchical algorithm based on discrete Haar wavelet transform for optimal sensor placement algorithm. The proposed algorithm utilizes discrete Haar wavelet transform, for identifying sensor's position and to ensure connectivity Breadth first search algorithm is used. Further, to enhance the coverage, proposed algorithm determines redundant sensors and redeploy it in determined spots. The results obtained from the proposed algorithm effectively address the research problem and attain better results compared with the existing efficient methods.

关键词： Internet of Things Sensor placement Monitoring Discrete wavelet transforms Base stations Approximation algorithms Wireless sensor networks Breadth first search algorithm discrete haar wavelet transform optimal sensor placement target coverage problem

来源：评论

学校读者我要写书评

暂无评论

Optimal Deployement of Sensors in 3D-terrain with Q-coverage Constraints 17

Optimal Deployement of Sensors in 3D-terrain with Q-Coverage...

引用

17th IEEE SENSORS Conference

作者： Balaji, S. Priyanka Anitha SGSITS Dept Appl Math & Computat Sci Indore Madhya Pradesh India Anna Univ Dept Elect & Elect Engn Chennai Tamil Nadu India

ISBN: (纸本)9781538647073

WSN has been playing a significant role in various applications in recent days. The main issue in wireless sensor network, particularly for target coverage problem is to achieve maximum quality of coverage with limited sensors. To short out these issues, identify the optimal position for each sensor to satisfy the coverage requirement. This paper proposes a particle swarm optimization for Q-coverage problem, where each target can be covered by one or more sensors. The main objective of the proposed algorithm is to optimize the position of sensors for satisfying Q-coverage constraints. Simulation results show that the proposed algorithm achieves a good Q-coverage compared with random deployment of sensors.

关键词： target coverage problem Q-coverage problem Deployment Technique

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：