Improvement of Connectivity in Mobile Ad Hoc Networks by Adding Static Nodes Based on a Realistic Mobility Model

Morteza Romoozi, S. M. Vahidipour, H. Babaei
{"title":"Improvement of Connectivity in Mobile Ad Hoc Networks by Adding Static Nodes Based on a Realistic Mobility Model","authors":"Morteza Romoozi, S. M. Vahidipour, H. Babaei","doi":"10.1109/ICMV.2009.56","DOIUrl":null,"url":null,"abstract":"One of the ad-hoc networks challenges is the connectivity problem coming from changeable and dynamic topology of networks nodes. According to most of researches done on this problem, one of the solutions is adding static nodes in some points in network environment; and many attempts have been made to find these points by using different ways. However, in most of these studies no attention has been paid to network mobility model or the problem has been solved based on unrealistic mobility model such as Random waypoint. Thus previous works are not applicable in reality. This article presents an algorithm for adding static nodes which are located in best points of network to improve connectivity. This algorithm is based on realistic mobility model that can model both environmental obstacles and pathways, and furthermore can describe the realistic movement pattern of the nodes. Proposed algorithm uses Genetic algorithm to find the best points. Since simulation operation for evaluation of solution is time-consuming, this algorithm is independent from simulation operation and uses Voronoi diagram.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Second International Conference on Machine Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMV.2009.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

One of the ad-hoc networks challenges is the connectivity problem coming from changeable and dynamic topology of networks nodes. According to most of researches done on this problem, one of the solutions is adding static nodes in some points in network environment; and many attempts have been made to find these points by using different ways. However, in most of these studies no attention has been paid to network mobility model or the problem has been solved based on unrealistic mobility model such as Random waypoint. Thus previous works are not applicable in reality. This article presents an algorithm for adding static nodes which are located in best points of network to improve connectivity. This algorithm is based on realistic mobility model that can model both environmental obstacles and pathways, and furthermore can describe the realistic movement pattern of the nodes. Proposed algorithm uses Genetic algorithm to find the best points. Since simulation operation for evaluation of solution is time-consuming, this algorithm is independent from simulation operation and uses Voronoi diagram.
基于现实移动模型的增加静态节点改善移动Ad Hoc网络连通性
网络节点多变的动态拓扑结构带来的连通性问题是自组织网络面临的挑战之一。根据对该问题的大多数研究,解决方案之一是在网络环境的某些点上增加静态节点;许多人尝试用不同的方法来找到这些点。然而,在这些研究中,大多没有关注网络的移动性模型,或者基于随机路径点等不切实际的移动性模型来解决问题。因此,以前的作品在现实中并不适用。本文提出了一种增加静态节点的算法,这些静态节点位于网络的最佳点,以提高网络的连通性。该算法基于真实移动模型,既能对环境障碍物和路径进行建模,又能描述节点的真实运动模式。该算法采用遗传算法寻找最优点。由于模拟运算求解耗时长,该算法独立于模拟运算,采用Voronoi图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信