Research Article

Efficient Multidimensional Top- Query Processing in Wireless Multihop Networks

Algorithm 4

Handling query message, .
(1)if   receives for the first time  then
(2)  parent .sedner_id
(3)  Set F by Algorithm 3
(4)  threshold ..score //
(5)  if    then
(6)    CL←
(7)    for   where .next_node   do
(8)      CLCL.CH
(9)    AT
(10)     for   RoutingTable.entry  do
(11)       if  .CH is not included in CL  and
(12)       .next_node is within from   then
(13)         ATAT.CH, .next_node}
(14)     if    then
(15)       
(16)       Send to nodes included in AT as next_node
(17)     else
(18)       LeafFlag 1
(19)       Perform Algorithm 5
(20)   if    then
(21)     Reply data whose score is not more than threshold to parent