Abstract :
This paper examines global connectivity of complex networks with random links. A weighted expected communication graph models the network.
The literature’s weighted vertex connectivity (WVC) generalization of vertex connectivity is effective at measuring this type of network’s connectivity. Given the computational complexity of the WVC, a numerically efficient approximate measure is better.
This project derives a less conservative polynomial-time WVC approximation. The proposed approximation matches the WVC under certain conditions. Simulations validate the proposed measure.
Keywords : Sea Measurements, Underwater Acoustics, Wireless Sensor Networks, Weight Measurement, Signal Processing Algorithms, Directed Graphs, Computational Efficiency, Graph Connectivity, Directed Weighted Graphs, Sensor Networks
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
