DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10075
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJoshi, Sandeep-
dc.date.accessioned2023-03-31T10:24:54Z-
dc.date.available2023-03-31T10:24:54Z-
dc.date.issued2020-01-
dc.identifier.urihttps://ieeexplore.ieee.org/document/8897570-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10075-
dc.description.abstractIn this paper, we consider a hybrid smart grid communication network consisting of power line communication (PLC) at the transmitter side and the device-to-device (D2D) cellular communication on the receiver side which provides last mile connectivity. The PLC channel is assumed to experience Rayleigh fading and is corrupted by impulsive noise, and the D2D communication being a short range communication system, is assumed to experience Nakagami-m fading with additive Gaussian noise. We propose a maximal-ratio combining (MRC) receiver for the considered hybrid smart grid communication system employing binary phase shift keying (BPSK) modulation at the transmitter and derive a closed-form symbol error probability (SEP) expression for the proposed receiver. The interference between the D2D links is assumed to be negligible for the tractability of the error probability analysis. Numerical results demonstrate the optimality of operating the D2D links at lower signal-to-noise ratio (SNR) values to overcome the effect of the impulsive PLC channel by utilizing diversity branches.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectEEEen_US
dc.subjectDevice-to-device communicationen_US
dc.subjectPower line communi-cationen_US
dc.subjectSymbol error probabilityen_US
dc.titleSmart Grid Network With D2D Communication and Coherent PLC: Error Analysisen_US
dc.typeArticleen_US
Appears in Collections:Department of Electrical and Electronics Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.