Improving efficiency of a flooding-based routing protocol for underwater networks

Authors:
Aditi Goel;Aiswariya G. Kannan;Ian Katz;Radim Bartoš
Affiliations:
University of New Hampshire, Durham, NH, USA;University of New Hampshire, Durham, NH, USA;Autonomous Undersea Systems Institute, Lee, NH, USA;University of New Hampshire, Durham, NH, USA
Venue:
Proceedings of the third ACM international workshop on Underwater Networks
Year:
2008

Citing 3
Cited 2

Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks

Proceedings of the 12th annual international conference on Mobile computing and networking
State of the art in protocol research for underwater acoustic sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Development of routing protocols for the solar-powered autonomous underwater vehicle (SAUV) platform

Wireless Communications & Mobile Computing - Underwater Sensor Networks: Architectures and Protocols

Void Avoidance in Three-Dimensional Mobile Underwater Sensor Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Efficient vector-based forwarding for underwater sensor networks

EURASIP Journal on Wireless Communications and Networking - Special issue on radar and sonar sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing protocols based on limited flooding can be used reliably in small scale underwater networks for fleets of autonomous underwater vehicles (AUVs). Scalability issues inherent in flooding are addressed by COFSNET+ [3], a framework protocol that controls which nodes will retransmit a packet during its delivery. COFSNET+ does not specify a method for the selection of nodes; this paper proposes such a method, based on the past contribution of nodes in delivering packets to their destinations. A simulator study shows that the proposed method not only reduces the total number of nodes that retransmit a packet, but also that it can adapt to overcome packet loss conditions in the network. For scenarios where loss is negligible, the method converges on the equivalent of the shortest path. In case of higher packet loss rates, end-to-end robustness is achieved by allowing more nodes to retransmit each packet.