Improved structures for data collection in static and mobile wireless sensor networks

Jon Crowcroft, Michael Segal, Liron Levin

    Research output: Contribution to journalArticlepeer-review

    Abstract

    In this paper we consider the problem of efficient data gathering in sensor networks for arbitrary sensor node deployments. The efficiency of the solution is measured by a number of criteria: total energy consumption, total transport capacity, latency and quality of the transmissions. We present a number of different constructions with various tradeoffs between aforementioned parameters. We provide theoretical performance analysis for our approaches, present their distributed implementation and discuss the different aspects of using each. We show that in many cases our output-sensitive approximation solution performs better than the currently known best results for sensor networks. We also consider our problem under the mobile sensor nodes environment, when the sensors have no information about each other. The only information a single sensor holds is its current location and future mobility plan. Our simulation results validate the theoretical findings.

    Original languageAmerican English
    Pages (from-to)233-256
    Number of pages24
    JournalJournal of Heuristics
    Volume21
    Issue number2
    DOIs
    StatePublished - 1 Apr 2015

    Keywords

    • Approximation guarantees
    • Data gathering
    • Optimization algorithms
    • Wireless sensor networks

    All Science Journal Classification (ASJC) codes

    • Software
    • Control and Optimization
    • Artificial Intelligence
    • Information Systems
    • Computer Networks and Communications
    • Management Science and Operations Research

    Fingerprint

    Dive into the research topics of 'Improved structures for data collection in static and mobile wireless sensor networks'. Together they form a unique fingerprint.

    Cite this