PROJECT TITLE :

Collision Tolerant and Collision Free Packet Scheduling for Underwater Acoustic Localization

ABSTRACT:

This text considers the joint drawback 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 reduce the localization time, and to try and do therefore we have a tendency to contemplate two packet transmission schemes, particularly a collision-free scheme (CFS), and a collision-tolerant scheme (CTS). The specified localization time is formulated for these schemes, and through analytical results and numerical examples their performances are shown to be captivated with the circumstances. When the packet duration is short (as is the case for a localization packet), the operating space is large (above three km in a minimum of one dimension), and the common probability of packet-loss is not shut to zero, the collision-tolerant theme is found to require a shorter localization time. At the identical time, its implementation complexity is below that of the collision-free scheme, because in CTS, the anchors work independently. CTS consumes slightly a lot of energy to create up for packet collisions, however it's shown to provide a higher localization accuracy. An iterative Gauss-Newton algorithm is employed by every sensor node for self-localization, and also the Cramér Rao lower bound is evaluated as a benchmark.