41
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Random and Directed Walk-Based Top- k Queries in Wireless Sensor Networks

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In wireless sensor networks, filter-based top- k query approaches are the state-of-the-art solutions and have been extensively researched in the literature, however, they are very sensitive to the network parameters, including the size of the network, dynamics of the sensors’ readings and declines in the overall range of all the readings. In this work, a random walk-based top- k query approach called RWTQ and a directed walk-based top- k query approach called DWTQ are proposed. At the beginning of a top- k query, one or several tokens are sent to the specific node(s) in the network by the base station. Then, each token walks in the network independently to record and process the readings in a random or directed way. A strategy of choosing the “right” way in DWTQ is carefully designed for the token(s) to arrive at the high-value regions as soon as possible. When designing the walking strategy for DWTQ, the spatial correlations of the readings are also considered. Theoretical analysis and simulation results indicate that RWTQ and DWTQ both are very robust against these parameters discussed previously. In addition, DWTQ outperforms TAG, FILA and EXTOK in transmission cost, energy consumption and network lifetime.

          Related collections

          Most cited references25

          • Record: found
          • Abstract: not found
          • Article: not found

          An application-specific protocol architecture for wireless microsensor networks

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            TAG

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The Clustered AGgregation (CAG) technique leveraging spatial and temporal correlations in wireless sensor networks

                Bookmark

                Author and article information

                Contributors
                Role: Academic Editor
                Journal
                Sensors (Basel)
                Sensors (Basel)
                sensors
                Sensors (Basel, Switzerland)
                MDPI
                1424-8220
                26 May 2015
                June 2015
                : 15
                : 6
                : 12273-12298
                Affiliations
                School of Electronic and Information Engineering, Key Laboratory of Communication and Information Systems, Beijing Municipal Commission of Education, Beijing Jiaotong University, Beijing 100044, China; E-Mail: 14111005@ 123456bjtu.edu.cn
                Author notes
                [* ]Author to whom correspondence should be addressed; E-Mail: liuyun@ 123456bjtu.edu.cn ; Tel./Fax: +86-10-5168-4227.
                Article
                sensors-15-12273
                10.3390/s150612273
                4507629
                26016914
                37afc4de-8852-42a0-9457-d38ff909184e
                © 2015 by the authors; licensee MDPI, Basel, Switzerland.

                This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license ( http://creativecommons.org/licenses/by/4.0/).

                History
                : 10 March 2015
                : 13 May 2015
                Categories
                Article

                Biomedical engineering
                wireless sensor networks,top-k query,random walk,directed walk,energy efficiency

                Comments

                Comment on this article