High-Throughput Routing with Superposition Coding and Successive Interference Cancellation

Su, Xueyuan; Chan, Sammy

doi:10.1109/icc.2011.5962789

Cited by 7 publications

(5 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That is, both frameworks have exponential computational complexity. An ETT (Expected Transmission Time) based SIC-aware metric is proposed in [18]. Unfortunately, this metric cannot reflect path bandwidth directly.…”

Section: Related Workmentioning

confidence: 99%

“…In this subsection, we compare our routing protocol (BARS) with HCR (Hop Count Routing) and S3 (Source Routing, Superposition coding, and Successive interference cancellation) [18]. S3 adopts a metric called iETT which is extended from ETT by considering link interference, SIC, and superposition coding opportunities.…”

Section: B Performance Of Bandwidth-aware Routing Protocol With Sic mentioning

confidence: 99%

See 1 more Smart Citation

Bandwidth-Aware High-Throughput Routing With Successive Interference Cancelation in Multihop Wireless Networks

Liu

Shi

Lui³

et al. 2015

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Successive Interference Cancellation (SIC) is a new physical layer technique that enables the receiver to decode composite signals from multiple transmitters sequentially. The introduction of SIC improves the path bandwidth. In this paper, we focus on the design of bandwidth-aware routing protocol with SIC, aiming at achieving high overall end-to-end throughput. We develop an SICable condition for a routing protocol to identify beneficial SIC opportunities that improve spatial reuse without impacting transmission quality. To further explore the benefits of SIC, we formulate the problem of SIC-aware path bandwidth computation as a linear program, and design a distributed heuristic algorithm with polynomial complexity. A routing metric capturing the benefit of SIC in terms of bandwidth and network resource is proposed, by which our routing protocol can choose a path satisfying the bandwidth requirement of the current flow and reserving more network resource for the subsequent ones. Simulation results show that our routing protocol achieves significant gains in network throughput and SIC ratio compared with other routing protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: B Performance Of Bandwidth-aware Routing Protocol With Sic mentioning

confidence: 99%

Bandwidth-Aware High-Throughput Routing With Successive Interference Cancelation in Multihop Wireless Networks

Liu

Shi

Lui³

et al. 2015

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…On the other hand, some other studies [18,19] explore simultaneous transmission opportunities by defining routing metrics that can capture the effect of SIC. To briefly sum up, all these studies aim for improving the throughput performance by exploiting all available transmissions in the entire network.…”

Section: Related Workmentioning

confidence: 99%

Joint spectrum-efficient routing and scheduling with successive interference cancellation in multihop wireless networks

et al. 2015

View full text Add to dashboard Cite

Spectrum-efficient routing has been subject to interest in the recent literature. The underlying scheduling scheme, however, assumes interference is harmful and concurrent neighboring transmissions are forbidden, and thus the Spectral Efficiency (SE) performance is restricted to some extent. In this paper, we propose a novel joint routing and scheduling scheme with Successive Interference Cancellation (SIC) to exploit interference in multihop wireless networks, such that the SE can be greatly improved. Specifically, we first devise an interesting transmission strategy that applies SIC to explore concurrent neighboring transmission opportunities on an arbitrary path. To maximize the SE benefit brought by concurrent neighboring transmissions, two low-complexity routing algorithms are then presented. Furthermore, based on theoretical analysis, closed-form expressions of approximate SE bound are derived and shown to be very accurate in terms of key network parameters. Numerous simulation results verify that significant SE gains can be obtained through SIC.

show abstract

“…A considerable amount of literature has been published on interference coordination [26]. Among these studies, only a couple of papers [27]- [36] focused on applying SIC or SC to the scheduling and routing scheme so far. A source routing with SIC and SC applied (S3) protocol was proposed in [27].…”

Section: Introductionmentioning

confidence: 99%

“…Among these studies, only a couple of papers [27]- [36] focused on applying SIC or SC to the scheduling and routing scheme so far. A source routing with SIC and SC applied (S3) protocol was proposed in [27]. It introduced the interference aware expected transmission time as the routing metric, but the effect that interference coordination enables the receiver to partially cancel the interfering signals was not analyzed.…”

Section: Introductionmentioning

confidence: 99%

A Low-Latency Interference Coordinated Routing for Wireless Multi-Hop Networks

et al. 2021

View full text Add to dashboard Cite

Recently, there has been an increasing interest in exploiting interference cancelation to support multiple adjacent concurrent transmissions instead of avoiding interference through scheduling. In line with these efforts, this paper propose an interference coordinated routing (ICR) scheme for wireless multi-hop networks to achieve more transmission concurrence, and thus lower the end-to-end delay. The proposed ICR scheme firstly constructs an initial path by the interference-aware routing algorithm, which captures the end-to-end latency and spatial resource cost as the routing metrics. Then, to analyze the feasibility of concurrent transmission for a given link set, we consider the interference coordination and formulate the concurrent transmission of multiple links as a linear programming (LP) problem. The solution to the LP problem indicates the power allocation. Finally, a distributed guard zone based selection (GBS) algorithm is further proposed to iteratively explore the maximum feasible link set for each time slot. The selected links are simultaneously active for packet transmission with the allocated power in the current time slot, and the remaining links will be put off to the next. Simulation results confirm that ICR reduces the end-to-end delay by 9.16% to 73.82%, and promotes better transmission concurrence compared with the existing schemes.

show abstract

High-Throughput Routing with Superposition Coding and Successive Interference Cancellation

Cited by 7 publications

References 37 publications

Bandwidth-Aware High-Throughput Routing With Successive Interference Cancelation in Multihop Wireless Networks

Bandwidth-Aware High-Throughput Routing With Successive Interference Cancelation in Multihop Wireless Networks

Joint spectrum-efficient routing and scheduling with successive interference cancellation in multihop wireless networks

A Low-Latency Interference Coordinated Routing for Wireless Multi-Hop Networks

Contact Info

Product

Resources

About