Optimal Load Balanced Clustering in Two-Tiered Sensor Networks

A. Bari, A. Jaekel, S. Bandyopadhyay
{"title":"Optimal Load Balanced Clustering in Two-Tiered Sensor Networks","authors":"A. Bari, A. Jaekel, S. Bandyopadhyay","doi":"10.1109/BROADNETS.2006.4374424","DOIUrl":null,"url":null,"abstract":"In hierarchical sensor networks, sensor nodes are arranged in clusters, and higher-powered relay nodes can be used as cluster heads. The scalability and the lifetime of sensor networks are affected by the limited transmission range and battery power of the nodes. Proper techniques for assigning sensor nodes to clusters have been shown to improve the lifetime of the network. Previous approaches to clustering focus on different heuristics to achieve load balancing. In this paper, we have proposed two fast and efficient integer linear program (ILP) formulations for assigning sensor nodes to clusters in a two-tiered network, where the relay nodes are used as cluster heads. The first is for single hop routing and the second is a generalized formulation that can be used with any multi-hop routing strategy. The objective, in both cases, is to maximize the lifetime of the relay node network. We have tested our formulations with a number of different routing strategies, and for each case, we have compared our formulation to several existing heuristics for clustering. The results demonstrate that our ILP's consistently outperform the heuristics and are fast enough to be used for practical networks with hundreds of sensor nodes.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 3rd International Conference on Broadband Communications, Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2006.4374424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

In hierarchical sensor networks, sensor nodes are arranged in clusters, and higher-powered relay nodes can be used as cluster heads. The scalability and the lifetime of sensor networks are affected by the limited transmission range and battery power of the nodes. Proper techniques for assigning sensor nodes to clusters have been shown to improve the lifetime of the network. Previous approaches to clustering focus on different heuristics to achieve load balancing. In this paper, we have proposed two fast and efficient integer linear program (ILP) formulations for assigning sensor nodes to clusters in a two-tiered network, where the relay nodes are used as cluster heads. The first is for single hop routing and the second is a generalized formulation that can be used with any multi-hop routing strategy. The objective, in both cases, is to maximize the lifetime of the relay node network. We have tested our formulations with a number of different routing strategies, and for each case, we have compared our formulation to several existing heuristics for clustering. The results demonstrate that our ILP's consistently outperform the heuristics and are fast enough to be used for practical networks with hundreds of sensor nodes.
双层传感器网络的最优负载均衡聚类
在分层传感器网络中,传感器节点被安排在集群中,而功率更高的中继节点可以用作簇头。传感器网络的可扩展性和寿命受到节点有限的传输距离和电池电量的影响。将传感器节点分配到集群的适当技术已被证明可以改善网络的生存期。以前的聚类方法侧重于不同的启发式方法来实现负载平衡。在本文中,我们提出了两种快速有效的整数线性规划(ILP)公式,用于在两层网络中将传感器节点分配给集群,其中中继节点用作簇头。第一个是单跳路由,第二个是一个广义的公式,可用于任何多跳路由策略。在这两种情况下,目标都是最大化中继节点网络的生命周期。我们已经用许多不同的路由策略测试了我们的公式,对于每种情况,我们都将我们的公式与几种现有的聚类启发式方法进行了比较。结果表明,我们的ILP始终优于启发式算法,并且足够快,可以用于具有数百个传感器节点的实际网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信