基于VANET聚类路由算法中连通性维护的Petri网模型

Ahmed Louazani, L. Sekhri
{"title":"基于VANET聚类路由算法中连通性维护的Petri网模型","authors":"Ahmed Louazani, L. Sekhri","doi":"10.1109/ICAASE.2016.7843864","DOIUrl":null,"url":null,"abstract":"Recently, wireless communications technologies have invaded several daily life fields such as Vehicular Ad-hoc Networks (VANETs). VANET networks are characterized by their high mobility. Clustering seems to be as one of the control schemes used to make this global topology less dynamic. In this sight, our paper introduces a clustering mechanism based for connectivity maintenance in VANET AODV-CV. A formal model using time Petri net as a mathematical tool is presented to prove some protocol's properties.","PeriodicalId":407176,"journal":{"name":"2016 International Conference on Advanced Aspects of Software Engineering (ICAASE)","volume":"401 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Petri net model for connectivity maintenance in VANET clustering-based routing algorithm\",\"authors\":\"Ahmed Louazani, L. Sekhri\",\"doi\":\"10.1109/ICAASE.2016.7843864\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, wireless communications technologies have invaded several daily life fields such as Vehicular Ad-hoc Networks (VANETs). VANET networks are characterized by their high mobility. Clustering seems to be as one of the control schemes used to make this global topology less dynamic. In this sight, our paper introduces a clustering mechanism based for connectivity maintenance in VANET AODV-CV. A formal model using time Petri net as a mathematical tool is presented to prove some protocol's properties.\",\"PeriodicalId\":407176,\"journal\":{\"name\":\"2016 International Conference on Advanced Aspects of Software Engineering (ICAASE)\",\"volume\":\"401 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Advanced Aspects of Software Engineering (ICAASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAASE.2016.7843864\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Advanced Aspects of Software Engineering (ICAASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAASE.2016.7843864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

近年来,无线通信技术已经侵入了车载自组织网络(vanet)等日常生活的多个领域。VANET网络的特点是机动性高。聚类似乎是用来降低全局拓扑动态的一种控制方案。为此,本文在VANET AODV-CV中引入了一种基于集群的连接维护机制。提出了一个使用时间Petri网作为数学工具的形式化模型来证明协议的一些性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Petri net model for connectivity maintenance in VANET clustering-based routing algorithm
Recently, wireless communications technologies have invaded several daily life fields such as Vehicular Ad-hoc Networks (VANETs). VANET networks are characterized by their high mobility. Clustering seems to be as one of the control schemes used to make this global topology less dynamic. In this sight, our paper introduces a clustering mechanism based for connectivity maintenance in VANET AODV-CV. A formal model using time Petri net as a mathematical tool is presented to prove some protocol's properties.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信