TIME: Supporting topology independent mobility with energy efficient routing in WSNs

S. P. Nayak, K. Dhal, S. C. Rai, S. Pradhan
{"title":"TIME: Supporting topology independent mobility with energy efficient routing in WSNs","authors":"S. P. Nayak, K. Dhal, S. C. Rai, S. Pradhan","doi":"10.1109/NGCT.2015.7375139","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks consist of small battery powered devices with limited energy resources. The small sensor nodes are usually inaccessible to the users due to their remote deployment. Non functioning of any sensor due to its loss of battery power not only deteriorates the network performance but also a challenging job for replacement of energy source. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. The efficiency of sensor networks strongly depends on the routing protocol used. Various clustering algorithms have been proposed in the literature to increase the lifetime of network. In all algorithms data processing is done at the cluster head (CH) which consumes large amount of energy because energy consumption depends upon the distance between the node and the base station (BS). In this paper, Low Energy Adaptive Clustering Hierarchy (LEACH) has been extended by considering the chaining system in different clusters. Our proposed model- Topology Independent Mobility with Energy Efficient Routing algorithm (TIME), reduces the distance between two consecutive nodes and node to base station by using multiple clusters. The Chain Monitor (CM) aggregates all the data of its own cluster and sends to the base station. The performance of TIME algorithm has been investigated by several simulations by considering uniform sensing range of the sensors. From the simulation results it has been observed that even with large sensing range of the sensors the performance of our model TIME is superior than LEACH. The important aspect about this model is achieving uniform energy efficiency of all the sensors in the network irrespective of topological variations, through multiple clustering technique.","PeriodicalId":216294,"journal":{"name":"2015 1st International Conference on Next Generation Computing Technologies (NGCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 1st International Conference on Next Generation Computing Technologies (NGCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGCT.2015.7375139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Wireless sensor networks consist of small battery powered devices with limited energy resources. The small sensor nodes are usually inaccessible to the users due to their remote deployment. Non functioning of any sensor due to its loss of battery power not only deteriorates the network performance but also a challenging job for replacement of energy source. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. The efficiency of sensor networks strongly depends on the routing protocol used. Various clustering algorithms have been proposed in the literature to increase the lifetime of network. In all algorithms data processing is done at the cluster head (CH) which consumes large amount of energy because energy consumption depends upon the distance between the node and the base station (BS). In this paper, Low Energy Adaptive Clustering Hierarchy (LEACH) has been extended by considering the chaining system in different clusters. Our proposed model- Topology Independent Mobility with Energy Efficient Routing algorithm (TIME), reduces the distance between two consecutive nodes and node to base station by using multiple clusters. The Chain Monitor (CM) aggregates all the data of its own cluster and sends to the base station. The performance of TIME algorithm has been investigated by several simulations by considering uniform sensing range of the sensors. From the simulation results it has been observed that even with large sensing range of the sensors the performance of our model TIME is superior than LEACH. The important aspect about this model is achieving uniform energy efficiency of all the sensors in the network irrespective of topological variations, through multiple clustering technique.
TIME:支持无线传感器网络中具有节能路由的拓扑无关移动性
无线传感器网络由能量有限的小型电池供电设备组成。小型传感器节点由于远程部署,用户通常无法访问。任何传感器由于电池电量的损失而无法正常工作,不仅会降低网络的性能,而且会给能源的替换带来挑战。因此,能源效率是一个关键的设计问题,需要提高,以提高网络的寿命。传感器网络的效率很大程度上取决于所使用的路由协议。文献中提出了各种聚类算法来延长网络的生存期。在所有算法中,数据处理都是在簇头(CH)进行的,由于能量消耗取决于节点与基站(BS)之间的距离,因此消耗大量的能量。本文对低能量自适应聚类层次(LEACH)进行了扩展,考虑了不同聚类中的连锁系统。我们提出的拓扑无关移动与节能路由算法(TIME)模型,通过使用多个集群减少两个连续节点之间的距离和节点到基站的距离。Chain Monitor (CM)聚合自己集群的所有数据并发送到基站。在考虑传感器感知范围均匀的情况下,对TIME算法的性能进行了仿真研究。从仿真结果可以看出,即使传感器的传感范围很大,我们的TIME模型的性能也优于LEACH。该模型的重要方面是通过多聚类技术实现网络中所有传感器的能量效率均匀化,而不受拓扑变化的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信