International Peer-Reviewed JournalOpen AccessISSN 2456-8880
irejournals@gmail.com+91-7433024337

Home / Current Issue / Paper 1701690

1701690 Vol 3 · Issue 4 Download Paper

Probe On Compressive Rate Estimation With Device-to-device Communications Under LTE-advanced Networks

SURYA S. M Dr. G. Karpagarajesh

Subject area: Science,Engineering and Technology  ·  Area of research: Communication Systems

Abstract

We consider the matching trouble in remote system helped distributed peer-to-peer services. The matching issue is proclaimed as a rate estimation issue. To this completion we extend a casing as compressive rate estimation. Think about the composite channel gain network is compressible and expand a novel detecting and recreation convention for the surmising of attainable rates. The sense convention exploit the superposition rule of the remote system and encourage the accepting hubs to achieve concern of the available channel network. The arbitrary dimensions are encouraged back to controller which translate the channel gain matrix and estimate individual client rates. We analyze the rate loss gap for a straight and a non-direct decoder and find the scaling laws.

References

[1] P. Popovski, V. Braun, H. P.Mayer, P. Fertl, and et al., “Scenarios, requirements and KPIs for 5G mobile and wireless systems.” The METISproject: Mobile and wireless communications Enablers for the TwentytwentyInformation Society, Tech. Rep. ICT-317669-METIS/D1.1, 2013,https://www.metis2020.com.

[2] K. Doppler, M. Rinne, C. Wijting, C. B. Riberio, and K. Hugl, “D2Dcommunications underlaying an LTE cellular network,” IEEE CommunicationsMagazine, vol. 7, no. 12, pp. 42– 49, December 2009.

[3] M. S. Corson, “Towards proximity-aware internetworking,” IEEE WirelessCommunications Magazine, vol. 17, no. 6, pp. 26–33, Dec. 2010.

[4] M. Naslcheraghi, S. A. Ghorashi, and M. Shikh- Bahaei, “Fd device-todevicecommunication for wireless video distribution,” IET Communications,vol. 11, no. 7, pp. 1074–1081, 2017.

[5] G. Fodor, E. Dahlman, G. Mildh, S. Parkvall, N. Reider, G. Miklos,and Z. Turanyi, “Design aspects of network assisted device-to- devicecommunications,” IEEE Communications Magazine, vol. 50, no. 3, pp.170–177, 2012.

[6] N. Lee, X. Lin, J. Andrews, and R. Heath, “Power control for D2Dunderlaid cellular networks: Modeling, algorithms and analysis,” IEEEJournal on Selected Areas in Communications, vol. 33, no. 1, pp. 1–13,2015.

[7] M. Belleschi, G. Fodor, and A. Abrardo, “Performance Analysis of aDistributed Resource Allocation Sceheme for D2D Communications,”in IEEE Workshop on Machine-to-Machine Communications. IEEE,2011.

[8] S. Shakkottai, T. S. Rappaport, and P. Karlson, “Cross-layer design forwireless networks,” IEEE Communications Magazine, 2003.

[9] B. Kaufman, J. Lilleberg, and B. Aazhang, “Spectrum sharing schemebetween cellular users and ad-hoc device-to-device users,” IEEE Transactionson Wireless Communications, vol. 12, no. 3, pp. 1038–1049,2013.

[10] R. Molina-Masegosa and J. Gozalvez, “Lte-v for sidelink 5g v2xvehicular communications: A new 5g technology for short-range vehicleto- everythingcommunications,” IEEE Vehicular Technology Magazine,vol. 12, no. 4, pp. 30–39, 2017.

[11] K. W. Choi and Z. Han, “Device-to-device discovery for proximity-basedservice in LTE- advanced system,” IEEE Journal on Selected Areas inCommunications, vol. 33, no. 1, pp. 55– 66, 2015.

[12] A. Thanos, S. Shalmashi, and G. Miao, “Network-assisted discoveryfor device-to-device communications,” in Globecom Workshops, 2013IEEE. IEEE, 2013, pp. 660–664.

[13] D. Tsolkas, N. Passas, L. Merakos, and A. Salkintzis, “A devicediscovery scheme for proximity services in LTE networks,” in 2014IEEE Symposium on Computers and Communication, 2014.

[14] H. Tang, Z. Ding, and B. C. Levy, “Enabling D2D communicationsthrough neighbor discovery in LTE cellular networks,” IEEE Transactionson Signal Processing, vol. 62, no. 19, pp. 5157–5170, 2014.

[15] J. H. Song, D. H. Lee, W. J. Hwang, and H. J. Choi, “A selectivetransmission power boosting method for D2D discovery in 3GPP LTEcellular system,” in 2014 International Conference on Information andCommunication Technology Convergence. IEEE, 2014, pp. 267–268.

[16] K. W. Choi, H. Lee, and S. C. Chang, “Discovering mobile applicationsin device-to- device communications: Hash function-based approach,” inVehicular Technology Conference (VTC Spring). IEEE, 2014, pp. 1–5.

[17] M. Belleschi, G. Fodor, D. D. Penda, M. Johansson, A. Pradini,and A. Abrardo, “Benchmarking practical RRM algorithms for D2Dcommunications in LTE advanced,” Wireless personal communications,vol. 82, no. 2, pp. 883– 910, 2015.

[18] J. Schreck, G. Wunder, and P. Jung, “Robust iterative interferencealignment for cellular networks with limited feedback,” IEEE Trans.on Wireless Communications, vol. 14, no. 2, pp. 882–894, Oct. 2015.

[19] B. Nazer and M. Gastpar, “Computation over Multiple-Access Channels,”IEEE Trans. on Inf. Theory, vol. 53, no. 10, Oct. 2007.

[20] M. Goldenbaum and S. Stanczak, “Robust analog function computationvia wireless multiple-access channels,” IEEE Transactions on Communications,vol. 61, no. 9, pp. 3863–3877, 2013.

[21] E. J. Candes, J. K. Romberg, and T. Tao, “Stable signal recovery fromincomplete and inaccurate measurements,” Communications on pure andapplied mathematics, vol. 59, no. 8, pp. 1207– 1223, 2006.

[22] M. A. Davenport, M. B. Wakin, and R. G. Baraniuk, “Detectionand estimation with compressive measurements,” Dept. of ECE, RiceUniversity, Tech. Rep, 2006.

[23] J. Schreck, P. Jung, and S. Stanczak, “On channel state feedback for twohopnetworks based on low rank matrix recovery,” in IEEE InternationalConference on Communications (ICC), 2013, pp. 5–10.

[24] R. Baraniuk, M. Davenport, R. A. DeVore, and M. Wakin, “A SimpleProof of the Restricted Isometry Property for Random Matrices,”Constructive Approximation, vol. 28, no. 3, pp. 253–263, Jan. 2008.

[25] P. Jung and P. Walk, “Sparse model uncertainties in compressed sensingwith application to convolutions and sporadic communication,” inCompressed Sensing and its Applications. Springer, 2015, pp. 283–313.

[26] M. Ledoux, the Concentration of Measure Phenomenon, ser. MathematicalSurveys and Monographs. Providence, Rhode Island: AmericanMathematical Society, Feb. 2005, vol. 89.

[27] T. Tao, Topics in random matrix theory. American MathematicalSociety, 2012.

[28] R. Vershynin, “Introduction to the non- asymptotic analysis ofrandom matrices,” arXiv: 1011.3027, 2010. [Online]. Available : http://arxiv.org/abs/1011.3027

[29] M. A. Davenport, “Random observations on random observations:Sparse signal acquisition and processing,” Ph.D. dissertation, TexasA&M University, 2010.

[30] F. Krahmer and R. Ward, “New and improved Johnson-Lindenstraussembeddings via the Restricted Isometry Property,” SIAM Journal onMathematical Analysis, vol. 43, no. 3, pp. 1269–1281, 2011.

[31] D. G. Luenberger, Optimization by vector space methods. New York,NY, USA: John Wiley & Sons, Inc., 1968.

[32] S. Foucart and H. Rauhut, A Mathematical Introduction to CompressiveSensing, ser. Applied and Numerical Harmonic Analysis. Springer NewYork, 2013.

[33] E. J. Candes and T. Tao, “Decoding by linear programming,” IEEETransactions on Information Theory, vol. 51, no. 12, pp. 4203–4215,Dec. 2005.

[34] T. T. Cai and A. Zhang, “Sharp RIP bound for sparse signal and lowrankmatrix recovery,” Applied and Computational Harmonic Analysis,vol. 35, no. 1, pp. 74–93, Jul. 2013.

[35] T. Cai and A. Zhang, “Sparse representation of a polytope and recoveryof sparse signals and low- rank matrices,” IEEE Transactions on InformationTheory, vol. 60, no. 1, pp. 122–132, Jan 2014.

[36] H. Huh, A. M. Tulino, and G. Caire, “Network MIMO with linearzero-forcing beamforming: large system analysis, impact of channelestimation and reduced-complexity scheduling,” IEEE Transactions onInformation Theory, no. 5, pp. 2911–2934, 2010.

[37] S. Becker, E. Candes, and M. Grant, “Tfocs: Flexible first-order methodsfor rank minimization,” in Low-rank Matrix Optimization Symposium,SIAM Conf. on Optimization, 2011.

How to cite this paper

SURYA S. M, Dr. G. Karpagarajesh "Probe On Compressive Rate Estimation With Device-to-device Communications Under LTE-advanced Networks" Iconic Research And Engineering Journals Volume 3 Issue 4 2019 Page 106-112
SURYA S. M, Dr. G. Karpagarajesh "Probe On Compressive Rate Estimation With Device-to-device Communications Under LTE-advanced Networks" Iconic Research And Engineering Journals, vol. 3, no. 4, Oct. 2019
SURYA S. M, Dr. G. Karpagarajesh (2019). Probe On Compressive Rate Estimation With Device-to-device Communications Under LTE-advanced Networks. Iconic Research And Engineering Journals, 3(4).
SURYA S. M, Dr. G. Karpagarajesh "Probe On Compressive Rate Estimation With Device-to-device Communications Under LTE-advanced Networks" Iconic Research And Engineering Journals, vol. 3, no. 4, Oct. 2019.
@article{1701690,
      author = {SURYA S. M, Dr. G. Karpagarajesh},
      title = {Probe On Compressive Rate Estimation With Device-to-device Communications Under LTE-advanced Networks},
      journal = {Iconic Research And Engineering Journals},
      year = {2019},
      volume = {3},
      number = {4},
      pages = {106-112},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1701690.pdf},
      abstract = {We consider the matching trouble in remote system helped distributed peer-to-peer services. The matching issue is proclaimed as a rate estimation issue. To this completion we extend a casing as compressive rate estimation. Think about the composite channel gain network is compressible and expand a novel detecting and recreation convention for the surmising of attainable rates. The sense convention exploit the superposition rule of the remote system and encourage the accepting hubs to achieve concern of the available channel network. The arbitrary dimensions are encouraged back to controller which translate the  channel gain matrix and estimate individual client rates. We analyze the rate loss gap for a straight and a non-direct decoder and find the scaling laws.},
      month = {October},
  }