移动Ad-hoc网络中利用移动性的高效连接研究

Young-jun Oh, Kang-whan Lee
{"title":"移动Ad-hoc网络中利用移动性的高效连接研究","authors":"Young-jun Oh, Kang-whan Lee","doi":"10.14257/IJMUE.2014.9.12.02","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Networks. Existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. This proposed algorithm forms cluster formation using a range of direction and threshold of velocity by base-station, and we calculate exchange cluster head node probability using direction and velocity for maintaining cluster formation. DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes. In response to maintain cluster formation, we prove a continuous connection between nodes.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Study of Efficient Connection using Mobility Property in Mobile Ad-hoc Network\",\"authors\":\"Young-jun Oh, Kang-whan Lee\",\"doi\":\"10.14257/IJMUE.2014.9.12.02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Networks. Existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. This proposed algorithm forms cluster formation using a range of direction and threshold of velocity by base-station, and we calculate exchange cluster head node probability using direction and velocity for maintaining cluster formation. DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes. In response to maintain cluster formation, we prove a continuous connection between nodes.\",\"PeriodicalId\":162936,\"journal\":{\"name\":\"International Conference on Multimedia and Ubiquitous Engineering\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Multimedia and Ubiquitous Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14257/IJMUE.2014.9.12.02\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Multimedia and Ubiquitous Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14257/IJMUE.2014.9.12.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了上下文感知路由算法DDV(动态方向矢量)-跳算法在移动自组织网络。现有的MANET算法存在网络拓扑结构不动态和缺乏节点可扩展性的弱点。该算法利用基站的方向范围和速度阈值来形成簇,并利用方向和速度计算交换簇头节点概率以维持簇的形成。DDV算法基于簇头节点形成簇。仿真结果表明,无论拓扑结构如何变化,该方案都能保持适当数量的集群和集群成员。为了维持集群的形成,我们证明了节点之间的连续连接。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Study of Efficient Connection using Mobility Property in Mobile Ad-hoc Network
In this paper, we proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Networks. Existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. This proposed algorithm forms cluster formation using a range of direction and threshold of velocity by base-station, and we calculate exchange cluster head node probability using direction and velocity for maintaining cluster formation. DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes. In response to maintain cluster formation, we prove a continuous connection between nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信