Energy-Efficient Data Aggregation Protocol for Location-Aware Wireless Sensor Networks

Hong Min, Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong
{"title":"Energy-Efficient Data Aggregation Protocol for Location-Aware Wireless Sensor Networks","authors":"Hong Min, Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong","doi":"10.1109/ISPA.2008.38","DOIUrl":null,"url":null,"abstract":"The energy is the most critical resource in wireless sensor networks. Many energy efficient techniques have been studied especially in communication protocol. Among these protocols, PEGASIS proposed by Lindsey is the most superior interms of energy efficiency. In PEGASIS, all sensor nodes aggregate and transmit data along the single chain. However, this single chain causes some problems such as delay, unexpected long transmission and non-directional transmission to the sink. To resolve delay problem, PEGASIS cuts the chain into several chains. In this way, the delay can be decreased but there is new problem, wireless interference. In this paper, we propose a new chain construction algorithm to resolve above problems. The proposed algorithm minimizes the delay without the wireless interferences and maximizes the energy efficiency by removing the non-directional transmission when transmitting packets to the sink node on wireless sensor networks. Our simulation results show that our proposed algorithm can minimize the delay without expense of energy consumption.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2008.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The energy is the most critical resource in wireless sensor networks. Many energy efficient techniques have been studied especially in communication protocol. Among these protocols, PEGASIS proposed by Lindsey is the most superior interms of energy efficiency. In PEGASIS, all sensor nodes aggregate and transmit data along the single chain. However, this single chain causes some problems such as delay, unexpected long transmission and non-directional transmission to the sink. To resolve delay problem, PEGASIS cuts the chain into several chains. In this way, the delay can be decreased but there is new problem, wireless interference. In this paper, we propose a new chain construction algorithm to resolve above problems. The proposed algorithm minimizes the delay without the wireless interferences and maximizes the energy efficiency by removing the non-directional transmission when transmitting packets to the sink node on wireless sensor networks. Our simulation results show that our proposed algorithm can minimize the delay without expense of energy consumption.
位置感知无线传感器网络的高能效数据聚合协议
在无线传感器网络中,能量是最关键的资源。人们研究了许多节能技术,特别是在通信协议方面。在这些协议中,由Lindsey提出的PEGASIS是最优越的能源效率条款。在PEGASIS中,所有传感器节点沿着单链聚合和传输数据。但是,这种单链会造成一些问题,如延迟、意外的长传输和向sink的非定向传输。为了解决延迟问题,PEGASIS将链切割成几条链。这样可以减少延迟,但也会产生新的问题,即无线干扰。本文提出了一种新的链构建算法来解决上述问题。该算法消除了无线传感器网络向汇聚节点传输数据包时的非定向传输,在不受无线干扰的情况下实现了时延最小化和能量效率最大化。仿真结果表明,该算法可以在不消耗能量的情况下使延迟最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信