IEGGR: Improved Energy-aware and Delivery Guarantee Geographic Routing

IF 0.6 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Communications Software and Systems Pub Date : 2021-01-01 DOI:10.24138/JCOMSS-2020-0019
Kenza Redjimi, M. Boulaiche, M. Redjimi
{"title":"IEGGR: Improved Energy-aware and Delivery Guarantee Geographic Routing","authors":"Kenza Redjimi, M. Boulaiche, M. Redjimi","doi":"10.24138/JCOMSS-2020-0019","DOIUrl":null,"url":null,"abstract":"—Wireless Sensor Networks are a set of sensor nodes that probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. Many routing protocols have been developed for WSNs. A great attention has been given to geographic routing protocols, which rely only on local knowledge of nodes to disseminate data towards the BS. In this paper, we propose a new energy efficient geographic routing protocol called Improved Energy-aware and delivery Guarantee Geographic Routing protocol (IEGGR). The proposed protocol exploits the positions of neighboring nodes, which are closest to the BS to forward packets through the shortest path in terms of energy consumption. IEGGR introduces a mechanism in order to forward packets efficiently around voids. IEGGR algorithm considers the WSN as a connected-graph and to route a packet from a source node to the BS, IEGGR tries making the locally optimal choice at each intermediate node with the hope of finding a global optimum path, which aims to minimize energy consumption. To find greedily the optimal path, each forwarding node exploits its neighbor positions that are closest to the BS in order to iteratively building the end-to-end optimal path. Simulation results show that IEGGR is efficient in energy management during packet forwarding.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications Software and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24138/JCOMSS-2020-0019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 2

Abstract

—Wireless Sensor Networks are a set of sensor nodes that probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. Many routing protocols have been developed for WSNs. A great attention has been given to geographic routing protocols, which rely only on local knowledge of nodes to disseminate data towards the BS. In this paper, we propose a new energy efficient geographic routing protocol called Improved Energy-aware and delivery Guarantee Geographic Routing protocol (IEGGR). The proposed protocol exploits the positions of neighboring nodes, which are closest to the BS to forward packets through the shortest path in terms of energy consumption. IEGGR introduces a mechanism in order to forward packets efficiently around voids. IEGGR algorithm considers the WSN as a connected-graph and to route a packet from a source node to the BS, IEGGR tries making the locally optimal choice at each intermediate node with the hope of finding a global optimum path, which aims to minimize energy consumption. To find greedily the optimal path, each forwarding node exploits its neighbor positions that are closest to the BS in order to iteratively building the end-to-end optimal path. Simulation results show that IEGGR is efficient in energy management during packet forwarding.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
IEGGR:改进的能源意识和交付保证地理路由
无线传感器网络是一组传感器节点,它们探测周围环境,并通过多跳路由将数据发送到基站(BS)进行处理。针对无线传感器网络,已经开发了许多路由协议。对地理路由协议给予了极大的关注,它仅依赖于节点的本地知识来向BS传播数据。本文提出了一种新的高能效地理路由协议——改进的能量感知和交付保证地理路由协议(IEGGR)。该协议利用最接近BS的相邻节点的位置,以能量消耗最短的路径转发数据包。IEGGR引入了一种机制,以便在空洞周围有效地转发数据包。IEGGR算法将WSN视为一个连通图,为了将数据包从源节点路由到BS, IEGGR在每个中间节点上尝试进行局部最优选择,以期找到一个以能量消耗最小为目标的全局最优路径。为了贪婪地寻找最优路径,每个转发节点利用最接近BS的邻居位置,迭代构建端到端的最优路径。仿真结果表明,IEGGR在报文转发过程中的能量管理是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Communications Software and Systems
Journal of Communications Software and Systems Engineering-Electrical and Electronic Engineering
CiteScore
2.00
自引率
14.30%
发文量
28
审稿时长
8 weeks
期刊最新文献
Assessment of Transmitted Power Density in the Planar Multilayer Tissue Model due to Radiation from Dipole Antenna Signature-based Tree for Finding Frequent Itemsets Friendy: A Deep Learning based Framework for Assisting in Young Autistic Children Psychotherapy Interventions Ensemble of Local Texture Descriptor for Accurate Breast Cancer Detection from Histopathologic Images Comparison of Similarity Measures for Trajectory Clustering - Aviation Use Case
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1