Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
On the relationship between capacity and distance in an underwater acoustic communication channel
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
IEEE Transactions on Mobile Computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
Void Avoidance in Three-Dimensional Mobile Underwater Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Link stability based geocasting model for underwater sensor networks
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Pressure routing for underwater sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
E-PULRP: energy optimized path unaware layered routing protocol for underwater sensor networks
IEEE Transactions on Wireless Communications
Efficient vector-based forwarding for underwater sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on radar and sonar sensor networks
IEEE/ACM Transactions on Networking (TON)
A Distributed Energy-Aware Routing Protocol for Underwater Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Comparison of routing protocols for underwater sensor networks: a survey
International Journal of Communication Networks and Distributed Systems
Review: A survey on routing techniques in underwater wireless sensor networks
Journal of Network and Computer Applications
An efficient Dynamic Addressing based routing protocol for Underwater Wireless Sensor Networks
Computer Communications
Performance evaluation of underwater wireless sensor networks with OPNET
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Providing reliable and link stability-based geocasting model in underwater environment
International Journal of Communication Systems
DFR: an efficient directional flooding-based routing protocol in underwater sensor networks
Wireless Communications & Mobile Computing
Fast retransmit for flooding-based routing in underwater wireless sensor networks
Proceedings of the 2013 Research in Adaptive and Convergent Systems
A distance-based probabilistic routing for underwater acoustic sensor networks
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
Multi-hop transmission is considered for large coverage areas in bandwidth-limited underwater acoustic networks. In this paper, we present a scalable routing technique based on location information, and optimized for minimum energy per bit consumption. The proposed Focused Beam Routing (FBR) protocol is suitable for networks containing both static and mobile nodes, which are not necessarily synchronized to a global clock. A source node must be aware of its own location and the location of its final destination, but not those of other nodes. The FBR protocol can be defined as a cross-layer approach, in which the routing protocol, the medium access control and the physical layer functionalities are tightly coupled by power control. It can be described as a distributed algorithm, in which a route is dynamically established as the data packet traverses the network towards its final destination. The selection of the next relay is made at each step of the path after suitable candidates have proposed themselves. The system performance is measured in terms of energy per bit consumption and average packet end-to-end delay. The results are compared to those obtained using pre-established routes, defined via Dijkstra's algorithm for minimal power consumption. It is shown that the protocol's performance is close to the ideal case, as the additional burden of dynamic route discovery is minimal.