Browsing by Subject "Querying nodes"

Now showing items 1-4 of 4

    • Conference Object  

      ETC: Energy-driven tree construction in wireless sensor networks 

      Andreou, Panayiotis G.; Pamboris, Andreas; Zeinalipour-Yazdi, Constantinos D.; Chrysanthis, Panos K.; Samaras, George S. (2009)
      Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying node. Predominant data acquisition systems ...
    • Article  

      Optimized query routing trees for wireless sensor networks 

      Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Pamboris, Andreas; Chrysanthis, Panos K.; Samaras, George S. (2011)
      In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be ...
    • Conference Object  

      SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces 

      Costa, Constantinos; Laoudias, Christos; Zeinalipour-Yazdi, Constantinos D.; Gunopulos, Dimitrios (2011)
      In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participating users. Our framework, exploits opportunistic ...
    • Conference Object  

      The threshold join algorithm for top-k queries in distributed sensor networks 

      Zeinalipour-Yazdi, Constantinos D.; Vagena, Zografoula; Gunopulos, Dimitrios; Kalogeraki, Vana; Tsotras, Vassilis J.; Vlachos, Michail; Koudas, Nick; Srivastava, D. (2005)
      In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query is to find the k highest ranked answers ...