By Topic

A Message Processing Method for Top-k Query for Traffic Reduction in Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hagihara, R. ; Dept. of Multimedia Eng., Osaka Univ., Suita ; Shinohara, M. ; Hara, T. ; Nishio, S.

In ad hoc networks, to acquire only necessary data items, it is effective that each mobile node retrieves data items using a top-k query, in which data items are ordered by the score of a particular attribute, and the query-issuing mobile node acquires data items with the k highest scores. In this paper, we propose a message processing method for a top-k query for reducing traffic and keeping the accuracy of the query result, i.e., guaranteeing that data items with the k highest scores in the entire network are acquired. When a mobile node transmits query and reply messages, our method can be used to reduce candidates of data items included in the top-k result to prevent unnecessary data transmissions. Moreover, if a mobile node detects a disconnection of a radio link, it searches for an alternative path to transmit the reply message to the query-issuing node. We present simulation results to evaluate the performance of our proposed method.

Published in:

Mobile Data Management: Systems, Services and Middleware, 2009. MDM '09. Tenth International Conference on

Date of Conference:

18-20 May 2009