Notice of RetractionDeliverability of greedy routing in underwater sensor networks

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

Underwater sensor networks comprise of a variable number of sensors that can be deployed in the ocean to sense certain phenomena. With the advance in acoustic communication and sensor techniques, many applications of underwater sensor networks are envisioned. Quantitative analysis of packet deliverability from sensor nodes to the base station is critical for evaluating functionality and performance of an underwater sensor network. The level of deliverability of an underwater sensor network is modeled as the probability that all sensor nodes can successfully send their data to the base station by greedy routing, named probability of guaranteed delivery in this paper. We study the relationship between the critical transmission radius of sensor nodes and the probability of guaranteed delivery. We identify a very tight analytical upper bound on the critical transmission radius for a typical underwater sensor network deployment scenario. The correctness and tightness of the upper bound are verified by extensive simulations.