{"title":"基于复制策略的移动Ad Hoc网络Top-k查询处理","authors":"Yuya Sasaki, T. Hara, Y. Ishikawa","doi":"10.1109/MDM.2018.00039","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a method that fully combines top-k query processing with replication strategy in mobile ad hoc networks (MANETs). The goal is to acquire perfect accuracy of query results with a minimal overhead and delay. Currently, no replication strategy achieves efficient allocation of replicas for top-k queries, and no top-k query processing guarantees perfect accuracy of query results in MANETs. We propose a new replication strategy FReT (topology-Free Replication for Top-k query) and new top-k query processing methods. FReT advantages efficient top-k query processing from limited search area even if mobile nodes move. In our top-k query processing method, the search area gradually increases until receiving an exact answer. We demonstrate, through extensive simulations, that our approaches function well in terms of small delay and overhead.","PeriodicalId":205319,"journal":{"name":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Top-k Query Processing with Replication Strategy in Mobile Ad Hoc Networks\",\"authors\":\"Yuya Sasaki, T. Hara, Y. Ishikawa\",\"doi\":\"10.1109/MDM.2018.00039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a method that fully combines top-k query processing with replication strategy in mobile ad hoc networks (MANETs). The goal is to acquire perfect accuracy of query results with a minimal overhead and delay. Currently, no replication strategy achieves efficient allocation of replicas for top-k queries, and no top-k query processing guarantees perfect accuracy of query results in MANETs. We propose a new replication strategy FReT (topology-Free Replication for Top-k query) and new top-k query processing methods. FReT advantages efficient top-k query processing from limited search area even if mobile nodes move. In our top-k query processing method, the search area gradually increases until receiving an exact answer. We demonstrate, through extensive simulations, that our approaches function well in terms of small delay and overhead.\",\"PeriodicalId\":205319,\"journal\":{\"name\":\"2018 19th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 19th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2018.00039\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2018.00039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
在本文中,我们提出了一种在移动自组织网络(manet)中充分结合top-k查询处理和复制策略的方法。目标是以最小的开销和延迟获得查询结果的完美准确性。目前,没有复制策略能够实现top-k查询的高效副本分配,也没有top-k查询处理能够保证MANETs查询结果的完美准确性。我们提出了一种新的复制策略FReT(拓扑- free replication for Top-k query)和新的Top-k查询处理方法。即使移动节点移动,FReT也能在有限的搜索区域内进行高效的top-k查询处理。在我们的top-k查询处理方法中,搜索区域逐渐增加,直到得到确切的答案。我们通过大量的模拟证明,我们的方法在小延迟和开销方面运行良好。
Top-k Query Processing with Replication Strategy in Mobile Ad Hoc Networks
In this paper, we propose a method that fully combines top-k query processing with replication strategy in mobile ad hoc networks (MANETs). The goal is to acquire perfect accuracy of query results with a minimal overhead and delay. Currently, no replication strategy achieves efficient allocation of replicas for top-k queries, and no top-k query processing guarantees perfect accuracy of query results in MANETs. We propose a new replication strategy FReT (topology-Free Replication for Top-k query) and new top-k query processing methods. FReT advantages efficient top-k query processing from limited search area even if mobile nodes move. In our top-k query processing method, the search area gradually increases until receiving an exact answer. We demonstrate, through extensive simulations, that our approaches function well in terms of small delay and overhead.