Open Access   Article Go Back

DFID Time Complexity in Mobile Network

Justin Sophia. I1 , N. Rama2

  1. Department of Computer Science, Loyola College, Chennai ,India.
  2. Department of Computer Science, Presidency College, Chennai ,India.

Correspondence should be addressed to: justinsophia4@gmail.com .

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-2 , Page no. 92-97, Feb-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i2.9297

Online published on Feb 28, 2018

Copyright © Justin Sophia. I, N. Rama . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Justin Sophia. I, N. Rama, “DFID Time Complexity in Mobile Network,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.92-97, 2018.

MLA Style Citation: Justin Sophia. I, N. Rama "DFID Time Complexity in Mobile Network." International Journal of Computer Sciences and Engineering 6.2 (2018): 92-97.

APA Style Citation: Justin Sophia. I, N. Rama, (2018). DFID Time Complexity in Mobile Network. International Journal of Computer Sciences and Engineering, 6(2), 92-97.

BibTex Style Citation:
@article{I_2018,
author = {Justin Sophia. I, N. Rama},
title = {DFID Time Complexity in Mobile Network},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2018},
volume = {6},
Issue = {2},
month = {2},
year = {2018},
issn = {2347-2693},
pages = {92-97},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1706},
doi = {https://doi.org/10.26438/ijcse/v6i2.9297}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i2.9297}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1706
TI - DFID Time Complexity in Mobile Network
T2 - International Journal of Computer Sciences and Engineering
AU - Justin Sophia. I, N. Rama
PY - 2018
DA - 2018/02/28
PB - IJCSE, Indore, INDIA
SP - 92-97
IS - 2
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
871 476 downloads 232 downloads
  
  
           

Abstract

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.

Key-Words / Index Term

DFID, BFS, DFS, Hexagonal mesh, Time complexity

References

[1] T . H . Cormen, C. E . Leiserson, R. L. Rivest and C. Stein “Introduction to Algorithms” , Cambridge, MA: MIT Press , September 2009
[2] 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 .
[3] 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
[4] 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.
[5] 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
[6] 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.
[7] J.A.Bondy, U.S.R. Murty, Graph Theory with Applications, North Holland, New York.Amsterdam.Oxford, 1976.
[8] F. Harray. Graph Thoery. Addison. Wesley, Reading. Mass (1969).
[9] Deo, Narsingh. Graph theory with applications to engineering and computer science. Courier Dover Publications, 2016.
[10] A.Bagchi, S.Hakimi, Data Transfers in Broadcast Networks, IEEE TransactionsComput. 41, (1992).
[11] R.Balakrishnan, K.Ranganathan, A Text Book of Graph Theory, Springer,(1999)
[12] C.Berge, The Theory of Graphs, Methuen, (1962).
[13] N.L.Biggs, E.K.Loyd, R.J.Wilson, Graph Theory, Oxford UniversityPress,(1976), 1736 { 1936 .R.Diestel, Graph Theory, Springer, (1991).
[14] J.L.Gross, J.Yellen, Graph Theory and its Applications, CRC Press, (1998).