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

coverage and connectivity Aware Deployment Scheme for Autonomous Underwater Vehicles in Underwater Wireless Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2023年第2期132卷 909-931页

作者： Kumari, Sangeeta Mishra, Pavan Kumar Anand, Veena Bennett Univ Sch Comp Sci Engn & Technol Greater Noida 201310 UP India NIT Raipur Dept Informat Technol Raipur 492010 CG India NIT Raipur Dept Comp Sci & Engn Raipur 492010 CG India

For efficient monitoring of marine environments using underwater wireless sensor networks (UWSNs), a fundamental issue is to maximize network coverage as well as connectivity by appropriate deployment of the nodes within a given sensing area. Most of the existing node deployment schemes proposed for UWSNs, assume that sensor nodes are static and their location after deployment are fixed. However, due to ocean current and the contact of the underwater creatures, these deployed static sensor node moves from its original locations to other locations, which disrupts the network connectivity with the base stations as well as most of the targets remain uncovered. To find a solution to this issue, authors propose a coverage and connectivity aware deployment scheme for optimal placement of a set of autonomous underwater vehicles (AUVs) within UWSNs. The proposed scheme uses an improved Non-dominated Sorting Genetic Algorithm-II based metaheuristic technique with a novel fitness function which contains three parameters namely coverage quality, connected cost and network lifetime. Further, proposed scheme applies an effective encoding scheme for the population representation and devises a novel fitness function for upgrading the quantity of the AUVs as well as their location. Performance estimation of the proposed scheme and its comparison with the existing schemes with respect to convergence rate, coverage quality, connected cost, average energy consumption and network lifetime are discussed in detail. The simulation outcome confirm that the proposed approach upgrades the coverage of the network.

关键词： Autonomous underwater vehicles coverage and connectivity Node deployment NSGA-II Underwater wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Target-aware distributed coverage and connectivity algorithm for wireless sensor networks

引用

WIRELESS NETWORKS 2023年第4期29卷 1815-1830页

作者： Banoth, Sanjai Prasada Rao Donta, Praveen Kumar Amgoth, Tarachand MLR Inst Technol Dept Comp Sci & Engn Hyderabad 500043 Telangana India Indian Inst Technol Indian Sch Mines Dept Comp Sci & Engn Dhanbad India

One of the wireless sensor networks applications is to sense a discrete set of targets lying on the field and maintain connectivity with the sink for data transmission. In addition, it needs to minimize energy consumption to maximize the coverage lifetime. One such solution for coverage maximization is to group sensor nodes into cover sets. Each cover set remains active at a time to keep track of all the targets in the field until one of its active nodes depletes energy completely. Therefore, maximizing the number of cover sets and enhancing each set's coverage lifetime is a challenging issue. In this paper, we propose a new energy-aware algorithm for the coverage and connectivity of the sensor nodes. In the algorithm, we devise an energy-efficient strategy to maximize the number of cover sets and energy-aware connectivity. Extensive simulation runs show that the proposed algorithm outperforms the existing ones.

关键词： Wireless sensor networks coverage and connectivity Energy-aware algorithm Cover sets coverage lifetime maximization

来源：评论

学校读者我要写书评

暂无评论

Memetic Algorithm based Energy Efficient Wake-up Scheduling Scheme for Maximizing the Network Lifetime, coverage and connectivity in Three-Dimensional Wireless Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第2期123卷 1507-1522页

作者： ChawranAff, Vrajesh Kumar Gupta, Govind P. Natl Inst Technol Dept Informat Technol Raipur 492010 Chhattisgarh India

In wireless sensor networks (WSNs), energy efficient wakeup scheduling of sensor nodes is one of an efficient approach for saving the energy consumption of the network. Determining an optimal wakeup schedule of sensor nodes with satisfactory coverage and connectivity requirements is very challenging issue and known as NP-hard problem. In literature, several evolutionary or meta-heuristic algorithm-based schemes are proposed for solving this problem. Most of the existing wakeup scheduling schemes consider only either coverage or connectivity constraint. Only very few proposed schemes consider both coverage and connectivity constraints for determining an optimal wakeup schedule. These existing schemes do not guarantee optimal solution and sometimes struck in local minima. In this paper, an improved Memetic Algorithm based energy efficient wakeup scheduling scheme is proposed where four constraints are considered such as energy consumption, coverage, connectivity, and optimal length of wakeup schedule list. The proposed scheme devises a novel mutation, crossover, and local search operators. An extensive simulation experiments are done in different network scenarios to prove the performance of the proposed scheme and compare its performance with two latest existing schemes. The results confirm that the proposed scheme performs better than the existing schemes in terms of coverage ratio, optimal number of active sensor nodes and network lifetime.

关键词： Sleep scheduling Wireless sensor network Energy efficiency coverage and connectivity Memetic algorithm

来源：评论

学校读者我要写书评

暂无评论

coverage and connectivity aware energy efficient scheduling in target based wireless sensor networks: an improved genetic algorithm based approach

引用

WIRELESS NETWORKS 2019年第4期25卷 1995-2011页

作者： Harizan, Subash Kuila, Pratyay Natl Inst Technol Sikkim Dept Comp Sci & Engn Ravangla 737139 India

Energy efficient scheduling of sensor nodes is one of the most efficient techniques to extend the lifetime of the wireless sensor networks (WSNs). Instead of activating all the deployed sensor nodes, a set of sensor nodes are activated or scheduled to monitor the targeted region. While scheduling with lesser number of sensor nodes, coverage and connectivity of the network should be taken care due to the limited sensing and communication range of the sensor nodes. In this paper, we have proposed an improved genetic algorithm (GA) based scheduling for WSNs. An efficient chromosome representation is given and it is shown to generate valid chromosome after crossover and mutation operation. The fitness function is derived with four conflicting objectives, selection of minimum number of sensor nodes, full coverage, connectivity and energy level of the selected sensor nodes. We have introduced a novel mutation operation for better performance and faster convergence of the proposed GA based approaches. We have also formulated the scheduling problem as a Linear Programming. Extensive simulation is performed on various network scenarios by varying number of deployed sensor nodes, target point and network length. We also perform a popular statistical test, analysis of variance followed by post hoc analysis.

关键词： Wireless sensor networks Genetic algorithm (GA) Novel mutation Scheduling coverage and connectivity Network lifetime

来源：评论

学校读者我要写书评

暂无评论

Alternative Nature-Inspired Optimizers: An Attempt to Solve the coverage and connectivity Problem in Wireless Sensor Network Deployment

Alternative Nature-Inspired Optimizers: An Attempt to Solve...

引用

International Conference on Intelligent Systems and Networks, ICISN 2024

作者： Tran, Son Phan, Duc Manh Vu, Huy Nhat Minh Hoang, Anh Hoang, Duc Chinh Hanoi University of Science and Technology Hanoi Viet Nam

ISBN: (纸本)9789819755035

Ensuring adequate coverage and connectivity are key obstacles in deploying Wireless Sensor Networks, significantly affecting network performance. This study tackles these challenges in planned deployments by exploring alternative optimization approaches beyond conventional algorithms, such as Genetic Algorithms and Particle Swarm Optimization. Specifically, it investigates the effectiveness of Differential Evolution, Grey Wolf Optimizer, and Cuckoo Search. The main contribution lies in adapting these algorithms to make a better outcome while fulfill connectivity requirements, laying a groundwork for future investigations into WSNs deployment using diverse meta-heuristic algorithms, despite the simplicity of the model employed in this study. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： coverage and connectivity Meta-heuristic algorithms Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Maximising coverage under connectivity Constraint Utilising Nature-inspired Algorithms: A Comparative Analysis

Maximising Coverage under Connectivity Constraint Utilising ...

引用

IEEE Asia Meeting on Environment and Electrical Engineering (IEEE-AM)

作者： Huy Nhat Minh Vu Son Tran Duc Manh Phan Anh Hoang Duc Chinh Hoang Hanoi Univ Sci & Technol Sch Elect & Elect Engn Hanoi Vietnam

ISBN: (纸本)9798350381061

coverage and connectivity represent two of the most fundamental challenges in Wireless Sensor Networks stemming from their profound influence on network performance. This paper addresses these issues within the planned deployment context and presents meta-heuristic algorithms based on nature-inspired algorithms combined with graph theory to solve the problem. Four utilised algorithms are Genetic Algorithm, Particle Swarm Optimization, Ant Colony Optimization, and Artificial Bee Colony. Proposed methods are tested through Matlab simulations to verify the theoretical findings and practical effectiveness. The main contribution is how the initial population is meticulously generated, resulting in better performance to some extent in several case studies compared with other research findings, especially when applying the bee algorithm. Despite simplistic model assumptions, the methods still showcase the potential for practical application deployed in irregular shape areas, such as building environments with obstacles.

关键词： Node deployment coverage and connectivity meta-heuristic algorithms Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

Scalable Emulated Framework for IoT Devices in Smart Logistics Based Cyber-Physical Systems: Bonded coverage and connectivity Analysis

引用

IEEE ACCESS 2020年 8卷 138350-138372页

作者： Abbas, Arbab Waseem Marwat, Safdar Nawaz Khan Univ Engn & Technol Peshawar Dept Comp Syst Engn Peshawar 25000 Pakistan

In this research, scalable framework for Smart Logistics based Cyber-Physical System (SLCPS) is emulated for stable coverage and connectivity of Internet of Things (IoT) devices. This work is modern manifestation of three laws of computing. Moore's and Koomey's laws recommend performance gain and energy efficiency whereas Metcalfe's law imply network scalability. Combination of these laws suggests the research proposition that development of scalable and performance efficient IoT networks is inevitable. Although IoT has improved specific logistics modules considerably, but incorporation of IoT in complete supply chain of food and random placement of IoT devices due to which unstable coverage and connectivity occurred are major challenges in logistics. The proposed SLCPS framework is designed firstly, to develop apt IoT protocol stack for logistics. Secondly, for bonded connectivity and coverage, mathematical models are proposed instead of random placement and coverage map is based on binary coverage model. Thirdly, for scalability supply chain of food for smart logistics process is designed in terms of container, storehouse and warehouse comprising of varying number of IoT devices. The architecture of SLCPS framework has three modules i.e. internal IoT network, border router and external network, emulated in Cooja simulator. The contikimac protocol is used for efficient traffic flow and power consumption. Single hop, multiple hops and random IoT devices placement scenarios are used for results comparison and validation. The performance evaluation results, i.e. throughput, network convergence time, packet delivery ratio, average latency, power consumption and timeline investigation validated utilization of proposed framework in terms of enhanced network performance. Significance of proposed SLCPS framework results in cost minimization, reducing communication and computation overhead, resilience to IoT device failures and an interference free network connectivity and

关键词： Logistics Wireless sensor networks Internet of Things Protocols Monitoring Containers Cyber-physical systems Cyber-physical systems cooja coverage and connectivity Internet of Things IoT device placement and smart logistics

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Different Optimization Techniques for coverage and connectivity Control in Backbone Based Wireless Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第3期96卷 4329-4345页

作者： Khan, Khalid Lobiyal, D. K. JNU Sch Comp & Syst Sci SC & SS New Delhi 110067 India

In this paper, performance evaluation of Newton-Raphson and conjugate gradient method has been studied in comparison to Steepest Decent method for coverage and connectivity control in backbone based wireless networks. In order to design such wireless networks, the main challenge is to ensure network requirements such as network coverage and connectivity. To optimize coverage and connectivity, backbone nodes will be repositioned by the use of mobility control based on above mentioned methods. Thus the network get self organized which autonomously achieve energy minimizing configuration. Furthermore by simulation using MATLAB R2010a, methods are compared on the basis of optimized cost, number of iterations and elapsed time i.e. total time taken to execute the algorithm.

关键词： coverage and connectivity Steepest descent Newton-Raphson and conjugate gradient method Hessian matrix Dynamic wireless networks Directional wireless communications

来源：评论

学校读者我要写书评

暂无评论

Cooperative Communication based Regular Topology to Achieve coverage and K-connectivity for WSNs 13

Cooperative Communication based Regular Topology to Achieve ...

引用

13th IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Lu, Xiaolin Cheng, Wei He, Qiang Xie, Xiaolong Northwestern Polytech Univ Sch Elect & Informat Xian Shaanxi Peoples R China Shaan Xi Prov Elect Power Co Maintenance Co Xian Shaanxi Peoples R China

ISBN: (纸本)9781538637586

How to increase the connectivity of the whole network is a critical research issue while achieving full coverage in WSNs. In this paper, a novel paradigm of regular topology is proposed which adapts Cooperative Communication (CC) model with two-node cooperation to achieve K-connectivity and full coverage. Then we analyze the changes of sensor connectivity in square triangle and hexagon patterns with the increase of transmission power under two-node cooperation and one-node operation respectively. Numerical results show our proposed paradigm on regular topology could increase the connectivity of the whole network effectively, while achieving full coverage for WSNs.

关键词： coverage and connectivity Two-node Cooperation Wireless Sensor Networks Cooperative Communication

来源：评论

学校读者我要写书评

暂无评论

Levenberg-Marquardt optimization method for coverage and connectivity control in backbone-based wireless networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2017年第14期30卷 n/a-N.PAG页

作者： Khan, Khalid Lobiyal, D. K. Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

One of the main challenge in designing wireless networks is to ensure optimal coverage and connectivity, which can be achieved by optimally repositioning nodes in backbone network such that the total energy requirement is minimized. Therefore, an efficient optimization algorithm that converges at faster rate while minimizing the cost function (total power) is required. In this paper, we propose the use of Levenberg-Marquardt optimization algorithm to achieve assured coverage and connectivity control in backbone-based wireless networks. The Levenberg-Marquardt method combines the advantages of Cauchy steepest descent method and Newton-Raphson method and is expected to achieve faster convergence rate irrespective of initial conditions, which is the main motivation of thisstudy. It relies on that when current solution is far from the optimal solution, then steepest descent method will be used, and as current solution approaches to optimal solution, then gradually switched to Newton-Raphson method to find the optimal solution. Extensive simulations using MATLABR2020a has been performed to demonstrate the effectiveness of proposed method by measuring its performance in the number of iterations, elapsed time, and power requirement to maintain proper coverage and connectivity. The performance is compared with Cauchy steepest descent method as well as Newton-Raphson method.

关键词： coverage and connectivity directional wireless communications dynamic wireless networks Newton-Raphson and Levenberg-Marquardt method steepest descent

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：