Methodical Gain Knowledge on Categorizing 1-Hop And 2-Hop Set of Connections

被引:0
|
作者
Thiagarajan, Kittappa [1 ]
Jeya, Justin Gnana Dhas Jospin [2 ]
Deebalakshmi, Ramalingam R. [2 ]
机构
[1] Jeppiaar Engn Coll, Chennai, Tamilnadu, India
[2] Jeppiaar Engn Coll, Dept Comp Sci & Engn, Chennai, Tamil Nadu, India
关键词
GRAPHS;
D O I
10.1063/1.5112274
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this research study we have considered only regular network from Graph Theory, the following analytical study provides identification of 1- hop network and 2 -hop network. The bottleneck node can be observed or identified through this network theoretical and analytical study.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] Localization of networks with presence and distance constraints based on 1-hop and 2-hop mass-spring optimization
    Oliva, Gabriele
    Setola, Roberto
    Panzieri, Stefano
    Pascucci, Federica
    ICT EXPRESS, 2016, 2 (01): : 19 - 22
  • [2] Leveraging 1-hop Neighborhood Knowledge for Connected Dominating Set in Wireless Sensor Networks
    Wang, Wenyong
    Zhang, Jun
    Tang, Yong
    Xiang, Yu
    Yang, Ting
    JOURNAL OF COMPUTERS, 2012, 7 (01) : 11 - 18
  • [3] On the Connectivity of 2-Hop Neighbor Graph
    Hou, Yun
    Qin, Jiahu
    Yu, Changbin
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 6092 - 6097
  • [4] Relative Localization with 2-Hop Neighborhood
    Mallery, Christopher J.
    Medidi, Sirisha
    Medidi, Muralidhar
    2008 IEEE INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS, VOLS 1 AND 2, 2008, : 519 - +
  • [5] The 2-hop spanning tree problem
    Dahl, G
    OPERATIONS RESEARCH LETTERS, 1998, 23 (1-2) : 21 - 26
  • [6] 2-hop distributed MIMO communication system
    Dohler, M
    Gkelias, A
    Aghvami, H
    ELECTRONICS LETTERS, 2003, 39 (18) : 1350 - 1351
  • [7] Anonymous Networks: Randomization=2-Hop Coloring
    Emek, Yuval
    Pfister, Christoph
    Seidel, Jochen
    Wattenhofer, Roger
    PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, : 96 - 105
  • [8] Fully dynamic 2-hop cover labeling
    D'Angelo G.
    D'Emidio M.
    Frigioni D.
    ACM Journal of Experimental Algorithmics, 2019, 24 (01):
  • [9] Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks
    Cai, Y
    Hua, KA
    Phillips, A
    CONFERENCE PROCEEDINGS OF THE 2005 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE, 2005, : 347 - 354
  • [10] Homogeneous 2-hop broadcast in 2D
    Das, Gautam K.
    Das, Sandip
    Nandy, Subhas C.
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (02): : 182 - 190