EAREC:传感器网络的能量感知路由和高效聚类

A. Eimon, C. Hong, T. Suda
{"title":"EAREC:传感器网络的能量感知路由和高效聚类","authors":"A. Eimon, C. Hong, T. Suda","doi":"10.1109/CCNC.2006.1593041","DOIUrl":null,"url":null,"abstract":"Energy efficiency is one of the most challenging issues in wireless sensor network as the sensors have to serve unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and awake and thus saves energy. Passive clustering is less computational and light weight. In cluster based approach, cluster heads and gateways have to have maximum energy to be awaken for all the times. Existing passive clustering algorithm uses first declaration method without any priority generates severe collisions in the network and form the clusters very dense with large amount of overlapping regions. This results increased number of gateways. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation. More -over, our proposed solution finds the optimum path between sources and sinks using the tiny cache memory of the intermediate nodes. Simulation result shows that EAREC saves significant amount of energy and at the same time keeps the delay and success rate satisfactory.","PeriodicalId":194551,"journal":{"name":"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"EAREC: energy aware routing with efficient clustering for sensor networks\",\"authors\":\"A. Eimon, C. Hong, T. Suda\",\"doi\":\"10.1109/CCNC.2006.1593041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy efficiency is one of the most challenging issues in wireless sensor network as the sensors have to serve unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and awake and thus saves energy. Passive clustering is less computational and light weight. In cluster based approach, cluster heads and gateways have to have maximum energy to be awaken for all the times. Existing passive clustering algorithm uses first declaration method without any priority generates severe collisions in the network and form the clusters very dense with large amount of overlapping regions. This results increased number of gateways. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation. More -over, our proposed solution finds the optimum path between sources and sinks using the tiny cache memory of the intermediate nodes. Simulation result shows that EAREC saves significant amount of energy and at the same time keeps the delay and success rate satisfactory.\",\"PeriodicalId\":194551,\"journal\":{\"name\":\"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC.2006.1593041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2006.1593041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

由于传感器必须在无人值守的情况下服务,因此无线传感器网络的能源效率是最具挑战性的问题之一。基于集群的通信可以减少网络上的流量,并为其他传感器提供周期性睡眠和唤醒的机会,从而节省能源。被动聚类计算量少,重量轻。在基于集群的方法中,集群头和网关必须始终具有最大的能量来被唤醒。现有的被动聚类算法采用无优先级的首次声明方法,在网络中产生严重的碰撞,形成的聚类非常密集,有大量的重叠区域。这导致网关数量增加。我们对现有的被动聚类算法进行了一些改进,以延长网络的生命周期,更好地形成簇。此外,我们提出的解决方案利用中间节点的微小缓存内存找到源和汇之间的最优路径。仿真结果表明,该算法在节省大量能量的同时,保持了令人满意的延迟和成功率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
EAREC: energy aware routing with efficient clustering for sensor networks
Energy efficiency is one of the most challenging issues in wireless sensor network as the sensors have to serve unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and awake and thus saves energy. Passive clustering is less computational and light weight. In cluster based approach, cluster heads and gateways have to have maximum energy to be awaken for all the times. Existing passive clustering algorithm uses first declaration method without any priority generates severe collisions in the network and form the clusters very dense with large amount of overlapping regions. This results increased number of gateways. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation. More -over, our proposed solution finds the optimum path between sources and sinks using the tiny cache memory of the intermediate nodes. Simulation result shows that EAREC saves significant amount of energy and at the same time keeps the delay and success rate satisfactory.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信