Effects of MAC Approaches on Non-Monotonic Saturation with COPE - A Simple Case Study

We construct a simple network model to provide insight into network design strategies. We show that the model can be used to address various approaches to network coding, MAC, and multi-packet reception so that their effects on network throughput can be evaluated. We consider several topology components which exhibit the same non-monotonic saturation behavior found within the Katti et. al. COPE experiments. We further show that fairness allocation by the MAC can seriously impact performance and cause this non-monotonic saturation. Using our model, we develop a MAC that provides monotonic saturation, higher saturation throughput gains and fairness among flows rather than nodes. The proposed model provides an estimate of the achievable gains for the cross-layer design of network coding, multi-packet reception, and MAC showing that super-additive throughput gains on the order of six times that of routing are possible.United States. Dept. of Defense (Air Force Contract FA8721-05-C-0002)Irwin Mark Jacobs and Joan Klein Jacobs Presidential FellowshipInformation Systems of ASD(R&E

Performance analysis and protocol design for multipacket reception in wireless networks.

Zheng, Pengxuan.Thesis (M.Phil.)--Chinese University of Hong Kong, 2007.Includes bibliographical references (leaves 53-57).Abstracts in English and Chinese.Abstract --- p.iAcknowledgments --- p.vTable of Contents --- p.viList of Figures --- p.viiiList of Tables --- p.ixChapter Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Motivation --- p.1Chapter 1.2 --- Related Work --- p.2Chapter 1.3 --- Our Contribution --- p.3Chapter 1.4 --- Organization of the Thesis --- p.4Chapter Chapter 2 --- Background Overview --- p.6Chapter 2.1.1 --- Traditional Wireless Networks --- p.6Chapter 2.2 --- Exponential Backoff --- p.7Chapter 2.2.1 --- Introduction --- p.7Chapter 2.2.2 --- Algorithm --- p.8Chapter 2.2.3 --- Assumptions --- p.9Chapter 2.3 --- System Description --- p.9Chapter 2.3.1 --- MPR Capability --- p.9Chapter 2.3.2 --- Backoff Slot --- p.10Chapter 2.3.3 --- Carrier-sensing and Non-carrier-sensing Systems --- p.11Chapter Chapter 3 --- Multipacket Reception in WLAN --- p.12Chapter 3.1 --- MAC Protocol Description --- p.13Chapter 3.2 --- Physical Layer Methodology --- p.16Chapter 3.2.1 --- Blind RTS Separation --- p.17Chapter 3.2.2 --- Data Packet Detection --- p.19Chapter Chapter 4 --- Exponential Backoff with MPR --- p.21Chapter 4.1 --- Analytical Model --- p.22Chapter 4.1.1 --- Markov Model --- p.22Chapter 4.1.2 --- Relations betweenpt andpc --- p.23Chapter 4.2 --- Simulation Settings --- p.26Chapter 4.3 --- Asymptotic Behavior of Exponential Backoff --- p.27Chapter 4.3.1 --- Convergence ofpt andpc --- p.27Chapter 4.3.2 --- Convergence of Npt --- p.29Chapter Chapter 5 --- Non-carrier-sensing System --- p.31Chapter 5.1 --- Performance Analysis --- p.31Chapter 5.1.1 --- Throughput Derivation --- p.31Chapter 5.1.2 --- Throughput Analysis --- p.32Chapter 5.1.3 --- Convergence of S --- p.36Chapter 5.2 --- Infinite Population Model --- p.38Chapter 5.2.1 --- Attempt Rate --- p.38Chapter 5.2.2 --- Asymptotic Throughput of Non-carrier-sensing System --- p.39Chapter Chapter 6 --- Carrier-sensing System --- p.43Chapter 6.1 --- Throughput Derivation --- p.43Chapter 6.2 --- Asymptotic Behavior --- p.44Chapter Chapter 7 --- General MPR Model --- p.48Chapter Chapter 8 --- Conclusions --- p.51Bibliography --- p.5

MAC Centered Cooperation - Synergistic Design of Network Coding, Multi-Packet Reception, and Improved Fairness to Increase Network Throughput

We design a cross-layer approach to aid in develop- ing a cooperative solution using multi-packet reception (MPR), network coding (NC), and medium access (MAC). We construct a model for the behavior of the IEEE 802.11 MAC protocol and apply it to key small canonical topology components and their larger counterparts. The results obtained from this model match the available experimental results with fidelity. Using this model, we show that fairness allocation by the IEEE 802.11 MAC can significantly impede performance; hence, we devise a new MAC that not only substantially improves throughput, but provides fairness to flows of information rather than to nodes. We show that cooperation between NC, MPR, and our new MAC achieves super-additive gains of up to 6.3 times that of routing with the standard IEEE 802.11 MAC. Furthermore, we extend the model to analyze our MAC's asymptotic and throughput behaviors as the number of nodes increases or the MPR capability is limited to only a single node. Finally, we show that although network performance is reduced under substantial asymmetry or limited implementation of MPR to a central node, there are some important practical cases, even under these conditions, where MPR, NC, and their combination provide significant gains

On the Throughput Region of Wireless Random Access Protocols with Multi-Packet Reception using Multi-Objective Optimization

This article belongs to the Special Issue Selected Papers from the Seventh International Conference on Innovative Computing Technology (INTECH 2017).This paper presents a new approach for the analysis and characterization of the throughput region of wireless random access protocols enabled with multi-packet reception (MPR) capabilities. The derivation of a closed-form expression for the envelope of the throughput region under the assumption of an arbitrary number of terminals is an open issue in the literature. To partially fill this gap, a new method based on multi-objective optimization tools is herein presented. This innovative perspective allows us to identify the envelope of the throughput region as the Pareto frontier solution that results from maximizing simultaneously all individual terminal throughput functions. To simplify this problem, a modified MPR model is proposed that mimics the conditions of collision model protocols, but it also inserts new physical (PHY) layer features that allow concurrent transmission or MPR. The N-reception model is herein introduced, where collisions of up to N signals are assumed to be always correctly resolved from a population of J terminals, where N can be related to the number of antennas or degrees of freedom of the PHY-layer used at the receiver to resolve a collision. It is shown that by using this model and under the assumption of N=J−1 , the Pareto frontier expression can be obtained as a simple extension of the ALOHA solution. Unfortunately, for cases with N<J−1 , the structure of the resulting determinant matrix does not allow for a simple explicit solution. To overcome this issue, a symmetrical system is proposed, and the solution is obtained by the analysis of the roots of the resulting polynomial expression. Based on this result, an equivalent sub-optimal solution for the asymmetrical case is herein identified for systems where N<J−1 . An extension to more general reception models based on conditional reception probabilities is also presented using the proposed equivalence between the symmetric and asymmetric solutions. The results intend to shed light on the performance of MPR systems in general, and in particular to advance towards the solution of the conjecture of the equivalence between throughput and stability regions in random access.info:eu-repo/semantics/publishedVersio

Topology-Transparent Scheduling in Mobile Ad Hoc Networks With Multiple Packet Reception Capability

Recent advances in the physical layer have enabled wireless devices to have multiple packet reception (MPR) capability, which is the capability of decoding more than one packet, simultaneously, when concurrent transmissions occur. In this paper, we focus on the interaction between the MPR physical layer and the medium access control (MAC) layer. Some random access MAC protocols have been proposed to improve the network performance by exploiting the powerful MPR capability. However, there are very few investigations on the schedule-based MAC protocols. We propose a novel m-MPR-l-code topology-transparent scheduling ((m, l)-TTS) algorithm for mobile ad hoc networks with MPR, where m indicates the maximum number of concurrent transmissions being decoded, and l is the number of codes assigned to each user. Our algorithm can take full advantage of the MPR capability to improve the network performance. The minimum guaranteed throughput and average throughput of our algorithm are studied analytically. The improvement of our (m, l)-TTS algorithm over the conventional topology-transparent scheduling algorithms with the collision-based reception model is linear with m. The simulation results show that our proposed algorithm performs better than slotted ALOHA as well.published_or_final_versio