Multiple base station placement with k-means Local+

Z. C. Taysi, M. A. Guvensan, A. Yavuz
{"title":"Multiple base station placement with k-means Local+","authors":"Z. C. Taysi, M. A. Guvensan, A. Yavuz","doi":"10.1109/SIU.2009.5136541","DOIUrl":null,"url":null,"abstract":"Sensor applications have many different constraints such as the network lifetime, the number of sensor nodes and base stations (BS). The main goal of the researchers is to maximize the network lifetime with minimum budget. BS positioning and the choice of routing algorithm are two important criteria in maximizing the lifetime. Many wireless sensor network (WSN) applications, like the intelligent agriculture, habitat and weather monitoring, are based on continuous data delivery model. In these applications, each sensor node generally collects data of the same size and periodically transfers this data to BS by multi-hop communication. To maximize the network lifetime of such applications, we propose a new BS placement algorithm for deploying multiple base stations, called k-means Local+ which provides up to 45% longer network lifetime than single k-means algroithm [1].","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE 17th Signal Processing and Communications Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2009.5136541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Sensor applications have many different constraints such as the network lifetime, the number of sensor nodes and base stations (BS). The main goal of the researchers is to maximize the network lifetime with minimum budget. BS positioning and the choice of routing algorithm are two important criteria in maximizing the lifetime. Many wireless sensor network (WSN) applications, like the intelligent agriculture, habitat and weather monitoring, are based on continuous data delivery model. In these applications, each sensor node generally collects data of the same size and periodically transfers this data to BS by multi-hop communication. To maximize the network lifetime of such applications, we propose a new BS placement algorithm for deploying multiple base stations, called k-means Local+ which provides up to 45% longer network lifetime than single k-means algroithm [1].
多个基站放置与k-means Local+
传感器应用有许多不同的限制,如网络寿命,传感器节点和基站(BS)的数量。研究人员的主要目标是以最小的预算最大化网络的生存期。BS的定位和路由算法的选择是使生存时间最大化的两个重要标准。许多无线传感器网络(WSN)应用,如智能农业、栖息地和天气监测,都是基于连续数据传输模型的。在这些应用中,每个传感器节点通常收集相同大小的数据,并通过多跳通信定期将这些数据传输给BS。为了最大限度地提高此类应用的网络寿命,我们提出了一种新的用于部署多个基站的BS放置算法,称为k-means Local+,它提供的网络寿命比单一k-means算法长45%[1]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信