Smart Hospital Sensor Network Deployment for Mobile and Remote Healthcare System

In this paper, we propose a hospital sensor network deployment method for smart healthcare systems. Since sensor nodes in hospitals are always in an environment where power can be supplied, it is essential to have stable network connectivity by achieving optimal gateway deployment, rather than focusing on energy efficiency. The proposed technique leads to an access point (AP) layout that minimizes the overall network operation cost. The operation cost is calculated per unit time, and it includes installation cost and maintenance cost. In addition, group numbers are assigned to sensor nodes for guaranteeing network connectivity, no matter where the mobile sensor devices move. The performance of the proposed methodology has been verified through numerical experiments.

An Effective Algorithm to Find a Cost Minimizing Gateway Deployment for Node-Replaceable Wireless Sensor Networks

In this paper, we present an efficient way to find a gateway deployment for a given sensor network topology. We assume that the expired sensors and gateways can be replaced and the locations of the gateways are chosen among the given sensor nodes. The objective is to find a gateway deployment that minimizes the cost per unit time, which consists of the maintenance and installation costs. The proposed algorithm creates a cost reference and uses it to find the optimal deployment via a divide and conquer algorithm. Comparing all cases is the most reliable way to find the optimal gateway deployment, but this is practically impossible to calculate, since its computation time increases exponentially as the number of nodes increases. The method we propose increases linearly, and so is suitable for large scale networks. Additionally, compared to stochastic algorithms such as the genetic algorithm, this methodology has advantages in computational speed and accuracy for a large number of nodes. We also verify our methodology through several numerical experiments.

A Dynamic Surface Gateway Placement Scheme for Mobile Underwater Networks

Deployment of surface-level gateways holds potential as an effective method to alleviate high-propagation delays and high-error probability in an underwater wireless sensor network (UWSN). This promise comes from reducing distances to underwater nodes and using radio waves to forward information to a control station. In an UWSN, a dynamic energy efficient surface-level gateway deployment is required to cope with the mobility of underwater nodes while considering the remote and three-dimensional nature of marine space. In general, deployment problems are usually modeled as an optimization problem to satisfy multiple constraints given a set of parameters. One previously published static deployment optimization framework makes assumptions about network workload, routing, medium access control performance, and node mobility. However, in real underwater environments, all these parameters are dynamic. Therefore, the accuracy of performance estimates calculated through static UWSN deployment optimization framework tends to be limited by nature. This paper presents the Prediction-Assisted Dynamic Surface Gateway Placement (PADP) algorithm to maximize the coverage and minimize the average end-to-end delay of a mobile underwater sensor network over a specified period. PADP implements the Interacting Multiple Model (IMM) tracking scheme to predict the positions of sensor nodes. The deployment is determined based on both current and predicted positions of sensor nodes, which enables better coverage and shorter end-to-end delay. PADP uses a branch-and-cut approach to solve the optimization problem efficiently, and employs a disjoint-set data structure to ensure connectivity. Simulation results illustrate that PADP significantly outperforms a static gateway deployment scheme.