Please use this identifier to cite or link to this item:
http://idr.nitk.ac.in/jspui/handle/123456789/14787
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chandavarkar B.R. | |
dc.contributor.author | Gadagkar A.V. | |
dc.date.accessioned | 2021-05-05T10:15:46Z | - |
dc.date.available | 2021-05-05T10:15:46Z | - |
dc.date.issued | 2020 | |
dc.identifier.citation | 2020 IEEE 15th International Conference on Industrial and Information Systems, ICIIS 2020 - Proceedings , Vol. , , p. 555 - 560 | en_US |
dc.identifier.uri | https://doi.org/10.1109/ICIIS51140.2020.9342645 | |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/14787 | - |
dc.description.abstract | Underwater acoustic sensor networks (UASNs) have been a recommended technology for acquiring details from underwater. These networks has underwater sensors that have energy constraints and use acoustic communication medium. Routing in UASN is one of the primary issues, as the data need to be forwarded utilizing minimum energy and higher packet delivery rate. Deciding the next forwarding node play a significant role in routing algorithms for UASN and directly impact packet delivery and energy consumed by the nodes. This paper proposes an expectation-based multi-attribute multi-hop routing (EM2 R) in underwater acoustic sensor networks. EM2 R uses node's residual energy and distance as a multi-attribute criterion in selecting next-hop for routing. Further, the detailed implementation of EM2 R in industry-standard underwater network simulator referred to as UnetStack is presented. Additionally, the performance of EM2 R is presented with reference to the selection of the forwarding node and their energy depletion, delay, and throughput. © 2020 IEEE. | en_US |
dc.title | Expectation-Based Multi-Attribute Multi-Hop Routing (EM2R) in Underwater Acoustic Sensor Networks | en_US |
dc.type | Conference Paper | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.