Efficient framework for processing top-k queries with replication in mobile ad hoc networks

Sábháilte in:
Sonraí bibleagrafaíochta
Foilsithe in:GeoInformatica vol. 23, no. 4 (Oct 2019), p. 591
Príomhchruthaitheoir: Sasaki, Yuya
Rannpháirtithe: Hara, Takahiro, Ishikawa, Yoshiharu
Foilsithe / Cruthaithe:
Springer Nature B.V.
Ábhair:
Rochtain ar líne:Citation/Abstract
Full Text - PDF
Clibeanna: Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!

MARC

LEADER 00000nab a2200000uu 4500
001 2224137626
003 UK-CbPIL
022 |a 1384-6175 
022 |a 1573-7624 
024 7 |a 10.1007/s10707-019-00363-0  |2 doi 
035 |a 2224137626 
045 2 |b d20191001  |b d20191031 
084 |a 108511  |2 nlm 
100 1 |a Sasaki, Yuya  |u Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 
245 1 |a Efficient framework for processing top-k queries with replication in mobile ad hoc networks 
260 |b Springer Nature B.V.  |c Oct 2019 
513 |a Journal Article 
520 3 |a This article addresses the top-k query processing problem on mobile ad hoc networks (MANETs). Top-k query processing is common to retrieve only highly important data items. However, methods for top-k query processing are not enough efficient and accurate in MANET environments. For improving the efficiency and accuracy, replication is a promising technique that each node in MANETs replicates data items retained by other nodes into its storage. Therefore, we fully combine the top-k query processing with data replication. We propose a framework that efficiently processes top-k queries based on a new replication strategy. We develop new replication strategy FReT (topology-Free Replication for Top-k query). FReT determines near-optimal allocations of replicas. It advantages efficient top-k query processing from limited search area without maintenance costs even if mobile nodes move. Our top-k query processing methods retrieve the exact answer with small overhead and delay by gradually increasing the search area based on FReT. We demonstrate, through extensive experiments, that FReT and query processing methods function well in terms of small delay and overhead without sacrificing exactness of the query result. 
653 |a Wireless networks 
653 |a Topology 
653 |a Maintenance costs 
653 |a Replication 
653 |a Delay 
653 |a Storage 
653 |a Fluorescence resonance energy transfer 
653 |a Data replication 
653 |a Allocations 
653 |a Nodes 
653 |a Queries 
653 |a Servers 
653 |a Query processing 
653 |a Mobile communication systems 
653 |a Mobile ad hoc networks 
653 |a Methods 
653 |a Economic 
700 1 |a Hara, Takahiro  |u Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 
700 1 |a Ishikawa, Yoshiharu  |u Graduate School of Informatics, Nagoya University, Nagoya, Japan 
773 0 |t GeoInformatica  |g vol. 23, no. 4 (Oct 2019), p. 591 
786 0 |d ProQuest  |t Science Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/2224137626/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/2224137626/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch