Table of Contents Author Guidelines Submit a Manuscript
Journal of Sensors
Volume 2016 (2016), Article ID 8671516, 6 pages
http://dx.doi.org/10.1155/2016/8671516
Research Article

Optimal Fair Scheduling in S-TDMA Sensor Networks for Monitoring River Plumes

Departamento Ingeniería de Comunicaciones, University of Málaga, 29010 Málaga, Spain

Received 24 September 2015; Revised 26 January 2016; Accepted 7 February 2016

Academic Editor: Maurizio Brocchini

Copyright © 2016 Miguel-Angel Luque-Nieto et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Underwater wireless sensor networks (UWSNs) are a promising technology to provide oceanographers with environmental data in real time. Suitable network topologies to monitor estuaries are formed by strings coming together to a sink node. This network may be understood as an oriented graph. A number of MAC techniques can be used in UWSNs, but Spatial-TDMA is preferred for fixed networks. In this paper, a scheduling procedure to obtain the optimal fair frame is presented, under ideal conditions of synchronization and transmission errors. The main objective is to find the theoretical maximum throughput by overlapping the transmissions of the nodes while keeping a balanced received data rate from each sensor, regardless of its location in the network. The procedure searches for all cliques of the compatibility matrix of the network graph and solves a Multiple-Vector Bin Packing (MVBP) problem. This work addresses the optimization problem and provides analytical and numerical results for both the minimum frame length and the maximum achievable throughput.