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

IEEE 22nd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)

作者： Arivudainambi, D. Balaji, S. Pavithra, R. Shakthivel, R. N. Anna Univ Dept Math Madras Tamil Nadu India Anna Univ Dept Comp Sci & Engn Madras Tamil Nadu India

ISBN: (纸本)9781509063024

Efficient utilization of energy of the network is one of the major issues faced by wireless sensor network, when sensors are placed in a hostile environment. One of the methods to solve this problem is to activate only a few sensors which satisfy the coverage constraints. This can be done by partitioning a set of all sensors into many subsets or sensor covers such that each sensor cover satisfies the coverage constraints and activating them subsequently which leads to increase the network lifetime. A memetic algorithm is proposed in this paper for the q coverage problem where each target can be covered by one or more sensors. The cardinal objective of the proposed algorithm is to maximize the lifespan of the network while satisfying the coverage constraints. The proposed algorithm avoids redundancy and utilizes the available resources to maximize the network lifetime. Simulation results show that our proposed algorithm performs better than the existing algorithms.

关键词： Target coverage problem Sensor Scheduling q-coverage problem Memetic Algorithm Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：