• DocumentCode
    2450167
  • Title

    Timely Report Delivery in Social Swarming Applications

  • Author

    Liu, Bin ; Terlecky, Peter ; Xu, Xing ; Bar-Noy, Amotz ; Govindan, Ramesh ; Rawitz, Dror

  • Author_Institution
    Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    2012
  • fDate
    16-18 May 2012
  • Firstpage
    75
  • Lastpage
    82
  • Abstract
    In social swarming applications, participants equipped with 3G and WiFi-capable smart phones are tasked to provide reports (possibly voluminous ones that include full-motion video) about their immediate environment to a central coordinator. In this paper, we consider the problem of timely delivery of these reports: each report has an associated deadline and the goal of the system is to retrieve as many reports as possible (or retrieve the most valuable reports), while satisfying each report´s deadline. Reporters can use their cellular interface to upload their reports, but can also ask neighbors (using their faster WiFi interface) to help upload parts of their reports. Under an assumption that WiFi transmission delays are negligible, we first show that there exists a polynomial time optimal solution using an earliest-deadline-first (EDF) strategy for achieving the goals described above. In practice, WiFi delays are not negligible: in this case, it turns out that the scheduling problem is strongly NP-hard. We formulate two heuristic algorithms, and show, through simulations with real-world measurements, that these heuristics perform 2-4× better than without peer-assistance, and within 60% of an upper-bound on the optimal.
  • Keywords
    3G mobile communication; computational complexity; delays; scheduling; smart phones; wireless LAN; 3G smart phones; EDF strategy; NP-hard problem; WiFi interface; WiFi transmission delays; WiFi-capable smart phones; cellular interface; earliest-deadline-first strategy; heuristic algorithms; polynomial time optimal solution; scheduling problem; social swarming applications; timely report delivery; upper-bound; Bandwidth; Delay; Heuristic algorithms; IEEE 802.11 Standards; Polynomials; Schedules; Smart phones;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing in Sensor Systems (DCOSS), 2012 IEEE 8th International Conference on
  • Conference_Location
    Hangzhou
  • Print_ISBN
    978-1-4673-1693-4
  • Type

    conf

  • DOI
    10.1109/DCOSS.2012.8
  • Filename
    6227727