Performance Evaluation of Flow Allocation with Successive Interference Cancelation for Random Access WMNs

In this study we explore the performance gain that can be achieved at the network level by employing successive interference cancelation (SIC) instead of treating interference as noise for random access wireless mesh networks with multi-packet reception capabilities. More precisely we explore both the throughput and the delay of a distributed flow allocation scheme aimed at maximizing average aggregate flow throughput while also providing bounded delay combined with SIC. Simulation results derived from three simple topologies show that the gain over treating interference as noise for this scheme can be up to $15\%$ for an SINR threshold value equal to $0.5$. For SINR threshold values as high as $2.0$ however, this gain is either insignificant or treating interference as noise proves a better practice. The reason is that although SIC improves the throughput on a specific link, it also increases the interference imposed on neighboring receivers. We also show that the gain of applying SIC is more profound in cases of a large degree of asymmetry among interfering links.Comment: arXiv admin note: text overlap with arXiv:1406.630

On the Performance of Network Coding and Forwarding Schemes with Different Degrees of Redundancy for Wireless Mesh Networks

This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an analytical framework for modeling the throughput and delay for various schemes considering wireless mesh networks where, unicast traffic is forwarded and hop-by-hop retransmissions are employed for achieving reliability. The analytical framework is generalized for an arbitrary number of paths and hops per path. Another key contribution of the study is the evaluation and extension of the numerical results drawn from the analysis through NS-2 simulations. Our results show that in scenarios with significant interference the best throughput-delay tradeoff is achieved by single path forwarding. Moreover, when significant interference is present and network coding employs the larger packet generation size it experiences higher delay than all other schemes due to the inter-arrival times aggregating over all coded packets required to decode a packet generation.Comment: Submitted for journal publicatio