Capturing Successive Interference Cancellation in A Joint Routing and Scheduling Algorithm for Wireless Communication Networks

Rakhshan, Ali

Publication:
Capturing Successive Interference Cancellation in A Joint Routing and Scheduling Algorithm for Wireless Communication Networks

dc.contributor.advisor	Dennis L. Goeckel
dc.contributor.author	Rakhshan, Ali
dc.contributor.department	University of Massachusetts Amherst
dc.contributor.department	Electrical & Computer Engineering
dc.date	2023-09-23T07:47:18.000
dc.date.accessioned	2024-04-26T20:36:25Z
dc.date.available	2013-03-20T00:00:00Z
dc.date.issued	2013-01-01
dc.date.submitted	May
dc.description.abstract	Interference limits the throughput of modern wireless communication networks, and thus the successful mitigation of interference can have a significant impact on network performance. Successive interference cancellation (SIC) has emerged as a promising physical layer method, where multiple packets received simultaneously need not be treated as a ``collision'' requiring retransmission; rather, under certain conditions, all of the packets can be decoded. Obviously, using SIC can thus serve as an important design element that can provide higher performance for the network. However, it also requires a rethinking of the way that traditional routing and scheduling algorithms, which are designed for a traditional physical layer, are developed. In order to consider routing and scheduling over a physical layer employing SIC, some tools such as the oft-employed conflict graph need to be modified. In particular, a notion of links interfering with other links ``indirectly'' is required, and this issue has been ignored in many past works. Therefore, considering the dependencies and interferences between links, a joint routing and scheduling algorithm that employs an understanding of the SIC that will be employed at the physical layer is presented and shown to surpass previous algorithms. We know that the maximum throughput scheduling problem is NP-hard. On the other hand, even if we can reach maximum throughput scheduling, while being throughput efficient, it can result in highly unfair rates among the users. Hence, proportional fairness is developed in the proposed algorithm.
dc.description.degree	Master of Science in Electrical and Computer Engineering (M.S.E.C.E.)
dc.identifier.doi	https://doi.org/10.7275/3934742
dc.identifier.uri	https://hdl.handle.net/20.500.14394/44513
dc.relation.url	https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=2146&context=theses&unstamped=1
dc.source.status	published
dc.subject	Wireless Communication Networks
dc.subject	Successive Interference Cancellation
dc.subject	Joint Routing and Scheduling Algorithm
dc.subject	Systems and Communications
dc.title	Capturing Successive Interference Cancellation in A Joint Routing and Scheduling Algorithm for Wireless Communication Networks
dc.type	campus
dc.type	article
dc.type	thesis
digcom.contributor.author	isAuthorOfPublication\|email:arakhsha@engin.umass.edu\|institution:University of Massachusetts Amherst\|Rakhshan, Ali
digcom.date.embargo	2013-03-20T00:00:00-07:00
digcom.identifier	theses/1080
digcom.identifier.contextkey	3934742
digcom.identifier.submissionpath	theses/1080
dspace.entity.type	Publication