Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/14609
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWoradit K.
dc.date.accessioned2021-04-05T03:35:57Z-
dc.date.available2021-04-05T03:35:57Z-
dc.date.issued2010
dc.identifier.other2-s2.0-79951737323
dc.identifier.urihttps://ir.swu.ac.th/jspui/handle/123456789/14609-
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-79951737323&doi=10.1109%2fICCT.2010.5688803&partnerID=40&md5=71c21201d05d3fa9bf118101813a9aba
dc.description.abstractThe opportunistic cooperative diversity is promising to improve the capacity of the wireless communications because it yields the same diversity order as using all relay nodes while requires bandwidth for only one relay node. The more number of relay nodes we employ, the higher diversity order we obtain. From the results in the literature, the recently published paper conjectures that there exists the saturation in obtaining the capacity improvement from increasing the number of employing relay nodes. This means the capacity converges to an upper bound as a function of the number of employed relay nodes. In this paper, we prove that the upper bound does not exist, which means the outage capacity diverges as a function of the number of employed relay nodes. © 2010 IEEE.
dc.subjectCapacity bound
dc.subjectCapacity improvement
dc.subjectCo-operative diversity
dc.subjectDiversity order
dc.subjectOutage capacity
dc.subjectRelay node
dc.subjectUpper Bound
dc.subjectWireless communications
dc.subjectWireless telecommunication systems
dc.titleOn capacity bound of opportunistic cooperative diversity
dc.typeConference Paper
dc.rights.holderScopus
dc.identifier.bibliograpycitationInternational Conference on Communication Technology Proceedings, ICCT. (2010), p.1011-1014
dc.identifier.doi10.1109/ICCT.2010.5688803
Appears in Collections:Scopus 1983-2021

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


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