Generalized routing protocols for multihop relay networks

Handle URI:
http://hdl.handle.net/10754/564398
Title:
Generalized routing protocols for multihop relay networks
Authors:
Khan, Fahd Ahmed; Yilmaz, Ferkan; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
Performance of multihop cooperative networks depends on the routing protocols employed. In this paper we propose the last-n-hop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol for the routing of data through multihop relay networks. The average symbol error probability performance of the schemes is analysed by simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forward-backward variant. Furthermore we also compute the complexity of the protocols in terms of number of channel state information required and the number of comparisons required for routing the signal through the network. © 2011 IEEE.
KAUST Department:
Electrical Engineering Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Physical Sciences and Engineering (PSE) Division; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2011 7th International Wireless Communications and Mobile Computing Conference
Conference/Event name:
7th International Wireless Communications and Mobile Computing Conference, IWCMC 2011
Issue Date:
Jul-2011
DOI:
10.1109/IWCMC.2011.5982641
Type:
Conference Paper
ISBN:
9781424495399
Appears in Collections:
Conference Papers; Physical Sciences and Engineering (PSE) Division; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorKhan, Fahd Ahmeden
dc.contributor.authorYilmaz, Ferkanen
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2015-08-04T06:26:13Zen
dc.date.available2015-08-04T06:26:13Zen
dc.date.issued2011-07en
dc.identifier.isbn9781424495399en
dc.identifier.doi10.1109/IWCMC.2011.5982641en
dc.identifier.urihttp://hdl.handle.net/10754/564398en
dc.description.abstractPerformance of multihop cooperative networks depends on the routing protocols employed. In this paper we propose the last-n-hop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol for the routing of data through multihop relay networks. The average symbol error probability performance of the schemes is analysed by simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forward-backward variant. Furthermore we also compute the complexity of the protocols in terms of number of channel state information required and the number of comparisons required for routing the signal through the network. © 2011 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectAmplify-and-Forwarden
dc.subjectMultihop transmissionen
dc.subjectRelay clustersen
dc.subjectRoutingen
dc.titleGeneralized routing protocols for multihop relay networksen
dc.typeConference Paperen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentPhysical Sciences and Engineering (PSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2011 7th International Wireless Communications and Mobile Computing Conferenceen
dc.conference.date4 July 2011 through 8 July 2011en
dc.conference.name7th International Wireless Communications and Mobile Computing Conference, IWCMC 2011en
dc.conference.locationIstanbulen
kaust.authorKhan, Fahd Ahmeden
kaust.authorYilmaz, Ferkanen
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.