In recent years, a significant amount of research has been conducted to explore the benefits of network coding in different scenarios, from both theoretical and simulation perspectives. In this paper, we utilize queueing theory to propose an analytical framework for bidirectional unicast flows in multi-hop wireless mesh networks, and study throughput of inter-flow network coding. We analytically determine performance metrics such as the probability of successful transmission in terms of collision probability, and feedback mechanism and retransmission. Regarding the coding process, our model uses a multi-class queueing network where coded packets are separated from native packets and have a non-preemptive higher priority over native packets, and both queues are in a stable state. Finally, we use simulations to verify the accuracy of our analytical model.
Furthermore, @cite_11 propose an analytical framework for bidirectional unicast flows in multi-hop wireless networks. Their work considers collision and different interference levels in CSMA CA (Carrier Sense Multiple Access with Collision Avoidance) by varying carrier-sensing range and signal-to-interference ratio to maximize the throughput in different retransmission schemes. Although their scenario is similar to ours, our work is different in the following aspects: 1) in contrast to their approach, in our model, if a node has a transmission opportunity, it does not delay forwarding native packets to generate coded packets; 2) their focus is on saturated queues, while we work on stable queues.
@cite_11
2143337235 2292788438 2002627759 2428791585
In this paper, we consider the CSMA CA multihop networks where the two end-nodes transmit their packets to each other and each intermediate node adopts network coding for delivering bidirectional flows. In addition, the neighbor nodes are randomly uniformly deployed with the Poisson Point Process. By varying the combination of the physical carrier-sensing range of the transmitter node and the target signal-to-interference ratio (SIR) set by the receiver node, we can control the interference level in the network and the degree of spatial reuse of a frequency band. The larger the carrier-sensing range is, the smaller the interference level, while the smaller the opportunity of getting a channel by a node. Similarly, the higher the target SIR value is, the more probable the retransmission (by the exponential random backoff) is, while the better the link quality on successful transmission is getting. Under this tradeoff context, we find the optimal combinations of these two factors that make the end-to-end throughput of the flow maximal for three different retransmission schemes. In this paper, we propose a distributed multi-hop interference avoidance algorithm, namely, IAA to avoid co-channel interference inside a wireless body area network (WBAN). Our proposal adopts carrier sense multiple access with collision avoidance (CSMA CA) between sources and relays and a flexible time division multiple access (FTDMA) between relays and coordinator. The proposed scheme enables low interfering nodes to transmit their messages using base channel. Depending on suitable situations, high interfering nodes double their contention windows (CW) and probably use switched orthogonal channel. Simulation results show that proposed scheme has far better minimum SINR (12dB improvement) and longer energy lifetime than other schemes (power control and opportunistic relaying). Additionally, we validate our proposal in a theoretical analysis and also propose a probabilistic approach to prove the outage probability can be effectively reduced to the minimal. Due to a poor understanding of the interactions among transmitters, wireless multihop networks have commonly been stigmatized as unpredictable in nature. Even elementary questions regarding the throughput limitations of these networks cannot be answered in general. In this paper we investigate the behavior of wireless multihop networks using carrier sense multiple access with collision avoidance (CSMA CA). Our goal is to understand how the transmissions of a particular node affect the medium access, and ultimately the throughput, of other nodes in the network. We introduce a theory which accurately models the behavior of these networks and show that, contrary to popular belief, their performance is easily predictable and can be described by a system of equations. Using the proposed theory, we provide the analytical expressions necessary to fully characterize the capacity region of any wireless CSMA CA multihop network. We show that this region is nonconvex in general and entirely agnostic to the probability distributions of all network parameters, depending only on their expected values. Due to a poor understanding of the interactions among transmitters, wireless networks using carrier sense multiple access with collision avoidance (CSMA CA) have been commonly stigmatized as unpredictable in nature. Even elementary questions regarding the throughput limitations of these networks cannot be answered in general. In this paper, we investigate the behavior of wireless CSMA CA networks to understand how the transmissions of a particular node affect the medium access, and ultimately the throughput, of other nodes in the network. We introduce a theory which accurately models the behavior of these networks and show that, contrary to popular belief, their performance is predictable and can be described by a system of equations. Using the proposed theory, we provide the analytical expressions necessary to fully characterize the capacity region of any wireless CSMA CA network. We show that this region is nonconvex in general and agnostic to the probability distributions of all network parameters, depending only on their expected values. Our theory is also shown to extend naturally to time division multiple access (TDMA) networks and to predict how the network responds to infeasible input rates.