By Topic

Query slipping prevention for trajectory-based matchmaking service in wireless sensor 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)
Junseok Park ; Post-PC Res. Group, ETRI, Daejeon, South Korea ; Yeonghwan Tscha ; Kyoon-Ha Lee ; Caglayan, M.U.

We consider query slipping and its prevention in wireless sensor networks. The problem happens when a query propagating along a subscribe trajectory moves through a publish trajectory without obtaining the desired information, even though the two trajectories intersect geometrically. There follows resubmission of the query or initiation of another subscribe trajectory. Thus, query slipping results in considerable time delay and, in the worst case, looping in the trajectory or query flooding the network. We address the problem formally and suggest a solution. First, the area where nodes are distributed is logically partitioned into smaller grids, and a grid-based next-hop selection algorithm is proposed. The algorithm not only attempts to make the trajectory straight but also considers the nodal density of recipient nodes and the seamless grid-by-grid multicast. We show that publishing and subscribing using the algorithm eventually eliminates the possibility of slipping. It turns out that our approach dissipates less power at neighbor nodes, compared to a non grid-based method, such as greedy forwarding.

Published in:

Communications, 2005. ICC 2005. 2005 IEEE International Conference on  (Volume:5 )

Date of Conference:

16-20 May 2005