Ashok V. SutagundarB. S. Halakarnimath
The proposed deployment scheme works as follows (i) The node calculates the common reference point whenever it is in the communication range of at least 2 other nodes. If any node is not able to communicate with a minimum of two other nodes and can communicate with only one node than such node can only perform one-hop communication with the nearest node to remain in the network. (ii) The sink node triggers the AUV to perform the one-time random walk in the network to gather the data from all the nodes including the calculated common reference point. (iii) The AUV forwards this information to the surface buoys. (iv)The surface-buoy sends the collected data to the sink node to process the data. (v) The sink node pre-processes the data to remove the adjacent common reference points, unfeasible points, and the redundant points. (vi) The sink node computes the routing path based on the common reference point and triggers the mobile agents to deploy the nodes at the remaining common reference points. The proposed algorithm is validated with performance parameters such as network coverage, network connectivity and a number of nodes to be deployed.
B. S. HalakarnimathAshok V. Sutagundar
Deying LiZheng LiWenkai MaWenping Chen
Deying LiZheng LiWenkai MaWenping Chen
Dario PompiliTommaso MelodiaIan F. Akyildiz