manet中top-k查询处理的研究

T. Mohanapriya, S. Ranganathan, S. Karthik
{"title":"manet中top-k查询处理的研究","authors":"T. Mohanapriya, S. Ranganathan, S. Karthik","doi":"10.1109/ISCO.2017.7856040","DOIUrl":null,"url":null,"abstract":"In mobile ad hoc networks (MANET), each node can move freely and communicate with each other in the network. The main challenges are to reduce the traffic that occurs when large amount of data is transmitted and to provide the high accuracy of transmitted data. To acquire only necessary data items, each mobile node can effectively retrieve data items using a top-k query. However, the transmission of query messages and replies from each mobile node will cause high traffic. Some techniques are provided to reduce the number of candidates in the top-k query. This paper deals with the process of top-k query, routing methods and the mechanisms that are proposed to overcome the challenges.","PeriodicalId":321113,"journal":{"name":"2017 11th International Conference on Intelligent Systems and Control (ISCO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A survey on top-k query processing in MANETs\",\"authors\":\"T. Mohanapriya, S. Ranganathan, S. Karthik\",\"doi\":\"10.1109/ISCO.2017.7856040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In mobile ad hoc networks (MANET), each node can move freely and communicate with each other in the network. The main challenges are to reduce the traffic that occurs when large amount of data is transmitted and to provide the high accuracy of transmitted data. To acquire only necessary data items, each mobile node can effectively retrieve data items using a top-k query. However, the transmission of query messages and replies from each mobile node will cause high traffic. Some techniques are provided to reduce the number of candidates in the top-k query. This paper deals with the process of top-k query, routing methods and the mechanisms that are proposed to overcome the challenges.\",\"PeriodicalId\":321113,\"journal\":{\"name\":\"2017 11th International Conference on Intelligent Systems and Control (ISCO)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 11th International Conference on Intelligent Systems and Control (ISCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCO.2017.7856040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 11th International Conference on Intelligent Systems and Control (ISCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCO.2017.7856040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在移动自组织网络(MANET)中,每个节点都可以在网络中自由移动并相互通信。主要的挑战是减少在传输大量数据时发生的流量,并提供传输数据的高精度。为了只获取必要的数据项,每个移动节点可以使用top-k查询有效地检索数据项。但是,从每个移动节点发送查询消息和应答会造成很大的流量。提供了一些技术来减少top-k查询中的候选数。本文讨论了top-k查询的过程、路由方法和克服挑战的机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A survey on top-k query processing in MANETs
In mobile ad hoc networks (MANET), each node can move freely and communicate with each other in the network. The main challenges are to reduce the traffic that occurs when large amount of data is transmitted and to provide the high accuracy of transmitted data. To acquire only necessary data items, each mobile node can effectively retrieve data items using a top-k query. However, the transmission of query messages and replies from each mobile node will cause high traffic. Some techniques are provided to reduce the number of candidates in the top-k query. This paper deals with the process of top-k query, routing methods and the mechanisms that are proposed to overcome the challenges.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信