Researchers are currently examining an underwater acoustic sensor network in terms of energy consumption, shortest routing, and increased throughput. One of the most critical tasks in UASN's shortest stable routing is neighbour discovery. The main goal of this paper is to find the shortest path by linking trustworthy nodes based on their location. The Al-Wahda method verifies the node's position information before assigning it to be the best nearest neighbour node. The routing's effectiveness is strong because the intermediate nodes are best neighbours in terms of position and trust value. Using multi-hop settings, the efficiency of neighbour discovery is examined. For routing from source to destination, an upper and lower bound value will be allocated. Our neighbour discovery algorithms are asynchronous and do not require node density estimates. The efficiency of the simulation for this paper is evaluated using Network Simulator tools.
Author (s) Details
Dr.
S. A. Kalaiselvan
Department
of Computer Science and Engineering, St.Martin's Engineering College,
Secunderabad, India.
Dr. V. Parthasarathy
Dean
R&D and Industry Relations, Karpagam Academy of Higher Education,
Tamilnadu, India.
Dr. N. Satheesh
Department
of Computer Science and Engineering, St.Martin's Engineering College,
Secunderabad, India.
No comments:
Post a Comment