Shortest Path Tree Scaling Hierarchical Power Efficient Routing for Wireless Sensor Networks

M. Shah, A. B. Dogar, G. Abbas
{"title":"Shortest Path Tree Scaling Hierarchical Power Efficient Routing for Wireless Sensor Networks","authors":"M. Shah, A. B. Dogar, G. Abbas","doi":"10.1109/ICET.2013.6743540","DOIUrl":null,"url":null,"abstract":"In the realm of Wireless Sensor Networks, one of the key challenges is to efficiently utilize energy of sensor nodes. A number of hierarchical routing protocols have been proposed to minimize energy utilization in WSNs. This paper presents a new technique called Shortest Path Tree Scaling Hierarchical Power Efficient Routing (SPTSHPER) protocol. SPTSHPER operates in two-phases; namely, zone setup phase and data communication phase. Dijkstra's algorithm is used to find the Shortest Path Trees rooted at a base station to all other cluster heads. Sensor data is transmitted to base station using the Shortest Path Trees. Simulation results demonstrate that SPTSHPER reasonably prolongs the network lifetime, reduces the number of transmissions, and minimizes energy consumption.","PeriodicalId":215372,"journal":{"name":"2013 IEEE 9th International Conference on Emerging Technologies (ICET)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 9th International Conference on Emerging Technologies (ICET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICET.2013.6743540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the realm of Wireless Sensor Networks, one of the key challenges is to efficiently utilize energy of sensor nodes. A number of hierarchical routing protocols have been proposed to minimize energy utilization in WSNs. This paper presents a new technique called Shortest Path Tree Scaling Hierarchical Power Efficient Routing (SPTSHPER) protocol. SPTSHPER operates in two-phases; namely, zone setup phase and data communication phase. Dijkstra's algorithm is used to find the Shortest Path Trees rooted at a base station to all other cluster heads. Sensor data is transmitted to base station using the Shortest Path Trees. Simulation results demonstrate that SPTSHPER reasonably prolongs the network lifetime, reduces the number of transmissions, and minimizes energy consumption.
无线传感器网络的最短路径树分级节能路由
在无线传感器网络领域,有效利用传感器节点的能量是一个关键的挑战。为了最大限度地减少无线传感器网络的能量消耗,已经提出了许多分层路由协议。本文提出了一种新的最短路径树缩放分层高效路由协议(SPTSHPER)。SPTSHPER分两阶段运行;即区域建立阶段和数据通信阶段。Dijkstra算法用于查找根在基站到所有其他簇头的最短路径树。传感器数据通过最短路径树传输到基站。仿真结果表明,SPTSHPER合理地延长了网络的生存期,减少了传输次数,最大限度地降低了能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信