DFID Time Complexity in Mobile Network
DOI:
https://doi.org/10.26438/ijcse/v6i2.9297Keywords:
DFID, BFS, DFS, Hexagonal mesh, Time complexityAbstract
Hexagonal network structures the base for mobile communication networks. To increase the efficiency of mobile communication, we implement the DFID algorithm for transmission. Let DFID denote the time taken by DFS and BFS preorder traversing to find the vertex x in graph DFID(x,G). In this section we discuss DFS and BFS for G beign a hexagonal mesh of dimension n i.e HXn..Thereby computing the time complexity of DFID algorithm for mobile networking.
References
T . H . Cormen, C. E . Leiserson, R. L. Rivest and C. Stein “Introduction to Algorithms” , Cambridge, MA: MIT Press , September 2009
N. Gelfand , M . T. Goodrich and R. Tammasia,”teaching Da t a Structure Design Patterns,” Proceedings of the 29 SIGCSE Technical Symposium on Computer Science Education, vol. 30 (pp. 331-335) , Providence, RI, USA, 1998 .
R.Bayer, “Binary B-Trees for Virtual Memory ,” Proceedings of ACM SIGFIDET Workshop on Data Description, Access and Control , pp. 219-235, San Diego , CA, USA, 1971
R. Tarjan, “Depth First Search and Linear Graph Algorithms,” Proceedings of the 12th Annual IEEE Symposium on Switching and Automata Theory, pp. 141-121, East Lansing, MI, USA, 1971.
Everitt, Tom, and Marcus Hutter. "Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search." Australasian Joint Conference on Artificial Intelligence. Springer International Publishing, 2015
Everitt, Tom, and Marcus Hutter. "Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search." Australasian Joint Conference on Artificial Intelligence. Springer International Publishing, 2015.
J.A.Bondy, U.S.R. Murty, Graph Theory with Applications, North Holland, New York.Amsterdam.Oxford, 1976.
F. Harray. Graph Thoery. Addison. Wesley, Reading. Mass (1969).
Deo, Narsingh. Graph theory with applications to engineering and computer science. Courier Dover Publications, 2016.
A.Bagchi, S.Hakimi, Data Transfers in Broadcast Networks, IEEE TransactionsComput. 41, (1992).
R.Balakrishnan, K.Ranganathan, A Text Book of Graph Theory, Springer,(1999)
C.Berge, The Theory of Graphs, Methuen, (1962).
N.L.Biggs, E.K.Loyd, R.J.Wilson, Graph Theory, Oxford UniversityPress,(1976), 1736 { 1936 .R.Diestel, Graph Theory, Springer, (1991).
J.L.Gross, J.Yellen, Graph Theory and its Applications, CRC Press, (1998).
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
