Event coverage & WSNs with mobile sinks

Introduction

WSNs with mobile sinks can be employed for various applications such as border protection, environmental monitoring, crowd management, and animal control. They are composed of a large number of static sensor nodes and limited number of mobile sinks.

The advantages of WSNs with mobile sinks over the more traditional WSNs with a single static sink include a longer lifetime of networks and reduced data losses. Moreover, multiple mobile sinks can be used for sharing the workload and collaborative activities. However, the use of multiple sinks brings new research challenges such as mobile sink positioning, coverage, and communication among the mobile sinks. While the main goal of the mobile sinks are collecting data from sensor nodes, they can also share data and perform collaborative actions.


Overview

We consider a scenario where WSNs with multiple mobile sinks are used for event coverage. We divide the problem of event coverage into two sub-problems: mobile sink positioning and the selection of the sink which handles a specific event. For mobile sink positioning, we propose weighted positioning according to the density of people in the attractions and adaptive sink positioning based on crowd densities of the attractions and the history of events. We select the mobile sink assigned to an event based on the shortest estimated travel time to the event. The travel times are computed by an algorithm which takes into account both the length of the paths and the current density and movements of people along the roads.

Communication-constrained p-Center Problem

For collaborative event handling, we propose a connected topology of mobile sinks throughout the operation of the network. For optimal positioning, we propose an approach building on the p-center problem. In this approach, multiple mobile sinks are positioned such that they minimize their maximum distance from the attractions, while preserving their pairwise communication links. We propose a new variant of the original p-center problem, which we call communication-constrained p-center problem and propose an exact algorithm for p-center and p-median positioning approaches.


Downloads & Media

  • Download Wireless Networks (WINET) Journal article: Article
  • Download IEEE GLOBECOM'14 conference paper: Paper
  • Download IEEE GLOBECOM'14 conference presentation: Presentation
  • Link to GitHub repository for the simulation 1: Source Code (Event Coverage in Theme Parks)
  • Download IEEE ICC'13 conference paper: Paper
  • Download IEEE ICC'13 conference presentation: Presentation
  • Link to GitHub repository for the simulation 2: Source Code (Communication-constrained p-Center Problem)

Related Publications

  • G. Solmaz, K. Akkaya and D. Turgut. “Communication-constrained p-Center Problem for Event Coverage in Theme Parks.” In Proceedings of IEEE GLOBECOM'14, pp. 486-491, December 2014.
    BibTeX   Presentation   Paper  

  • G. Solmaz and D. Turgut. “Optimizing Event Coverage in Theme Parks.” Wireless Networks (WINET) Journal, 20(6):1445–1459, August 2014.
    BibTeX   Article  

  • G. Solmaz and D. Turgut. “Event Coverage in Theme Parks Using Wireless Sensor Networks with Mobile Sinks.” In Proceedings of IEEE ICC'13, pp. 1522-1526, June 2013.
    BibTeX   Presentation   Paper  

Back to research home page