Improving fault tolerance and load balancing in Wireless Networks

S. Rathika
{"title":"Improving fault tolerance and load balancing in Wireless Networks","authors":"S. Rathika","doi":"10.1109/ICCTET.2013.6675969","DOIUrl":null,"url":null,"abstract":"In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that unifies modified GDMAC and FDCB protocols and uses CFSR for QoS routing. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in [1][2]GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachmentfrom its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. The DCA makes an assumption that the network topology does not change during the execution of the algorithm. To verify the performance of the system, the nodes were assigned weights which varied linearly with their speeds but with negative slope. Results proved that the number of updates required is smaller than the [3][4]Highest-Degree and Lowest-ID heuristics. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are wl to w4. Besides, it converts the clustering problem into an optimization problem since an objective function is formed.","PeriodicalId":242568,"journal":{"name":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Current Trends in Engineering and Technology (ICCTET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTET.2013.6675969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this Distributed Fault-Tolerant Quality of Wireless Networks approach they proposed EFDCB that unifies modified GDMAC and FDCB protocols and uses CFSR for QoS routing. Here in the proposed system, proposing the weighted clustering algorithm, leads to a high degree of stability in the network and improves the load balancing in [1][2]GDMAC. The load balancing is accomplished by determining a pre-defined threshold on the number of nodes that a clusterhead can cover ideally. This ensures that none of the clusterheads are overloaded at any instance of time. Moreover the stability can be accomplished by reducing the number of nodes detachmentfrom its current cluster and connect to another existing cluster. In this approach, each node is assigned weights (a real number above zero) based on its suitability of being a clusterhead. A node is chosen to be a clusterhead if its weight is higher than any of its neighbor's weight; otherwise, it joins a neighboring clusterhead. The smaller ID node id is chosen in case of a tie. The DCA makes an assumption that the network topology does not change during the execution of the algorithm. To verify the performance of the system, the nodes were assigned weights which varied linearly with their speeds but with negative slope. Results proved that the number of updates required is smaller than the [3][4]Highest-Degree and Lowest-ID heuristics. Since node weights were varied in each simulation cycle, computing the clusterheads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control. The Weighted Clustering Algorithm (WCA) takes the factors into consideration and makes the selection of clusterhead and maintenance of cluster more reasonable. The factors are node degree, distance summation to all its neighboring nodes, mobility and remaining battery power respectively. And their corresponding weights are wl to w4. Besides, it converts the clustering problem into an optimization problem since an objective function is formed.
提高无线网络的容错性和负载均衡
在这种分布式无线网络容错质量方法中,他们提出了EFDCB,该方法统一了修改后的GDMAC和FDCB协议,并使用CFSR进行QoS路由。在本文系统中,提出了加权聚类算法,使得网络高度稳定,并改善了[1][2]GDMAC的负载均衡。负载平衡是通过确定集群头可以理想覆盖的节点数量的预定义阈值来实现的。这可确保在任何时间实例中都没有集群头过载。此外,稳定性可以通过减少从当前集群分离并连接到另一个现有集群的节点数量来实现。在这种方法中,每个节点根据其作为簇头的适用性分配权重(一个大于零的实数)。如果一个节点的权值高于它的任何邻居的权值,则该节点被选为簇头;否则,它将加入相邻的簇头。如果是平局,则选择较小的ID节点ID。DCA假设网络拓扑在算法执行过程中不会发生变化。为了验证系统的性能,节点被赋予了随其速度线性变化但斜率为负的权重。结果证明,所需的更新次数小于[3][4]的最高度和最低id启发式。由于节点权重在每个模拟周期中都是不同的,因此计算簇头变得非常昂贵,并且没有对吞吐量和功率控制等系统参数进行优化。加权聚类算法(WCA)考虑了这些因素,使得簇头的选择和簇的维护更加合理。影响因素分别为节点度、到所有相邻节点的距离和、机动性和电池剩余电量。它们对应的权值是wl到w4。同时,通过形成目标函数,将聚类问题转化为优化问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信