Collision Tolerant and Collision Free Packet Scheduling for Underwater Acoustic Localization

This article considers the joint problem of packet scheduling and self-localization in an underwater acoustic sensor network with randomly distributed nodes. In terms of packet scheduling, our goal is to minimize the localization time, and to do so we consider two packet transmission schemes, namely a collision-free scheme (CFS), and a collision-tolerant scheme (CTS). The required localization time is formulated for these schemes, and through analytical results and numerical examples their performances are shown to be dependent on the circumstances. When the packet duration is short (as is the case for a localization packet), the operating area is large (above 3 km in at least one dimension), and the average probability of packet-loss is not close to zero, the collision-tolerant scheme is found to require a shorter localization time. At the same time, its implementation complexity is lower than that of the collision-free scheme, because in CTS, the anchors work independently. CTS consumes slightly more energy to make up for packet collisions, but it is shown to provide a better localization accuracy. An iterative Gauss-Newton algorithm is employed by each sensor node for self-localization, and the Cramer Rao lower bound is evaluated as a benchmark.