Clear Filters
Clear Filters

Info

This question is closed. Reopen it to edit or answer.

Shortest Path for 2,000 NODES without using Djikstra Algorithm in WSN

1 view (last 30 days)
Dear Community Researcher,
Please can someone help me with an alternative Shortest Path Tree Distance Algorithm without using Djikstra, am the processing time takes about 48hours plus to run for 1,000 sensor nodes from source to destiny.
Thanks in anticipation.
Julius

Answers (0)

This question is closed.

Products


Release

R2020a

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!