Energy efficient and congestion aware routing algorithms for Wireless Sensor Networks connected as Hypercube

A. Mohajerzadeh, M. Yaghmaee, Zahra Eskandari, Hossein Deldari
{"title":"Energy efficient and congestion aware routing algorithms for Wireless Sensor Networks connected as Hypercube","authors":"A. Mohajerzadeh, M. Yaghmaee, Zahra Eskandari, Hossein Deldari","doi":"10.1109/ISTEL.2008.4651322","DOIUrl":null,"url":null,"abstract":"Wireless Sensor Networks (WSN) have been noticed and researched nowadays. These new type of networks have unique characteristics. WSNs have different limitations such as computational power, storage capacity, energy source and etc. The main constraint of wireless sensor networks is energy. The energy source of sensor nodes is limited and not rechargeable. Therefore, optimizing consumption of energy is essential for WSNs protocols. Hypercube topology is very popular in distributed environments. In last few years, many different topology specific routing algorithms have been designed for wireless sensor networks, but to the best of our knowledge, none of them consider hypercube as their topology. In this paper, different routing algorithms are proposed for WSN with hypercube topology. The performance of all proposed routing algorithms is evaluated, and the best algorithm which can provide more fairness is introduced. Simulation results which are represented in last section of this paper are the base of our conclusions. The main goal of this paper is to find a fair energy aware routing algorithm for wireless sensor network connected as hypercube.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2008.4651322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Wireless Sensor Networks (WSN) have been noticed and researched nowadays. These new type of networks have unique characteristics. WSNs have different limitations such as computational power, storage capacity, energy source and etc. The main constraint of wireless sensor networks is energy. The energy source of sensor nodes is limited and not rechargeable. Therefore, optimizing consumption of energy is essential for WSNs protocols. Hypercube topology is very popular in distributed environments. In last few years, many different topology specific routing algorithms have been designed for wireless sensor networks, but to the best of our knowledge, none of them consider hypercube as their topology. In this paper, different routing algorithms are proposed for WSN with hypercube topology. The performance of all proposed routing algorithms is evaluated, and the best algorithm which can provide more fairness is introduced. Simulation results which are represented in last section of this paper are the base of our conclusions. The main goal of this paper is to find a fair energy aware routing algorithm for wireless sensor network connected as hypercube.
连接为Hypercube的无线传感器网络的节能和拥塞感知路由算法
无线传感器网络(WSN)是目前人们关注和研究的热点。这些新型网络具有独特的特点。无线传感器网络具有不同的局限性,如计算能力、存储容量、能量来源等。无线传感器网络的主要制约因素是能量。传感器节点的能量来源有限,不能充电。因此,优化能量消耗对无线传感器网络协议至关重要。超立方体拓扑在分布式环境中非常流行。在过去的几年中,针对无线传感器网络设计了许多不同的拓扑特定路由算法,但据我们所知,它们都没有将超立方体作为它们的拓扑。本文针对具有超立方体拓扑结构的无线传感器网络,提出了不同的路由算法。对所提出的路由算法的性能进行了评价,并给出了能够提供更高公平性的最佳算法。本文最后一节给出的仿真结果是本文结论的基础。本文的主要目标是为超立方体连接的无线传感器网络寻找一种公平的能量感知路由算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信