FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2015164001> ?p ?o ?g. }

• W2015164001 endingPage "2516" @default.
• W2015164001 startingPage "2501" @default.
• W2015164001 abstract "Multicell cooperation (MCC) is an approach for mitigating intercell interference in dense cellular networks. Existing studies on MCC performance typically rely on either oversimplified Wyner-type models or complex system-level simulations. The promising theoretical results (typically using Wyner models) seem to materialize neither in complex simulations nor in practice. To more accurately investigate the theoretical performance of MCC, this paper models an entire plane of interfering cells as a Poisson random tessellation. The base stations (BSs) are then clustered using a regular lattice, whereby BSs in the same cluster mitigate mutual interference by beamforming with perfect channel state information. Techniques from stochastic geometry and large-deviation theory are applied to analyze the outage probability as a function of the mobile locations, scattering environment, and the average number of cooperating BSs per cluster <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>l</i> . For mobiles near the centers of BS clusters, it is shown that outage probability diminishes as <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O</i> ( <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>e</i> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>-</sup> <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>l</i> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>ν</sup> <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sub> ) with 0 ≤ ν <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sub> ≤ 1 if scattering is sparse, and as <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O</i> ( <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>l</i> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>-ν</sup> <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> ) with ν <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> proportional to the signal diversity order if scattering is rich. For randomly located mobiles, regardless of scattering, outage probability is shown to scale as <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O</i> ( <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>l</i> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>-ν</sup> <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sub> ) with 0 ≤ ν <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sub> ≤ 0.5. These results confirm analytically that cluster-edge mobiles are the bottleneck for network coverage and provide a plausible analytic framework for more realistic analysis of other multicell techniques." @default.
• W2015164001 created "2016-06-24" @default.
• W2015164001 creator A5007131492 @default.
• W2015164001 creator A5042833857 @default.
• W2015164001 date "2013-04-01" @default.
• W2015164001 modified "2023-09-26" @default.
• W2015164001 title "An Analytical Framework for Multicell Cooperation via Stochastic Geometry and Large Deviations" @default.
• W2015164001 cites W1974467482 @default.
• W2015164001 cites W1993190681 @default.
• W2015164001 cites W1997834106 @default.
• W2015164001 cites W2013491227 @default.
• W2015164001 cites W2021051891 @default.
• W2015164001 cites W2040650415 @default.
• W2015164001 cites W2060108923 @default.
• W2015164001 cites W2075295072 @default.
• W2015164001 cites W2085554698 @default.
• W2015164001 cites W2093763487 @default.
• W2015164001 cites W2095796369 @default.
• W2015164001 cites W2098995249 @default.
• W2015164001 cites W2102473388 @default.
• W2015164001 cites W2106612364 @default.
• W2015164001 cites W2108662631 @default.
• W2015164001 cites W2112075496 @default.
• W2015164001 cites W2113271807 @default.
• W2015164001 cites W2115094114 @default.
• W2015164001 cites W2116896318 @default.
• W2015164001 cites W2121308898 @default.
• W2015164001 cites W2131070905 @default.
• W2015164001 cites W2131350052 @default.
• W2015164001 cites W2132485616 @default.
• W2015164001 cites W2132748039 @default.
• W2015164001 cites W2132987440 @default.
• W2015164001 cites W2143252188 @default.
• W2015164001 cites W2145873277 @default.
• W2015164001 cites W2148584659 @default.
• W2015164001 cites W2149258241 @default.
• W2015164001 cites W2150166076 @default.
• W2015164001 cites W2154813399 @default.
• W2015164001 cites W2155174176 @default.
• W2015164001 cites W2158817550 @default.
• W2015164001 cites W2162636480 @default.
• W2015164001 cites W3102609478 @default.
• W2015164001 cites W3103373113 @default.
• W2015164001 cites W3106282754 @default.
• W2015164001 cites W4236669580 @default.
• W2015164001 cites W4246529675 @default.
• W2015164001 doi "https://doi.org/10.1109/tit.2012.2232966" @default.
• W2015164001 hasPublicationYear "2013" @default.
• W2015164001 type Work @default.
• W2015164001 sameAs 2015164001 @default.
• W2015164001 citedByCount "91" @default.
• W2015164001 countsByYear W20151640012013 @default.
• W2015164001 countsByYear W20151640012014 @default.
• W2015164001 countsByYear W20151640012015 @default.
• W2015164001 countsByYear W20151640012016 @default.
• W2015164001 countsByYear W20151640012017 @default.
• W2015164001 countsByYear W20151640012018 @default.
• W2015164001 countsByYear W20151640012019 @default.
• W2015164001 countsByYear W20151640012020 @default.
• W2015164001 countsByYear W20151640012021 @default.
• W2015164001 countsByYear W20151640012022 @default.
• W2015164001 countsByYear W20151640012023 @default.
• W2015164001 crossrefType "journal-article" @default.
• W2015164001 hasAuthorship W2015164001A5007131492 @default.
• W2015164001 hasAuthorship W2015164001A5042833857 @default.
• W2015164001 hasBestOaLocation W20151640012 @default.
• W2015164001 hasConcept C100906024 @default.
• W2015164001 hasConcept C105795698 @default.
• W2015164001 hasConcept C11413529 @default.
• W2015164001 hasConcept C114614502 @default.
• W2015164001 hasConcept C127162648 @default.
• W2015164001 hasConcept C184720557 @default.
• W2015164001 hasConcept C31258907 @default.
• W2015164001 hasConcept C32022120 @default.
• W2015164001 hasConcept C33923547 @default.
• W2015164001 hasConcept C41008148 @default.
• W2015164001 hasConcept C54197355 @default.
• W2015164001 hasConcept C68649174 @default.
• W2015164001 hasConcept C76155785 @default.
• W2015164001 hasConceptScore W2015164001C100906024 @default.
• W2015164001 hasConceptScore W2015164001C105795698 @default.
• W2015164001 hasConceptScore W2015164001C11413529 @default.
• W2015164001 hasConceptScore W2015164001C114614502 @default.
• W2015164001 hasConceptScore W2015164001C127162648 @default.
• W2015164001 hasConceptScore W2015164001C184720557 @default.
• W2015164001 hasConceptScore W2015164001C31258907 @default.
• W2015164001 hasConceptScore W2015164001C32022120 @default.
• W2015164001 hasConceptScore W2015164001C33923547 @default.
• W2015164001 hasConceptScore W2015164001C41008148 @default.
• W2015164001 hasConceptScore W2015164001C54197355 @default.
• W2015164001 hasConceptScore W2015164001C68649174 @default.
• W2015164001 hasConceptScore W2015164001C76155785 @default.
• W2015164001 hasIssue "4" @default.
• W2015164001 hasLocation W20151640011 @default.
• W2015164001 hasLocation W20151640012 @default.
• W2015164001 hasLocation W20151640013 @default.
• W2015164001 hasOpenAccess W2015164001 @default.
• W2015164001 hasPrimaryLocation W20151640011 @default.

• next