1. Shivashankar, H., Suresh, N., Varaprasad, G., & Jayanthi, G. (2014). Designing energy routing protocol with power consumption optimization in manet. IEEE Transactions on Emerging Topics in Computing 2(2).
2. Othman, M. A., Sulaiman, H. A., Ismail, M. M., Misran, M. H., Meor, M. A. B., & Ramlee, R. A. (2013). An analysis of least-cost routing using bellman ford and dijkstra algorithms in wireless routing network. IJACT 5, 10(10).
3. Patel, V., & Baggar, C. (2014). A survey paper of bellman-ford algorithm and Dijkstra algorithm for finding shortest path in gis application. IJPTT 5, ISSN: 2249.
4. Crauser, A., Mehlhorn, K., Meyer, U., & Sanders, P. (1998). A parallelization of dijkstra’s shortest path algorithm (pp. 722–731). Berlin Heidelberg: Springer.
5. Thippeswamy, K., Hanumanthappa, J., & Manjaiah, D.H. (2014). A study on contrast and comparison between bellman-ford algorithm and Dijkstra’s algorithm. In National Conference on wireless Networks-09, Dec 2014.