Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/27923
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRaza, Waseem-
dc.contributor.authorJavaid, Nadeem-
dc.contributor.authorNasir, Hina-
dc.contributor.authorImran, Muhammad-
dc.contributor.authorYASAR, Ansar-
dc.date.accessioned2019-03-19T13:59:39Z-
dc.date.available2019-03-19T13:59:39Z-
dc.date.issued2018-
dc.identifier.citation2018 14TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC), IEEE,p. 850-855-
dc.identifier.isbn9781538620700-
dc.identifier.issn2376-6492-
dc.identifier.urihttp://hdl.handle.net/1942/27923-
dc.description.abstractThis paper presents a decisive threshold termed as the buffer-threshold to control the selection probability of source-relay (SR) or relay-destination (RD) links for the buffer aided cooperative wireless networks. The weights of the links are reassigned using buffer-threshold and a link with the maximum weight is activated. The proposed scheme is termed as Buffer-Threshold based relay selection scheme (BTRS). The relations of the outage probability (OP) and the average delay are calculated by the Markov Modelling of the buffers. Theoretical results are analyzed for different cases of the buffer-threshold and validated by the Monte-carlo simulations. For the performance evaluation BTRS is compared with the max link relay selection (MLRS) scheme and the max weight relay selection (MWRS) scheme and outperforms its counterparts in terms of the average delay.-
dc.language.isoen-
dc.publisherIEEE-
dc.relation.ispartofseriesInternational Wireless Communications and Mobile Computing Conference-
dc.rightsCopyright 2018 IEEE-
dc.subject.otherBuffer-aided relay selection; cooperative communication; OP; buffer-threshold; BTRS; Markov chain; Monte-carlo; MLRS; MWRS-
dc.subject.otherBuffer-aided relay selection; cooperative communication; OP; buffer-threshold; BTRS; Markov chain; Monte-carlo; MLRS; MWRS-
dc.titleBuffer Occupancy Based Link Prioritization for Cooperative Wireless Networks-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedateJUN 25-29, 2018-
local.bibliographicCitation.conferencename14th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC)-
local.bibliographicCitation.conferenceplaceLimassol, CYPRUS-
dc.identifier.epage855-
dc.identifier.spage850-
local.format.pages6-
local.bibliographicCitation.jcatC1-
dc.description.notes[Raza, Waseem] HITEC Univ, Taxila 47080, Pakistan. [Javaid, Nadeem] COMSATS Inst Informat Technol, Islamabad 44000, Pakistan. [Nasir, Hina] Int Islamic Univ, Islamabad 44000, Pakistan. [Imran, Muhammad] King Saud Univ, Riyadh, Saudi Arabia. [Yasar, Ansar Haque] Hasselt Univ, Transportat Res Inst IMOB, Hasselt, Belgium.-
local.publisher.placeNEW YORK-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
dc.identifier.doi10.1109/IWCMC.2018.8450271-
dc.identifier.isi000447259500145-
local.bibliographicCitation.btitle2018 14TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC)-
item.fulltextWith Fulltext-
item.fullcitationRaza, Waseem; Javaid, Nadeem; Nasir, Hina; Imran, Muhammad & YASAR, Ansar (2018) Buffer Occupancy Based Link Prioritization for Cooperative Wireless Networks. In: 2018 14TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC), IEEE,p. 850-855.-
item.accessRightsRestricted Access-
item.validationecoom 2019-
item.contributorRaza, Waseem-
item.contributorJavaid, Nadeem-
item.contributorNasir, Hina-
item.contributorImran, Muhammad-
item.contributorYASAR, Ansar-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
raza2018.pdf
  Restricted Access
Published version1.15 MBAdobe PDFView/Open    Request a copy
Show simple item record

SCOPUSTM   
Citations

2
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

1
checked on May 8, 2024

Page view(s)

16
checked on Sep 7, 2022

Download(s)

4
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


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