一种提高无线传感器网络生存期的高能效覆盖保证贪婪算法

IF 0.7 Q3 ENGINEERING, MULTIDISCIPLINARY

Engineering Review Pub Date : 2022-01-01 DOI:10.30765/er.1900

Berhan Oumer Adame, Eyayaw Zewdu, A. Salau

{"title":"一种提高无线传感器网络生存期的高能效覆盖保证贪婪算法","authors":"Berhan Oumer Adame, Eyayaw Zewdu, A. Salau","doi":"10.30765/er.1900","DOIUrl":null,"url":null,"abstract":"One of the most significant difficulties in Wireless Sensor Networks (WSNs) is energy efficiency, as they rely on minuscule batteries that cannot be replaced or recharged. In battery-operated networks, energy must be used efficiently. Network lifetime is an important metric for battery-powered networks. There are several approaches to improve network lifetime, such as data aggregation, clustering, topology, scheduling, rate allocation, routing, and mobile relay. Therefore, in this paper, the authors present a method that aims to improve the lifetime of WSN nodes using a greedy algorithm. The proposed Greedy Algorithm method is used to extend the network lifetime by dividing the sensors into a number of disjoint groups while satisfying the coverage requirements. The proposed Greedy algorithm has improved the network lifetime compared to heuristic algorithms. The method was able to generate a larger number of disjoint groups.","PeriodicalId":44022,"journal":{"name":"Engineering Review","volume":"1 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An energy efficient coverage guaranteed greedy algorithm for wireless sensor networks lifetime enhancement\",\"authors\":\"Berhan Oumer Adame, Eyayaw Zewdu, A. Salau\",\"doi\":\"10.30765/er.1900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most significant difficulties in Wireless Sensor Networks (WSNs) is energy efficiency, as they rely on minuscule batteries that cannot be replaced or recharged. In battery-operated networks, energy must be used efficiently. Network lifetime is an important metric for battery-powered networks. There are several approaches to improve network lifetime, such as data aggregation, clustering, topology, scheduling, rate allocation, routing, and mobile relay. Therefore, in this paper, the authors present a method that aims to improve the lifetime of WSN nodes using a greedy algorithm. The proposed Greedy Algorithm method is used to extend the network lifetime by dividing the sensors into a number of disjoint groups while satisfying the coverage requirements. The proposed Greedy algorithm has improved the network lifetime compared to heuristic algorithms. The method was able to generate a larger number of disjoint groups.\",\"PeriodicalId\":44022,\"journal\":{\"name\":\"Engineering Review\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30765/er.1900\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30765/er.1900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 1

摘要

无线传感器网络(WSNs)最大的困难之一是能源效率，因为它们依赖于无法更换或充电的微型电池。在电池供电的网络中，能源必须得到有效利用。网络寿命是电池供电网络的一个重要指标。有几种方法可以改善网络生命周期，如数据聚合、集群、拓扑、调度、速率分配、路由和移动中继。因此，在本文中，作者提出了一种利用贪婪算法提高WSN节点生存期的方法。提出的贪心算法在满足覆盖要求的前提下，通过将传感器划分为若干不相交的组来延长网络的生存期。与启发式算法相比，提出的贪心算法提高了网络生存时间。该方法能够生成大量不相交的基团。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An energy efficient coverage guaranteed greedy algorithm for wireless sensor networks lifetime enhancement

One of the most significant difficulties in Wireless Sensor Networks (WSNs) is energy efficiency, as they rely on minuscule batteries that cannot be replaced or recharged. In battery-operated networks, energy must be used efficiently. Network lifetime is an important metric for battery-powered networks. There are several approaches to improve network lifetime, such as data aggregation, clustering, topology, scheduling, rate allocation, routing, and mobile relay. Therefore, in this paper, the authors present a method that aims to improve the lifetime of WSN nodes using a greedy algorithm. The proposed Greedy Algorithm method is used to extend the network lifetime by dividing the sensors into a number of disjoint groups while satisfying the coverage requirements. The proposed Greedy algorithm has improved the network lifetime compared to heuristic algorithms. The method was able to generate a larger number of disjoint groups.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Engineering Review ENGINEERING, MULTIDISCIPLINARY-

CiteScore

1.00

自引率

0.00%

发文量

期刊介绍： Engineering Review is an international journal designed to foster the exchange of ideas and transfer of knowledge between scientists and engineers involved in various engineering sciences that deal with investigations related to design, materials, technology, maintenance and manufacturing processes. It is not limited to the specific details of science and engineering but is instead devoted to a very wide range of subfields in the engineering sciences. It provides an appropriate resort for publishing the papers covering prior applications – based on the research topics comprising the entire engineering spectrum. Topics of particular interest thus include: mechanical engineering, naval architecture and marine engineering, fundamental engineering sciences, electrical engineering, computer sciences and civil engineering. Manuscripts addressing other issues may also be considered if they relate to engineering oriented subjects. The contributions, which may be analytical, numerical or experimental, should be of significance to the progress of mentioned topics. Papers that are merely illustrations of established principles or procedures generally will not be accepted. Occasionally, the magazine is ready to publish high-quality-selected papers from the conference after being renovated, expanded and written in accordance with the rules of the magazine. The high standard of excellence for any of published papers will be ensured by peer-review procedure. The journal takes into consideration only original scientific papers.