Joint sink deployment and association for multi‐sink wireless camera networks

Abstract

In this paper, we investigate the problem of joint sink deployment and association (JSDA) in multi-sink wireless camera networks (WCNs). Each camera in a WCN requires a different streaming rate of delivering its stream back to an access point (sink) because of various surveillance requirements, for example, event detection or target tracking. In a WCN where multiple channels are supported, the sinks must be placed in suitable locations (sink deployment) to collect streams from cameras over nonoverlapping channels, and in addition, each camera must associate with the appropriate sink (sink association) so that its demand rate can be optimally satisfied. To achieve this goal, we first formulate the JSDA problem as an optimization model using mixed-integer linear programming and prove its NP-completeness. Two approaches, branch-andbound and our heuristics, iterative sink deployment and association (ISDA), are then developed to solve JSDA. We evaluate the performance via simulations with the traces collected by real measurements and show that ISDA can effectively satisfy cameras' demands with a reasonable computational cost.

An efficient placement of sinks and SDN controller nodes for optimizing the design cost of industrial IoT systems

“…Background on placement approaches. Sensor node placement that targets locating sensors, sinks, and relays can be classified into three groups: (1) exhaustive search algorithms, (2) discrete optimization–based algorithms, and (3) approximation‐based algorithms . These research works are summarized in Table and extensively described below.…”

“…It targets mobile sink placement in order to increase network lifetime. In the work of Hung and Lin, joint sink deployment and association (JSDA) in a multiple‐sink wireless camera network is formulated as an MILP problem. The JSDA applies a branch‐and‐bound algorithm to find the optimal solution by systematically enumerating all possible solutions.…”