Mildred M. Caballeros Morales, Rim Haw, Jun Lee, C. Hong
{"title":"一种高效的基于目的地的车载网络数据管理策略","authors":"Mildred M. Caballeros Morales, Rim Haw, Jun Lee, C. Hong","doi":"10.1109/ITST.2011.6060089","DOIUrl":null,"url":null,"abstract":"The Vehicular Ad hoc Network (VANET) takes the advantage of the relative mobility of the vehicles to opportunistically share dynamic information when they meet, aiming to avoid accidents and traffic jams, get local information of the nearby places, enjoy entertainment applications among others. However, the shared information must be handled properly, saving bandwidth and tackling the unnecessary duplication of data, preventing the scalability problem and congestion. The current solutions of these problems incorporate the concept of Relevance to share the information in a clever way but they do not exploit the advantage of knowing the destination of the vehicles and context-aware services to follow behavior patterns. Therefore, we propose an efficient destination-based data management policy, which follows the vehicular behavior and context to determine the relevance or importance of the information using a publisher/subscriber model and cluster-based dissemination. In order to demonstrate the feasibility of the proposal we implemented sets of simulation in which the results reported an outstanding performance in terms of congestion and delivery ratio.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An efficient destination-based data management policy for vehicular networks\",\"authors\":\"Mildred M. Caballeros Morales, Rim Haw, Jun Lee, C. Hong\",\"doi\":\"10.1109/ITST.2011.6060089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Vehicular Ad hoc Network (VANET) takes the advantage of the relative mobility of the vehicles to opportunistically share dynamic information when they meet, aiming to avoid accidents and traffic jams, get local information of the nearby places, enjoy entertainment applications among others. However, the shared information must be handled properly, saving bandwidth and tackling the unnecessary duplication of data, preventing the scalability problem and congestion. The current solutions of these problems incorporate the concept of Relevance to share the information in a clever way but they do not exploit the advantage of knowing the destination of the vehicles and context-aware services to follow behavior patterns. Therefore, we propose an efficient destination-based data management policy, which follows the vehicular behavior and context to determine the relevance or importance of the information using a publisher/subscriber model and cluster-based dissemination. In order to demonstrate the feasibility of the proposal we implemented sets of simulation in which the results reported an outstanding performance in terms of congestion and delivery ratio.\",\"PeriodicalId\":220290,\"journal\":{\"name\":\"2011 11th International Conference on ITS Telecommunications\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 11th International Conference on ITS Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITST.2011.6060089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Conference on ITS Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2011.6060089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
车辆自组织网络(Vehicular Ad hoc Network, VANET)利用车辆的相对移动性,在相遇时机会主义地共享动态信息,旨在避免事故和交通堵塞,获取附近地方的本地信息,享受娱乐应用等。但是,必须对共享信息进行适当的处理,节省带宽,解决不必要的数据重复,防止可扩展性问题和拥塞问题。这些问题的当前解决方案包含了相关性的概念,以一种巧妙的方式共享信息,但它们没有利用了解车辆目的地和上下文感知服务的优势来遵循行为模式。因此,我们提出了一种高效的基于目的地的数据管理策略,该策略遵循车辆行为和上下文,使用发布者/订阅者模型和基于集群的传播来确定信息的相关性或重要性。为了证明该建议的可行性,我们实施了一组仿真,其中结果报告了在拥塞和交付率方面的出色性能。
An efficient destination-based data management policy for vehicular networks
The Vehicular Ad hoc Network (VANET) takes the advantage of the relative mobility of the vehicles to opportunistically share dynamic information when they meet, aiming to avoid accidents and traffic jams, get local information of the nearby places, enjoy entertainment applications among others. However, the shared information must be handled properly, saving bandwidth and tackling the unnecessary duplication of data, preventing the scalability problem and congestion. The current solutions of these problems incorporate the concept of Relevance to share the information in a clever way but they do not exploit the advantage of knowing the destination of the vehicles and context-aware services to follow behavior patterns. Therefore, we propose an efficient destination-based data management policy, which follows the vehicular behavior and context to determine the relevance or importance of the information using a publisher/subscriber model and cluster-based dissemination. In order to demonstrate the feasibility of the proposal we implemented sets of simulation in which the results reported an outstanding performance in terms of congestion and delivery ratio.