An optimal weighted cluster based routing protocol for MANET

Aswathy P. Sreevatsan, Diya Thomas
{"title":"An optimal weighted cluster based routing protocol for MANET","authors":"Aswathy P. Sreevatsan, Diya Thomas","doi":"10.1109/SAPIENCE.2016.7684122","DOIUrl":null,"url":null,"abstract":"A MANET is an ad hoc network that can change locations and configure itself dynamically. The link breakage between the nodes due to their movement makes the routing in MANET a difficult process. Grouping the nodes into different clusters can make the task of routing in the network easier. A cluster head is a node present in the geographical region of the cluster and also takes care of the routing and allocation of resources for the cluster members. Nodes register themselves with the cluster head to become members of the cluster. Most clustering algorithms take into account only one factor for clustering. The weighted clustering algorithm takes into account a number of factors such as mobility, degree, battery power and distance to neighbors for clustering process. After clustering the path between any two nodes consists of only clusterheads and gateways of the clusters in the path. This leads to long lived paths between any two nodes. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence reclustering and reconfiguration of the system is often unavoidable. However, it is important to keep the topology stable as long as possible. The clustering algorithm can cooperate with routing algorithm in order to find routes between two nodes. This work mainly consist of three phases. The first phase consist of cleansing the network, which includes identifying the malicious nodes. The second phase consist of the weighted clustering of the network which incorporates a new reclustering condition known as stability factor. The third phase consist of a fuzzy method to choose the best path among the paths available for routing based on the residual energy and mobility of the nodes in the paths.","PeriodicalId":340137,"journal":{"name":"2016 International Conference on Data Mining and Advanced Computing (SAPIENCE)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Data Mining and Advanced Computing (SAPIENCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAPIENCE.2016.7684122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

A MANET is an ad hoc network that can change locations and configure itself dynamically. The link breakage between the nodes due to their movement makes the routing in MANET a difficult process. Grouping the nodes into different clusters can make the task of routing in the network easier. A cluster head is a node present in the geographical region of the cluster and also takes care of the routing and allocation of resources for the cluster members. Nodes register themselves with the cluster head to become members of the cluster. Most clustering algorithms take into account only one factor for clustering. The weighted clustering algorithm takes into account a number of factors such as mobility, degree, battery power and distance to neighbors for clustering process. After clustering the path between any two nodes consists of only clusterheads and gateways of the clusters in the path. This leads to long lived paths between any two nodes. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence reclustering and reconfiguration of the system is often unavoidable. However, it is important to keep the topology stable as long as possible. The clustering algorithm can cooperate with routing algorithm in order to find routes between two nodes. This work mainly consist of three phases. The first phase consist of cleansing the network, which includes identifying the malicious nodes. The second phase consist of the weighted clustering of the network which incorporates a new reclustering condition known as stability factor. The third phase consist of a fuzzy method to choose the best path among the paths available for routing based on the residual energy and mobility of the nodes in the paths.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于加权聚类的最优MANET路由协议
MANET是一种可以动态改变位置和配置自身的自组织网络。由于节点之间的移动而导致的链路中断,使得在MANET中路由的过程变得非常困难。将节点分组到不同的集群中可以简化网络中的路由任务。集群头是集群地理区域中的节点,它还负责集群成员的路由和资源分配。节点将自己注册到集群头以成为集群的成员。大多数聚类算法只考虑一个聚类因素。加权聚类算法在聚类过程中考虑了机动性、程度、电池电量和到邻居的距离等因素。聚类后,任意两个节点之间的路径仅由路径中集群的簇头和网关组成。这将导致任意两个节点之间的长存活路径。节点与集群之间的关联和分离会扰乱网络拓扑结构的稳定性,因此系统的重新聚类和重新配置往往是不可避免的。然而,尽可能长时间保持拓扑稳定是很重要的。聚类算法可以与路由算法协同查找两个节点之间的路由。本工作主要分为三个阶段。第一阶段包括清理网络,其中包括识别恶意节点。第二阶段包括网络的加权聚类,其中包含了一个新的重聚条件,称为稳定因子。第三阶段采用模糊方法,根据路径中节点的剩余能量和可迁移性,在可路由路径中选择最佳路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GP-GPU based high-performance test equipment for debugging radar digital units An efficient video Steganography technique for secured data transmission Modified autonomy oriented computing based network immunization by considering betweenness centrality Methods to detect different types of outliers A study of cloud computing environments for High Performance applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1