DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/9990
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZafaruddin, S.M.-
dc.date.accessioned2023-03-28T05:42:19Z-
dc.date.available2023-03-28T05:42:19Z-
dc.date.issued2019-
dc.identifier.urihttps://ieeexplore.ieee.org/abstract/document/8815520-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9990-
dc.description.abstractIn this letter, we propose a resource allocation for cooperative relaying in a scenario with a high number of communicating devices. The proposed resource allocation is based on Nash bargaining solution (NBS) and leads to a natural cooperation among devices. The NBS provides an allocation of time intervals maximizing the number of transmitted packets considering energy consumption of devices. The derived NBS is in closed form, thus, it is suitable for wireless communications with time-varying channels as no iterations are needed to find the optimum allocation. Furthermore, linear complexity of the derived NBS allows its application to future mobile networks with a high number of communicating devicesen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectEEEen_US
dc.subjectCooperative game theoryen_US
dc.subjectNash bargainingen_US
dc.subjectCooperative relayingen_US
dc.subjectResource allocationen_US
dc.subjectEnergy Consumptionen_US
dc.titleNash Bargaining Solution for Cooperative Relaying Exploiting Energy Consumptionen_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.