Reconstruction of Euclidean embeddings in dense networks

2016 ◽  
Author(s):  
Sarah Costrell ◽  
Subhrajit Bhattacharya ◽  
Robert Ghrist
Keyword(s):  
Dense Networks ◽  
Euclidean Embeddings

Energy-Efficient Mobility-Aware Caching Algorithms for Clustered Small Cells in Ultra-Dense Networks

2019 ◽  
Vol 68 (7) ◽  
pp. 6833-6846 ◽  
Author(s):  
Iman Keshavarzian ◽  
Zolfa Zeinalpour-Yazdi ◽  
Aliakbar Tadaion
Keyword(s):  
Energy Efficient ◽  
Small Cells ◽  
Dense Networks

scholarly journals An Adaptive Cell Selection Scheme for 5G Heterogeneous Ultra-Dense Networks

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 64224-64240
Author(s):  
Ibtihal Ahmed Alablani ◽  
Mohammed Amer Arafah
Keyword(s):  
Cell Selection ◽  
Selection Scheme ◽  
Dense Networks

Using UE-VBS for dynamic virtual small cells deployment and backhauling in 5G Ultra-Dense networks

2021 ◽  
Vol 189 ◽  
pp. 107926
Author(s):  
Kuna Venkateswararao ◽  
Pravati Swain ◽  
Christophoros Christophorou ◽  
Andreas Pitsillides
Keyword(s):  
Small Cells ◽  
Dense Networks

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

2006 ◽  
Vol 17 (03) ◽  
pp. 677-701 ◽  
Author(s):  
YUNG H. TSIN
Keyword(s):  
Distributed Algorithm ◽  
Computer Network ◽  
Connected Components ◽  
Message Complexity ◽  
Edge Connectivity ◽  
Worst Case ◽  
Dense Networks

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.

Sign in / Sign up

Export Citation Format

Share Document