ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

An energy aware grouping memetic algorithm to schedule the sensing activity in WSNs-based IoT for smart cities

Dowlatshahi, Mohammad Bagher; Rafsanjani, Marjan Kuchaki*; Gupta, Brij B.*
APPLIED SOFT COMPUTING2021-9DOI: 10.1016/j.asoc.2021.107473
36被引2阅读
引用收藏
分享

摘要

Wireless Sensor Networks (WSNs) are the main component in the Internet of Things (IoT) and smart cities to sense our environment, gather essential and meaningful data, and forward it to the base station (BS). Nowadays, IoT utilizes WSN as a necessary platform for sensing and communication of the data. One of the main strategies to minimize consumption of energy in a WSN with highly dense sensors is to maximize sleeping sensors at each time. This way implies to schedule the activity of sensors, i.e. determining when a sensor node is kept idle (sleep mode) and when a sensor node is activated to sense environment (active mode). Due to heterogeneity of the sensor nodes in WSNs-based IoT for smart cities, one approach for scheduling the sensing activity is clustering the sensors into K mutually different subsets, so that every subset of sensors alone can cover all targets of the network. In this case, we can solve finding the maximum number of sensor subsets, or equivalently sensor covers problem, by conversion it to SET K-COVER problem. In this paper, an energy aware Grouping Memetic Algorithm (GMA) is proposed for solving the SET K-COVER problem. The proposed GMA varies in four general ways from any of the other evolutionary algorithms for solving the SET K-COVER problem. First, to transform solution structures linked to the SET K-COVER problem into chromosome genes, a new encoding scheme was being used. Second, specific genetic operators appropriate for the chromosomes are used, based on the encoding used. Third, to direct the search process in the solution space of the SET K-COVER problem, a novel proper fitness function is proposed. Fourth, a local improvement algorithm which uses a sensor dominance rule is proposed. This study, carried out detailed experiments of different numbers of targets and different numbers of sensors in WSNs to assess the proposed algorithm. In several instances of the problem, the experiments demonstrate that the algorithm works considerably better in terms of solution quality than many other heuristics and evolutionary algorithms and significantly outperformed the evolutionary algorithms in terms of runtime, suggesting the usefulness of the proposed algorithm to increase the lifetime of WSN in IoT and smart cities.

学科与关键词

关键词
Wireless sensor network (WSN)Memetic algorithm (MA)Smart citiesInternet of things (IoT)Lifetime extensionGrouping problemsScheduling
相关
加载中…
  • Memetic Algorithm based Energy Efficient Wake-up Scheduling Scheme for Maximizing the Network Lifetime, Coverage and Connectivity in Three-Dimensional Wireless Sensor Networks
    ChawranAff, Vrajesh Kumar; Gupta, Govind P.*WIRELESS PERSONAL COMMUNICATIONS, 2022, 123(2): 1507-1522.被引 8
  • Evolutionary multi-objective set cover problem for task allocation in the Internet of Things
    Burhan, Hussein M.; Attea, Bara'a A.*; Abbood, Amenah D.; Abbas, Mustafa N.; Al-Ani, MayyadahAPPLIED SOFT COMPUTING, 2021, 102: 107097.被引 6
  • A novel cluster head selection algorithm based IoT enabled heterogeneous WSNs distributed architecture for smart city
    Singh, Samayveer*; Garg, Deepak; Manju; Malik, ArunaMICROPROCESSORS AND MICROSYSTEMS, 2023, 101: 104892.被引 6
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2021-09
卷期
第 108 卷
页码
107473
DOI
10.1016/j.asoc.2021.107473
语言
ENGLISH
期刊收录
NSL
期刊等级
1区
成果收录
SCIE

作者

  • D

    Dowlatshahi, Mohammad Bagher (第一作者)

  • R

    Rafsanjani, Marjan Kuchaki (通讯)

查看全部 3 位作者收起作者
  • G

    Gupta, Brij B. (通讯)

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417