This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Effective Carrier Sensing in CSMA Networks under Cumulative Interference

Liqun Fu, Soung Chang Liew, Jianwei Huang This work was supported by two Competitive Earmarked Research Grants (Project Number 414507 and Project Number 412308) established under the University Grant Committee of the Hong Kong Special Administrative Region, China, the Direct Grant (Project Number C001-2050398) of The Chinese University of Hong Kong, and the National Key Technology R&D Program (Project Number 2007BAH17B04) established by the Ministry of Science and Technology of the People’s Republic of China. Department of Information Engineering
The Chinese University of Hong Kong
Shatin, New Territories, Hong Kong
Email: {lqfu6,soung,jwhuang}@ie.cuhk.edu.hk
Abstract

This paper proposes and investigates the concept of a safe carrier-sensing range that can guarantee interference-safe (also termed hidden-node-free) transmissions in CSMA networks under the cumulative interference model. Compared with the safe carrier-sensing range under the commonly assumed but less realistic pairwise interference model, we show that the safe carrier-sensing range required under the cumulative interference model is larger by a constant multiplicative factor. For example, if the SINR requirement is 10dB10dB and the path-loss exponent is 44, the factor is 1.41.4. The concept of a safe carrier-sensing range, although amenable to elegant analytical results, is inherently not compatible with the conventional power-threshold carrier-sensing mechanism (e.g., that used in IEEE 802.11). Specifically, the absolute power sensed by a node in the conventional mechanism does not contain enough information for it to derive its distances from other concurrent transmitter nodes. We show that, fortunately, a carrier-sensing mechanism called Incremental-Power Carrier-Sensing (IPCS) can realize the carrier-sensing range concept in a simple way. Instead of monitoring the absolute detected power, the IPCS mechanism monitors every increment in the detected power. This means that IPCS can separate the detected power of every concurrent transmitter, and map the power profile to the required distance information. Our extensive simulation results indicate that IPCS can boost spatial reuse and network throughput by more than 60%60\% relative to the conventional carrier-sensing mechanism. Last but not least, IPCS not only allows us to implement our safe carrier-sensing range, it also ties up a loose end in many other prior theoretical works that implicitly assume the use of a carrier-sensing range (safe or otherwise) without an explicit design to realize it.

Index Terms:
carrier-sensing range, cumulative interference model, CSMA, WiFi, IEEE 802.11, SINR constraints, spatial reuse.

I Introduction and Overview

Due to the broadcast nature of wireless channels, signals transmitted over wireless links can mutually interfere with each other. How to optimize spatial reuse and network throughput under such mutual interferences has been an intensely studied issue in wireless networking. In particular, it is desirable to allow as many links as possible to transmit together in an interference-safe (or collision-free) manner. The problem of interference-safe transmissions under the coordination of a centralized TDMA (Time-Division Multiple-Access) scheduler has been well studied (e.g., see [1, 2, 3, 4, 5, 6]). Less well understood is the issue of interference-safe transmissions under the coordination of a distributed scheduling protocol.

The CSMA (Carrier-Sense Multiple-Access) protocol, such as IEEE 802.11, is the most widely adopted distributed scheduling protocol in practice. As the growth of 802.11 network deployments continues unabated, we are witnessing an increasing level of mutual interference among transmissions in such networks. It is critical to establish a rigorous conceptual framework upon which effective solutions to interference-safe transmissions can be constructed.

Within this context, this paper has three major contributions listed as follows (more detailed overview is given in the succeeding paragraphs):

  1. 1.

    We propose the concept of a safe carrier-sensing range that can guarantee interference-safe transmissions in CSMA networks under the cumulative interference model.

  2. 2.

    We show that the concept is implementable using a very simple Incremental-Power Carrier-Sensing (IPCS) mechanism.

  3. 3.

    We demonstrate that implementation of safe carrier-sensing range under IPCS can significantly improve spatial reuse and network throughput as compared to the conventional absolute-power carrier sensing mechanism.

Regarding 1), this paper considers the cumulative interference model (also termed physical interference model in [7]), in which the interference at a receiver node ii consists of the cumulative power received from all the other nodes that are currently transmitting (except its own transmitter). This model is known to be more practical and much more difficult to analyze than the widely studied pairwise interference model (also termed the protocol interference model in [7]) in the literature. Under the cumulative interference model, a set of simultaneously transmitting links are said to be interference-safe if the SINRs (Signal-to-Interference-plus-Noise Ratios) at the receivers of all these links are above a threshold. Given a set of links \mathcal{L} in the network, there are many subsets of links, 𝒮\mathcal{S}\subset\mathcal{L}, that are interference-safe. The set of all such subsets ={𝒮the SINR requirements of all links are satisfied}\mathcal{F}=\{\mathcal{S}\mid\text{the SINR requirements of all links are satisf\/ied}\} constitutes the feasible interference-safe state space. For centralized TDMA, all subsets are available for scheduling, and a TDMA schedule is basically a sequence (𝒮t)t=1n(\mathcal{S}_{t})_{t=1}^{n} where each 𝒮t\mathcal{S}_{t}\in\mathcal{F}. For CSMA, because of the random and distributed nature of the carrier-sensing operations by individual nodes, the simultaneously transmitting links 𝒮CS\mathcal{S}^{CS} may or may not belong to \mathcal{F}. Let CS={𝒮CSsimultaneous transmissions of links in 𝒮CS are allowed by 
the carrier-sensing operation
}
\mathcal{F}^{CS}=\{\mathcal{S}^{CS}\mid\text{simultaneous }\text{transmissions of links in }\mathcal{S}^{CS}\text{ are allowed by }\\ \text{the carrier-sensing operation}\}
. The CSMA network is said to be interference-safe if CS\mathcal{F}^{CS}\subseteq\mathcal{F}. This is also the condition for the so-called hidden-node free operation [8]. However, this issue was studied under the context of an idealized pairwise interference model [8] rather than the practical cumulative interference model of interest here. In this paper, we show that if the carrier-sensing mechanism can guarantee that the distance between every pair of transmitters is separated by a safe carrier-sensing range, then CS\mathcal{F}^{CS}\subseteq\mathcal{F} can be guaranteed and the CSMA network is interference-safe even under a cumulative interference model. We believe that the safe carrier-sensing range established in this paper is a tight upperbound and achieves good spatial reuse. Another issue is how to implement the concept of safe carrier-sensing range in practice.

This brings us to 2) above. In traditional carrier sensing based on power threshold (e.g., that of the basic mode in IEEE 802.11), the absolute power received is being monitored. This power consists of the sum total of powers received from all the other transmitters. It is impossible to infer from this absolute power the exact separation of the node from each of the other transmitters. This leads to subpar spatial reuse. Fortunately, we show that a simple mechanism that monitors the incremental power changes over time, IPCS, will enable us to map the power profile to the required distance information. We believe that this contribution, although simple, is significant in that it shows that the theoretical concept of safe carrier-sensing range can be implemented rather easily in practice. It also ties up a loose end in many other prior theoretical works that implicitly assume the use of a carrier-sensing range (safe or otherwise) without an explicit design to realize it. That is, IPCS can be used to implement the required carrier-sensing range in these works, not just our safe carrier-sensing range here. Without IPCS, and using only the conventional carrier-sensing mechanism, the results in these prior works would have been overly optimistic. Given the implementability of safe carrier-sensing range, the next issue is how tight the simultaneously transmitting nodes can be packed.

This brings us to 3) above. In the conventional carrier sensing mechanism, in order that the detected absolute power is below the carrier-sensing power threshold, the separation between a newly active transmitter and other existing active transmitters must increase progressively as the number of concurrent transmissions increases. That is, the cost of ensuring interference-safe transmissions becomes progressively higher and higher in the “packing process”. This reduces spatial reuse and the overall network throughput. Fortunately, with IPCS, the required separation between any pair of active transmitters remains constant as the safe carrier-sensing range which is independent of the number of concurrent transmissions. Indeed, our simulation results indicate that compared to the conventional carrier-sensing mechanism, IPCS mechanism improves the spatial reuse and the network throughput by more than 60%60\%.

I-A Related Work

In the literature, most studies on carrier sensing (e.g., [10, 8, 13, 11, 9, 12]) are based on the pairwise interference model. For a link under the pairwise interference model, the interferences from the other links are considered one by one. If the interference from each of the other links on the link concerned does not cause a collision, then it is assumed that there is no collision overall. Ref. [8] established the carrier-sensing range required to prevent hidden-node collisions in CSMA networks under the pairwise interference model. The resulting carrier-sensing range is too optimistic and can not eliminate hidden-node collisions if the more accurate cumulative interference model is adopted instead.

A number of recent papers studied the CSMA networks under the cumulative interference model (e.g., [14, 15, 16, 17]). An earlier unpublished technical report of ours [17] derived the safe carrier-sensing range under the cumulative interference model. The technical report, however, did not include the IPCS realization presented in this paper. Neither did Ref. [14, 15, 16] address the implementation of a carrier-sensing range based on power detection. Ref. [14] studied the asymptotic capacity of large-scale CSMA networks with hidden-node-free designs. The focus of [14] is on “order” result rather than “tight” result. For example, if γ0=10dB\gamma_{0}=10dB and α=4\alpha=4, the safe carrier-sensing range derived in [14] is 8.75dmax8.75d_{\max}. In this paper, we show that setting the safe carrier-sensing range to 5.27dmax5.27d_{\max} is enough to prevent hidden-node collisions.

The authors in [15, 16] attempted to improve spatial reuse and capacity by tuning the transmit power and the carrier-sensing range. Although the cumulative interference model is considered in [15, 16], spatial reuse and capacity are analyzed based on carrier-sensing range. In particular, they assumed that the transmitters of concurrent transmission links can be uniformly packed in the network. As discussed in this paper, such uniform packing can not be realized using the current 802.11 carrier-sensing mechanism. Therefore, the results in [15, 16] are overly optimistic without an appropriate carrier-sensing mechanism. IPCS fills this gap so that the theoretical results of [15, 16] remain valid. We summarize the key related models and results in the literature in Table I***This paper focuses on the incremental-power carrier-sensing (IPCS) mechanism under the cumulative interference model. But IPCS proposed in this paper can also deal with the pairwise interference model..

TABLE I: Summary of the Related Work
Interference Models Pairwise Interference Model Cumulative Interference Model
Absolute power carrier sensing many (e.g., [8, 10]) [15, 16]
Incremental power carrier sensing This paper This paper

The rest of this paper is organized as follows. Section II presents the cumulative interference model and the carrier sensing mechanism in the current 802.11 protocol. Section III derives the safe carrier-sensing range that successfully prevents the hidden-node collisions under the cumulative interference model. Section IV presents the IPCS mechanism. Section V evaluates the performance of IPCS in terms of spatial reuse and network throughput. Section VI concludes this paper.

II System Model

II-A Cumulative Interference Model

We represent links in a wireless network by a set of distinct and directed transmitter-receiver pairs ={li,1i||}\mathcal{L}=\{l_{i},1\leq i\leq{\left|\mathcal{L}\right|}\}. Let 𝒯={Ti,1i||}\mathcal{T}=\{T_{i},1\leq i\leq{\left|\mathcal{L}\right|}\} and ={Ri,1i||}\mathcal{R}=\{R_{i},1\leq i\leq{\left|\mathcal{L}\right|}\} denote the set of transmitter nodes and the set of receiver nodes, respectively. A receiver decodes its signal successfully if and only if the received Signal-to-Interference-plus-Noise Ratio (SINR) is above a certain threshold. We adopt the cumulative interference model, where the interference is the sum of the received powers from all transmitters except its own transmitter. We assume that radio signal propagation follows the log-distance path model with path loss exponent α>2\alpha>2. The path gain G(Ti,Rj)G(T_{i},R_{j}) from transmitter TiT_{i} to receiver RjR_{j} follows a geometric model:

G(Ti,Rj)=d(Ti,Rj)α,G(T_{i},R_{j})={d(T_{i},R_{j})}^{-\alpha},

where d(Ti,Rj)d(T_{i},R_{j}) is the Euclidean distance between nodes TiT_{i} and RjR_{j}.

In 802.11, each packet transmission on a link lil_{i} consists of a DATA frame in the forward direction (from TiT_{i} to RiR_{i}) followed by an ACK frame in the reverse direction (from RiR_{i} to TiT_{i}). The packet transmission is said to be successful if and only if both the DATA frame and the ACK frame are received correctly. Let \mathcal{L}^{\prime} (′′\mathcal{L}^{\prime\prime}) denote the set of links that transmit concurrently with the DATA (ACK) frame on link lil_{i}. Under the cumulative interference model, a successful transmission on link lil_{i} needs to satisfy the following conditions:

PtG(Ti,Ri)N+ljPtG(Sj,Ri)γ0,(DATA frame)\frac{P_{t}\cdot G(T_{i},R_{i})}{N+\sum\limits_{l_{j}\in\mathcal{L}^{\prime}}{P_{t}\cdot G(S_{j},R_{i})}}\geq{\gamma}_{0},\quad\text{(DATA frame)} (1)

and

PtG(Ri,Ti)N+lj′′PtG(Sj,Ti)γ0,(ACK frame)\frac{P_{t}\cdot G(R_{i},T_{i})}{N+\sum\limits_{l_{j}\in\mathcal{L}^{\prime\prime}}{P_{t}\cdot G(S_{j},T_{i})}}\geq{\gamma}_{0},\quad\text{(ACK frame)} (2)

where PtP_{t} is the transmit power, NN is the average noise power, and γ0\gamma_{0} is the SINR threshold for correct reception. We assume that all nodes in the network use the same transmit power PtP_{t} and adopt the same SINR threshold γ0\gamma_{0}. For a link ljl_{j} in \mathcal{L}^{\prime} or ′′\mathcal{L}^{\prime\prime}, SjS_{j} represents the sender of link ljl_{j}, which can be either TjT_{j} or RjR_{j}. This is because either DATA or ACK transmission on link ljl_{j} will cause interference to link lil_{i}.

II-B Existing Carrier Sensing Mechanism in 802.11

If there exists a link lil_{i}\in\mathcal{L} such that not both (1) and (2) are satisfied, this means there is collision in the network. In 802.11, carrier sensing is designed to prevent collision due to simultaneous transmissions that cause the violation of either (1) or (2). In this paper, we assume carrier sensing by energy detection. Consider a link lil_{i}. If transmitter TiT_{i} senses a power PCS(Ti)P^{CS}(T_{i}) that exceeds a power threshold PthP_{th}, i.e.,

PCS(Ti)>Pth,P^{CS}(T_{i})>P_{th}, (3)

then TiT_{i} will not transmit and its backoff countdown process will be frozen. This will prevent the DATA frame transmission on lil_{i}.

In most studies of 802.11 networks, the concept of a carrier-sensing range CSRCSR is introduced. The carrier-sensing range CSRCSR is mapped from the carrier-sensing power threshold PthP_{th}:

CSR=(PtPth)1α.CSR=\left(\frac{P_{t}}{P_{th}}\right)^{\frac{1}{\alpha}}.

Consider two links, lil_{i} and ljl_{j}. If the distance between transmitters TiT_{i} and TjT_{j} is no less than the carrier-sensing range, i.e.,

d(Ti,Tj)CSR,d(T_{i},T_{j})\geq CSR, (4)

then TiT_{i} and TjT_{j} can not carrier sense each other, and thus can initiate concurrent transmissions between them. The pairwise relationship can be generalized to a set of links 𝒮CS\mathcal{S}^{CS}\subseteq\mathcal{L}. If the condition in (4) is satisfied by all pairs of transmitters in set 𝒮CS\mathcal{S}^{CS}, then all links in 𝒮CS\mathcal{S}^{CS} can transmit concurrently.

Setting an appropriate carrier-sensing range is crucial to the performance of 802.11 networks. If CSRCSR is too large, spatial reuse will be unnecessarily limited. If CSRCSR is not large enough, then hidden-node collisions may occur. The underlying cause of hidden-node collisions are as follows. A number of transmitters transmit simultaneously because condition (4) is satisfied by all pairs of the transmitters. However, there is at least one of the links does not satisfy either (1) or (2). As a result, collisions happen and the carrier sensing mechanism is said to have failed in preventing such collisions.

We now define a safe carrier-sensing range that always prevents the hidden-node collisions in 802.11 networks under the cumulative interference model.

Definition 1 (Safe-CSRcumulativeCSR_{\text{cumulative}})

Let 𝒮CS\mathcal{S}^{CS}\subseteq\mathcal{L} denote a subset of links that are allowed to transmit concurrently under a carrier-sensing range CSRCSR. Let CS={𝒮CS}\mathcal{F}^{CS}=\{\mathcal{S}^{CS}\} denote all such subsets of links in the network. A CSRCSR is said to be a Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} if for any 𝒮CSCS\mathcal{S}^{CS}\in\mathcal{F}^{CS} and for any link li𝒮CSl_{i}\in\mathcal{S}^{CS}, both conditions (1) and (2), with =′′=𝒮CS{li}\mathcal{L}^{\prime}=\mathcal{L}^{\prime\prime}=\mathcal{S}^{CS}\setminus\{l_{i}\}, are satisfied.

For analysis simplicity, we assume that the background noise power NN is small compared with interference and thus can be ignored. We will consider Signal-to-Interference Ratio (SIR) instead of SINR.

III Safe Carrier-sensing Range under Cumulative Interference Model

In this section, we derive a sufficient threshold for Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}}. When discussing the hidden-node free design [8], it is required that the receivers are operated with the “RS (Re-Start) mode” (see Appendix A for details). In the following discussion, we also make the same assumption.

Ref. [8] studied the safe carrier-sensing range under the pairwise interference model. The threshold is given as follows:

Safe-CSRpairwise=(γ01α+2)dmax,\emph{Safe-}CSR_{\text{\emph{pairwise}}}=\left({\gamma_{0}}^{\frac{1}{\alpha}}+2\right)d_{\max}, (5)

where dmax=maxlid(Ti,Ri)d_{\max}=\mathop{\max}\limits_{l_{i}\in\mathcal{L}}d(T_{i},R_{i}) is the maximum link length in the network. However, the pairwise interference model does not take into account the cumulative nature of interferences from other links. The threshold given in (5) is overly optimistic and not large enough to prevent hidden-node collisions under the cumulative interference model, as illustrated by the three-link example in Fig. 1.

Refer to caption
Figure 1: Setting the carrier-sensing range as Safe-CSRpairwiseCSR_{\text{\emph{pairwise}}} is insufficient to prevent hidden-node collisions under the cumulative interference model

In Fig. 1, suppose that the SIR requirement γ0=8\gamma_{0}=8 and the path-loss exponent α=3\alpha=3. According to (5), it is enough to set the carrier-sensing range as (γ01α+2)dmax=4dmax\left({\gamma_{0}}^{\frac{1}{\alpha}}+2\right)d_{\max}=4d_{\max} and the carrier sensing power threshold Pth=Pt(4dmax)3=0.0156Ptdmax3P_{th}=P_{t}\left(4d_{\max}\right)^{-3}=0.0156P_{t}d_{\max}^{-3}. In Fig. 1, there are three links: l1l_{1}, l2l_{2}, and l3l_{3} with the same link length dmaxd_{\max}. The distance d(R1,R2)d(R_{1},R_{2}) equals 2dmax2d_{\max} and the distance d(T1,R3)d(T_{1},R_{3}) equals 4dmax4d_{\max}. Since the distance d(T1,T2)=4dmax=(γ01α+2)dmaxd(T_{1},T_{2})=4d_{\max}=\left({\gamma_{0}}^{\frac{1}{\alpha}}+2\right)d_{\max}, from (II-B), we find that T1T_{1} and T2T_{2} can simultaneously initiate transmissions since they can not carrier sense each other. We can verify that the SIR requirements of both DATA and ACK transmissions on l1l_{1} and l2l_{2} are satisfied. This means l1l_{1} and l2l_{2} can indeed successfully transmit simultaneously.

Suppose that l3l_{3} wants to initiate a transmission when T1T_{1} is sending a DATA frame to R1R_{1} and R2R_{2} is sending an ACK frame to T2T_{2}. Transmitter T3T_{3} senses a power PCS(T3)P^{CS}(T_{3}) given by

PCS(T3)\displaystyle P^{CS}(T_{3}) =Pt(5dmax)3+Pt(8dmax)3\displaystyle=P_{t}\cdot(5d_{\max})^{-3}+P_{t}\cdot(8d_{\max})^{-3}
=0.00995Ptdmax3<Pth.\displaystyle=0.00995\cdot P_{t}d_{\max}^{-3}<P_{th}.

This means that T3T_{3} can not sense the transmissions on l1l_{1} and l2l_{2}, and can initiate a DATA transmission. However, when all these three links are active simultaneously, the SIR at R1R_{1} is

Pt(dmax)3Pt(6dmax)3+Pt(2dmax)3=7.714<γ0.\frac{P_{t}(d_{\max})^{-3}}{{P_{t}(6d_{\max})^{-3}}+{P_{t}(2d_{\max})^{-3}}}=7.714<{\gamma}_{0}.

This means the cumulative interference powers from l2l_{2} and l3l_{3} will corrupt the DATA transmission on l1l_{1} due to the insufficient SIR at R1R_{1}. This example shows that setting the carrier-sensing range as in (5) is not sufficient to prevent collisions under the cumulative interference model.

We next establish a threshold for Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} so that the system will remain safe under cumulative interference.

Theorem 1

The setting

Safe-CSRcumulative=(K+2)dmax,\emph{Safe-}CSR_{\text{\emph{cumulative}}}=(K+2)d_{\max}, (6)

where

K=(6γ0(1+(23)α1α2))1α.K=\left({6\gamma_{0}\left({1+\left({\frac{2}{\sqrt{3}}}\right)^{\alpha}\frac{1}{\alpha-2}}\right)}\right)^{\frac{1}{\alpha}}. (7)

is sufficient to ensure interference-safe transmissions under the cumulative interference model.

Proof:

The proof is given in Appendix B. ∎

Condition (6) provides a sufficiently large carrier-sensing range that prevents the hidden-node collisions in CSMA networks. Therefore, there is no need to set a CSRCSR larger than the value given in (6).

Let us compare Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} with Safe-CSRpairwiseCSR_{\text{\emph{pairwise}}} with different values of γ0\gamma_{0} and α\alpha. For example, if γ0=10\gamma_{0}=10 and α=4\alpha=4, which are typical for wireless communications,

Safe-CSRpairwise=3.78dmax,\displaystyle\text{\emph{Safe-}}CSR_{\text{\emph{pairwise}}}=3.78\cdot d_{\max},
Safe-CSRcumulative=5.27dmax.\displaystyle\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}=5.27\cdot d_{\max}.

Compared with Safe-CSRpairwiseCSR_{\text{\emph{pairwise}}}, Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} needs to be increased by a factor of 1.41.4 to ensure successful transmissions under the cumulative interference model.

Given a fixed path-loss exponent α\alpha, both Safe-CSRpairwiseCSR_{\text{\emph{pairwise}}} and Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} increase in the SIR requirement γ0\gamma_{0}. This is because the separation among links must be enlarged to meet a larger SIR target. For example, if α=4\alpha=4, we have

Safe-CSRpairwise=(2+γ014)dmax,\displaystyle\text{\emph{Safe-}}CSR_{\text{\emph{pairwise}}}=\left(2+\gamma_{0}^{\frac{1}{4}}\right)d_{\max},
Safe-CSRcumulative=(2+(343γ0)14)dmax.\displaystyle\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}=\left(2+\left(\frac{34}{3}\gamma_{0}\right)^{\frac{1}{4}}\right)d_{\max}.

The ratio of Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} to Safe-CSRpairwiseCSR_{\text{\emph{pairwise}}} is

Safe-CSRcumulativeSafe-CSRpairwise=2+(343γ0)142+γ014,\mathop{\frac{\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}}{\text{\emph{Safe-}}CSR_{\text{\emph{pairwise}}}}}=\frac{2+\left({\frac{34}{3}\gamma_{0}}\right)^{\frac{1}{4}}}{2+\gamma_{0}^{\frac{1}{4}}},

which is an increasing function of γ0\gamma_{0}, and converges to a constant as γ0\gamma_{0} goes to infinity:

limγ0Safe-CSRcumulativeSafe-CSRpairwise\displaystyle\mathop{\lim}\limits_{\gamma_{0}\to\infty}\frac{\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}}{\text{\emph{Safe-}}CSR_{\text{\emph{pairwise}}}} =limγ02+(343γ0)142+γ014\displaystyle=\mathop{\lim}\limits_{\gamma_{0}\to\infty}\frac{2+\left({\frac{34}{3}\gamma_{0}}\right)^{\frac{1}{4}}}{2+\gamma_{0}^{\frac{1}{4}}}
=(343)141.8348.\displaystyle=\left({\frac{34}{3}}\right)^{\frac{1}{4}}\approx 1.8348.
Refer to caption
Figure 2: The ratio of Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} to Safe-CSRpairwiseCSR_{\text{\emph{pairwise}}}

Fig. 2 shows the ratio Safe-CSRcumulativeSafe-CSRpairwise\frac{\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}}{\text{\emph{Safe-}}CSR_{\text{\emph{pairwise}}}} as a function of the SIR requirements γ0\gamma_{0}. Different curves represent different choices of the path-loss exponent α\alpha. The ratio Safe-CSRcumulativeSafe-CSRpairwise\frac{\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}}{\text{\emph{Safe-}}CSR_{\text{\emph{pairwise}}}} increases when γ0\gamma_{0} increases or α\alpha decreases. For each choice of α\alpha, the ratio converges to a constant as γ0\gamma_{0} goes to infinity. This shows that, compared with the pairwise interference model, the safe carrier-sensing range under the cumulative interference model will not increase arbitrarily.

IV A Novel Carrier Sensing Mechanism

We now discuss the implementation of Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}}. We first describe the difficulty of implementing the safe carrier-sensing range in (6) using the existing physical carrier-sensing mechanism in the current 802.11 protocol. Then, we propose a new Incremental-Power Carrier-Sensing (IPCS) mechanism to resolve this implementation issue.

IV-A Limitation of Conventional Carrier-Sensing Mechanism

In the current 802.11 MAC protocol, given the safe carrier-sensing range Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}}, the carrier-sensing power threshold PthP_{th} is set as

Pth=Pt(Safe-CSRcumulative)α.P_{th}=P_{t}\cdot\left(\emph{Safe-}CSR_{\text{\emph{cumulative}}}\right)^{-\alpha}. (8)

Before transmitting, a transmitter TiT_{i} compares the power it senses, PCS(Ti)P^{CS}(T_{i}), with the power threshold PthP_{th}. A key disadvantage of this approach is that PCS(Ti)P^{CS}(T_{i}) is a cumulative power from all the other nodes that are concurrently transmitting. The cumulative nature makes it impossible to tell whether PCS(Ti)P^{CS}(T_{i}) is from one particular nearby transmitter or a group of far-off transmitters [18]. This reduces spatial reuse, as illustrated by the example in Fig. 3.

Refer to caption
Figure 3: Conventional carrier-sensing mechanism will reduce the spatial reuse in 802.11 networks. Link l3l_{3} is placed based on the absolute power sensing mechanism in current 802.11, and link l3l^{\prime}_{3} is placed based on the Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} as enabled by our IPCS mechanism.

There are four links in Fig. 3, with Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} set as in (6). In Fig. 3, the distance d(T1,T2)d(T_{1},T_{2}) is equal to Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}}. From (II-B), we find that T1T_{1} and T2T_{2} can not carrier sense each other, thus they can transmit simultaneously.

First, consider the location requirement of the third link l3l^{\prime}_{3} that can have a concurrent transmission with both l1l_{1} and l2l_{2}, assuming that each transmitter can perfectly differentiate the distances from the other transmitters. Suppose that the third link is located on the middle line between l1l_{1} and l2l_{2}. Based on the carrier-sensing range analysis, the requirements are d(T3,T1)Safe-CSRcumulatived(T^{\prime}_{3},T_{1})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}} and d(T3,T2)Safe-CSRcumulatived(T^{\prime}_{3},T_{2})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}. So the third link can be located in the position of l3l^{\prime}_{3}, shown in Fig. 3. Furthermore, as the number of links increases, a tight packing of the concurrent transmitters will result in a regular equilateral triangle packing with side length Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}}. The “consumed area” of each transmitter is a constant given by A=32Safe-CSRcumulative2A=\frac{\sqrt{3}}{2}\emph{Safe-}CSR_{\text{\emph{cumulative}}}^{2}.

Now, let us consider the location requirement of the third link l3l_{3} under the carrier-sensing mechanism of the current 802.11 protocol. In order to have concurrent transmissions with both l1l_{1} and l2l_{2}, the cumulative power sensed by T3T_{3} due to transmissions of both links l1l_{1} and l2l_{2} should be no larger than PthP_{th}, i.e.,

PCS(T3)\displaystyle P^{CS}(T_{3}) =Ptd(T3,T1)α+Ptd(T3,T2)α\displaystyle=P_{t}\cdot d(T_{3},T_{1})^{-\alpha}+P_{t}\cdot d(T_{3},T_{2})^{-\alpha}
=2Ptd(T3,T1)αPth,\displaystyle=2\cdot P_{t}d(T_{3},T_{1})^{-\alpha}\leq P_{th},

where PthP_{th} is given in equation (8). So the minimum distance requirement on d(T3,T1)d(T_{3},T_{1}) and d(T3,T2)d(T_{3},T_{2}) is

d(T3,T1)=d(T3,T2)(2PtPth)1α=21αSafe-CSRcumulative,d(T_{3},T_{1})=d(T_{3},T_{2})\geq\left(2\frac{P_{t}}{P_{th}}\right)^{\frac{1}{\alpha}}=2^{\frac{1}{\alpha}}\cdot\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}},

as shown in Fig. 3. Since 21α2^{\frac{1}{\alpha}} is always greater than 11, the requirement of the separation between transmitters is increased from Safe-CSRcumulative\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}} (i.e., d(T1,T2)d(T_{1},T_{2})) to 21αSafe-CSRcumulative2^{\frac{1}{\alpha}}\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}} (i.e., d(T1,T3)d(T_{1},T_{3}) and d(T2,T3)d(T_{2},T_{3})). The requirement on the separation between transmitters will increase progressively as the number of concurrent links increases, and the corresponding packing of transmitters will be more and more sparse. As a result, spatial reuse is reduced as the number of links increases.

Another thing to notice is that the order of the transmissions of links also affects spatial reuse in the conventional carrier-sensing mechanism. Consider the three links, l1l_{1}, l2l_{2} and l3l_{3} in Fig. 3 again. If the sequence of transmissions is {l1,l2,l3}\{l_{1},l_{2},l_{3}\}, as discussed above, T1T_{1}, T2T_{2} and T3T_{3} sense a power no greater than PthP_{th}, and thus l1l_{1}, l2l_{2} and l3l_{3} can be active simultaneously. If the sequence of transmissions on these links is {l2,l3,l1}\{l_{2},l_{3},l_{1}\}, however, both T2T_{2} and T3T_{3} sense a power no larger than PthP_{th}. But the cumulative power sensed by T1T_{1} in this case is

PCS(T1)=Ptd(T3,T1)α+Ptd(T2,T1)α\displaystyle P^{CS}(T_{1})=P_{t}\cdot d(T_{3},T_{1})^{-\alpha}+P_{t}\cdot d(T_{2},T_{1})^{-\alpha}
=\displaystyle= Pt(21αSafe-CSRcumulative)α+Pt(Safe-CSRcumulative)α\displaystyle P_{t}\left(2^{\frac{1}{\alpha}}\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}\right)^{-\alpha}+P_{t}\left(\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}\right)^{-\alpha}
=\displaystyle= 32Pth>Pth.\displaystyle\frac{3}{2}P_{th}>P_{th}.

Therefore, T1T_{1} will sense the channel busy and will not initiate the transmission on l1l_{1}. The spatial reuse is unnecessarily reduced because there would have been no collisions had T1T_{1} decide to transmit888This corresponds to the exposed-node phenomenon..

IV-B Incremental-Power Carrier-Sensing (IPCS) Mechanism

We propose an enhanced physical carrier-sensing mechanism called Incremental-Power Carrier-Sensing (IPCS) to solve the issues identified in section IV-A. Specifically, the IPCS mechanism can implement the safe carrier-sensing range accurately by separating the detected powers from multiple concurrent transmitters.

There are two fundamental causes for collisions in a CSMA network. Besides hidden nodes, collisions can also happen when the backoff mechanisms of two transmitters count down to zero simultaneously, causing them to transmit together. Note that for the latter, each of the two transmitters is not aware that the other transmitter will begin transmission at the same time. Based on the power that it detects, it could perfectly be safe for it to transmit together with the existing active transmitters, only if the other transmitter did not decide to join in at the same time. There is no way that the carrier-sensing mechanism can prevent this kind of collisions. This paper addresses the hidden-node phenomenon only. To isolate the second kind of collisions, we will assume in the following discussion of IPCS that no two transmitters will transmit simultaneous333Collisions due to simultaneous countdown-to-zero can be tackled by an exponential backoff mechanism in which the transmission probability of each node is adjusted in a dynamic way based on the busyness of the network. In WiFi, for example, the countdown window is doubled after each collision. The probability of this kind of collisions can be made small with a proper design of the backoff mechanism. Conceptually, we could imagine the random variable associated with backoff countdown to be continuous rather than discrete, which means that the starting/ending of one link’s transmission will coincide with the starting/ending of another link’s transmission with zero probability.

The key idea of IPCS is to utilize the whole carrier-sensing power history, not just the carrier-sensing power at one particular time. In CSMA networks, each transmitter TiT_{i} carrier senses the channel except during the time when it transmits DATA or receives ACK. The power being sensed increases if a link starts to transmit, and decreases if a link finishes transmission. As a result, the power sensed by transmitter TiT_{i}, denoted by PiCS(t)P_{i}^{CS}(t), is a continuous function of time tt.

In IPCS, instead of checking the absolute power sensed at time tt, the transmitter checks increments of power in the past up to time tt. If the packet duration tpackett_{packet} (including both DATA and ACK frames and the SIFS in between) is a constant for all links, then it suffices to check the power increments during the time window [ttpacket,t][t-t_{packet},t]444This assumption is used to simplify explanation only. In general, we could check a time window sufficiently large to cover the maximum packet size among all links.. Let {t1,t2,,tk,}\{t_{1},t_{2},\cdots,t_{k},\cdots\} denote the time instances when the power being sensed changes, and {ΔPiCS(t1),ΔPiCS(t2),,ΔPiCS(tk),}\{\Delta P_{i}^{CS}(t_{1}),\Delta P_{i}^{CS}(t_{2}),\cdots,\Delta P_{i}^{CS}(t_{k}),\cdots\} denote the corresponding increments, respectively. In IPCS, transmitter TiT_{i} will decide the channel to be idle at time tt if the following conditions are met:

ΔPiCS(tk)Pth,tk such that ttpackettkt,\Delta P_{i}^{CS}(t_{k})\leq P_{th},\quad\forall t_{k}\text{ such that }t-t_{packet}\leq t_{k}\leq t, (9)

where PthP_{th} is the carrier-sensing power threshold determined according to CSRCSR; otherwise, the channel is deemed to be busy. Since ΔPiCS(tk)\Delta P_{i}^{CS}(t_{k}) is negative if a link stops transmission at some time tkt_{k}, we only need to check the instances where the power increments are positive.

By checking every increment in the detected power, TiT_{i} can separate the powers from all concurrent transmitters, and can map the power profile to the required distance information. In this way, IPCS can ensure the separations between all transmitters are tight in accordance with Theorem 1.

Theorem 2

If the carrier-sensing power threshold PthP_{th} in the IPCS mechanism is set as:

Pth=Pt(Safe-CSRcumulative)α,P_{th}=P_{t}\left(\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}\right)^{-\alpha}, (10)

where Safe-CSRcumulative\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}} is the safe carrier-sensing range in (6), then it is sufficient to prevent hidden-node collisions under the cumulative interference model.

Proof:

The proof is given in Appendix C. ∎

Refer to caption
Figure 4: The power sensed by transmitter T3T^{\prime}_{3} as a function of time

Let us use Fig. 3 again to show how IPCS can implement the safe carrier-sensing range successfully. We set the carrier-sensing power threshold PthP_{th} as in (10). We will show that the location requirement of the third link under IPCS is the same as indicated by the safe carrier-sensing range (location l3l^{\prime}_{3} in Fig. 3). The transmitter of the third link will only initiate its transmission when it senses the channel to be idle. Its carrier-sensed power is shown in Fig. 4. Without loss of generality, suppose that link l1l_{1} starts transmission before l2l_{2}. The third transmitter detects two increments in its carrier-sensed power at time instances t1t_{1} and t2t_{2} which are due to the transmissions of T1T_{1} and T2T_{2}, respectively. In the IPCS mechanism, the third transmitter will believe that the channel is idle (i.e., it can start a new transmission) if the following is true:

{ΔP3CS(t1)=Ptd(T3,T1)αPth,ΔP3CS(t2)=Ptd(T3,T2)αPth.\begin{cases}\Delta P_{3}^{CS}(t_{1})=P_{t}d(T^{\prime}_{3},T_{1})^{-\alpha}\leq P_{th},\\ \Delta P_{3}^{CS}(t_{2})=P_{t}d(T^{\prime}_{3},T_{2})^{-\alpha}\leq P_{th}.\end{cases} (11)

Substituting PthP_{th} in (10) to (11), we find that the requirements in (11) are equivalent to the following distance requirements:

{d(T3,T1)Safe-CSRcumulative,d(T3,T2)Safe-CSRcumulative.\begin{cases}d(T^{\prime}_{3},T_{1})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}},\\ d(T^{\prime}_{3},T_{2})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}.\end{cases}

So the third link can be located at the position of l3l^{\prime}_{3}, as shown in Fig. 3, instead of far away at the location of l3l_{3} as in the conventional carrier-sensing mechanism.

Compared with the conventional carrier-sensing mechanism, the advantages of IPCS are

  1. 1.

    IPCS is a pairwise carrier-sensing mechanism. In the IPCS mechanism, the power from each and every concurrent link is checked individually. This is equivalent to checking the separation between every pair of concurrent transmission links. With IPCS, all the analyses based on the concept of a carrier-sensing range remain valid.

  2. 2.

    IPCS improves spatial reuse and network throughput. In the conventional carrier-sensing mechanism, the link separation requirement increases as the number of concurrent links increases. In IPCS, however, the link separation requirement remains the same. Furthermore, because IPCS is a pairwise mechanism, the order of the transmissions of links will not affect the spatial reuse.

V Simulations Results

We perform simulations to evaluate the relative performance of IPCS and conventional Carrier Sensing (CS). In our simulations, the nodes are located within in a square area of 300m×300m300m\times 300m. The locations of the transmitters are generated according to a Poisson point process. The length of a link is uniformly distributed between 1010 and 2020 meters. More specifically, the receiver associated with a transmitter is randomly located between the two concentric circles of radii 10m10m and 20m20m centered on the transmitter. We study the system performance under different link densities by varying the number of links in the square from 11 to 200200 in our simulations.

The simulations are carried out based on the 802.11b protocol. The common physical layer link rate is 11Mbps11Mbps. The packet size is 14601460 Bytes. The minimum and maximum backoff window CWminCW_{\min} and CWmaxCW_{\max} are 31 and 1023, respectively. The slot time is 20μs20\mu s. The SIFS and DIFS are 10μs10\mu s and 50μs50\mu s, respectively. The transmit power PtP_{t} is set as 100mW100mW. The path-loss exponent α\alpha is 44, the SIR requirement γ0\gamma_{0} is 2020, and the corresponding Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} equals 117.6m117.6m based on (6). That is, the carrier-sensing power threshold Pth=Pt(Safe-CSRcumulative)α=5.23×107mWP_{th}=P_{t}\left(\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}\right)^{-\alpha}=5.23\times 10^{-7}mW.

Refer to caption
Figure 5: Spatial reuse and network throughput under IPCS and the conventional CS mechanisms

In Fig. 5, we plot spatial reuse and network throughput under IPCS and the conventional CS mechanisms. Simulation results show that network throughput is proportional to spatial reuse. So we plot these two results in the same figure. We define a “unit area” as the “consumed area” of each “active” transmitter under the tightest packing. Given Safe-CSRcumulative=117.6mCSR_{\text{\emph{cumulative}}}=117.6m, according to the carrier-sensing range analysis, the “unit area” is 32\frac{\sqrt{3}}{2}Safe-CSRcumulative2=1.197×104m2CSR_{\text{\emph{cumulative}}}^{2}=1.197\times 10^{4}m^{2}. The x-axis is the average number of links (i.e., all links, including active and inactive links) per unit area as we vary the total number of links in the whole square. That is, the x-axis corresponds to the link density of the network. The left y-axis is the spatial reuse, or the average “active” link density in the network. The optimal value of the spatial reuse is 11, which is shown as a dashed line in Fig. 5. The right y-axis is the throughput per unit area.

It is clear from Fig. 5 that IPCS outperforms the conventional CS. The improvement becomes more significant when the network becomes denser. At the densest point in the figure, spatial reuses under IPCS and conventional CS are 0.94240.9424 and 0.58340.5834, respectively. The network throughputs per unit area are 6.66Mbps6.66Mbps and 4.08Mbps4.08Mbps, respectively. Using conventional CS as the base line, the IPCS improves spatial reuse and network throughput by more than 60%60\%.

Under the conventional CS, in order to make sure the cumulative detected power is no larger than the power threshold PthP_{th}, the packing of concurrent transmission links will become more and more sparse as additional number of links attempt to transmit. Under IPCS, this does not occur. As a result, the improvement in spatial reuse is more significant as the network becomes denser.

We also find that when the network becomes denser and denser, spatial reuse under IPCS becomes very close to the theoretical result. The small gap is likely due to the fact that a link which could be active concurrently under IPCS does not exist in the given topology. The probability of this happening decreases as the network becomes denser.

VI Conclusion

In this paper, we derive a threshold on the safe carrier-sensing range that is sufficient to prevent hidden-node collisions under the cumulative interference model. We show that the safe carrier-sensing range required under the cumulative interference model is larger than that required under the pairwise interference model by a constant multiplicative factor.

We propose a novel carrier-sensing mechanism called Incremental-Power Carrier-Sensing (IPCS) that can realize the safe carrier-sensing range concept in a simple way. The IPCS checks every increment in the detected power so that it can separate the detected power of every concurrent transmitter, and then maps the power profile to the required distance information. Our simulation results show that IPCS can boost spatial reuse and network throughput by more than 60%60\% relative to the conventional carrier-sensing mechanism in the current 802.11 protocol.

One future research direction is to further tighten the safe carrier-sensing range according to the topology information. In this paper, we have assumed a common safe carrier-sensing range for all transmitters. Allowing the carrier-sensing range to vary from transmitter to transmitter according to the local network topological structures may improve spatial reuse further. In this paper, we have not considered virtual carrier sensing (i.e., the RTS/CTS mode in 802.11). Ensuring hidden-node free operation under virtual carrier sensing is rather complicated even under the pairwise interference model (see [11] for details.) The study of interference-safe transmissions for virtual carrier sensing under the cumulative interference model is a subject for further study.

Appendix A The Need for RS(Re-Start) Mode

It is shown in [8] that although the carrier-sensing range is sufficiently large for the SINR requirements of all nodes, transmission failures can still occur due to the “Receiver-Capture effect”.

Refer to caption
Figure 6: Collision due to “Receiver-Capture effect”

Take a two-link case shown in Fig. 6 as an example. In Fig. 6, d(T1,T2)>CSRd(T_{1},T_{2})>CSR and d(T1,R2)<CSRd(T_{1},R_{2})<CSR. So the transmitters T1T_{1} and T2T_{2} can not carrier-sense each other, but R2R_{2} can sense the signal transmitted from T1T_{1}. Suppose that CSRCSR is set large enough to guarantee the SINR requirements on l1l_{1} and l2l_{2} (both the DATA frames and the ACK frames). If T1T_{1} transmits first, then R2R_{2} will have sensed the signal of T1T_{1} and the default operation in most 802.11 products is that R2R_{2} will not attempt to receive the later signal from T2T_{2}, even if the signal from T2T_{2} is stronger. This will cause the transmission on link l2l_{2} to fail. It is further shown in [8] that no matter how large the carrier-sensing range is, we can always come up with an example that gives rise to transmission failures, if the “Receiver-Capture effect” is not dealt with properly. This kind of collisions can be solved with a receiver “RS (Re-Start) mode”. With RS mode, a receiver will switch to receive the stronger packet as long as the SINR threshold γ0{\gamma}_{0} for the later link can be satisfied.

Appendix B Proof of Theorem 1

Proof:

With the receiver’s RS mode, in order to prevent hidden-node collisions in 802.11 networks, we only need to show that condition (6) is sufficient to guarantee the satisfaction of both the SIR requirements (1) and (2) of all the concurrent transmission links.

Let 𝒮CS\mathcal{S}^{CS} denote a subset of links that are allowed to transmit concurrently under the Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} setting. Consider any two links lil_{i} and ljl_{j} in 𝒮CS\mathcal{S}^{CS}, we have

d(Tj,Ti)Safe-CSRcumulative=(K+2)dmax.d(T_{j},T_{i})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}=(K+2)d_{\max}.

Because both the lengths of links lil_{i} and ljl_{j} satisfy

d(Ti,Ri)dmax,d(Tj,Rj)dmax,d(T_{i},R_{i})\leq d_{\max},\quad d(T_{j},R_{j})\leq d_{\max},

we have the following based on the triangular inequality

d(Tj,Ri)d(Tj,Ti)d(Ti,Ri)(K+1)dmax,\displaystyle d(T_{j},R_{i})\geq d(T_{j},T_{i})-d(T_{i},R_{i})\geq(K+1)d_{\max},
d(Rj,Ti)d(Ti,Tj)d(Tj,Rj)(K+1)dmax,\displaystyle d(R_{j},T_{i})\geq d(T_{i},T_{j})-d(T_{j},R_{j})\geq(K+1)d_{\max},
d(Rj,Ri)d(Ri,Tj)d(Tj,Rj)Kdmax.\displaystyle d(R_{j},R_{i})\geq d(R_{i},T_{j})-d(T_{j},R_{j})\geq Kd_{\max}.

We take the most conservative distance KdmaxKd_{\max} in our interference analysis (i.e., we will pack the interference links in a tightest manner given the Safe-CSRcumulativeCSR_{\text{\emph{cumulative}}} in (6)). Consider any two links lil_{i} and ljl_{j} in 𝒮CS\mathcal{S}^{CS}. The following four inequalities are satisfied:

d(Ti,Tj)\displaystyle d(T_{i},T_{j}) Kdmax,d(Ti,Rj)Kdmax,\displaystyle\geq Kd_{\max},\quad d(T_{i},R_{j})\geq Kd_{\max},
d(Tj,Ri)\displaystyle d(T_{j},R_{i}) Kdmax,d(Ri,Rj)Kdmax.\displaystyle\geq Kd_{\max},\quad d(R_{i},R_{j})\geq Kd_{\max}.

Consider any link lil_{i} in 𝒮CS\mathcal{S}^{CS}. We will show that the SIR requirements for both the DATA frame and the ACK frame can be satisfied. We first consider the SIR requirement of the DATA frame. The SIR at RiR_{i} is:

SIR=Ptdα(Ti,Ri)lj𝒮CS,jiPtdα(Sj,Ri)\displaystyle SIR=\frac{P_{t}d^{-\alpha}\left({T_{i},R_{i}}\right)}{\sum\limits_{l_{j}\in\mathcal{S}^{CS},j\neq i}{P_{t}d^{-\alpha}\left({S_{j},R_{i}}\right)}}

For the received signal power we consider the worst case that d(Ti,Ri)=dmaxd(T_{i},R_{i})=d_{\max}. So we have

Ptdα(Ti,Ri)Ptdmaxα.P_{t}d^{-\alpha}\left({T_{i},R_{i}}\right)\geq P_{t}\cdot{d_{\max}^{-\alpha}}. (12)

To calculate the cumulative interference power, we consider the worst case that all the other concurrent transmission links have the densest packing, in which the link lengths of all the other concurrent transmission links are equal to zero. In this case, the links degenerate to nodes. The minimum distance between any two links in 𝒮CS\mathcal{S}^{CS} is KdmaxKd_{\max}. The densest packing of nodes with the minimum distance requirement is the hexagon packing (as shown in Fig. 7).

If link ljl_{j} is the first layer neighbor link of link lil_{i}, we have d(Sj,Ri)Kdmaxd(S_{j},R_{i})\geq Kd_{\max}. Thus we have

Ptdα(Sj,Ri)Pt(Kdmax)α=1KαPtdmaxα,{P_{t}d^{-\alpha}\left({S_{j},R_{i}}\right)}\leq{P_{t}{\left(Kd_{\max}\right)}^{-\alpha}}=\frac{1}{K^{\alpha}}\cdot P_{t}{d_{\max}^{-\alpha}},

and there are at most 6 neighbor links in the first layer.

If link ljl_{j} is the second layer neighbor link of link lil_{i}, we have d(Sj,Ri)3Kdmaxd(S_{j},R_{i})\geq\sqrt{3}Kd_{\max}. Thus we have

Ptdα(Sj,Ri)Pt(3Kdmax)α=1(3K)αPtdmaxα,{P_{t}d^{-\alpha}\left({S_{j},R_{i}}\right)}\leq{P_{t}{\left(\sqrt{3}Kd_{\max}\right)}^{-\alpha}}=\frac{1}{\left(\sqrt{3}K\right)^{\alpha}}P_{t}{d_{\max}^{-\alpha}},

and there are at most 12 neighbor links in the second layer.

If link ljl_{j} is the nnth layer neighbor link of link lil_{i} with n2n\geq 2, we have d(Sj,Ri)32nKdmaxd(S_{j},R_{i})\geq\frac{\sqrt{3}}{2}n\cdot Kd_{\max}. Thus we have

Ptdα(Sj,Ri)Pt(32nKdmax)α=1(32nK)αPtdmaxα,{P_{t}d^{-\alpha}\left({S_{j},R_{i}}\right)}\leq{P_{t}{\left(\frac{\sqrt{3}}{2}nKd_{\max}\right)}^{-\alpha}}=\frac{1}{\left(\frac{\sqrt{3}}{2}nK\right)^{\alpha}}P_{t}{d_{\max}^{-\alpha}},

and there are at most 6n6n neighbor links in the nnth layer.

So the cumulative interference power satisfies:

lj𝒮CS,jiPtdα(Sj,Ri)\displaystyle{\sum\limits_{l_{j}\in\mathcal{S}^{CS},j\neq i}{P_{t}d^{-\alpha}\left({S_{j},R_{i}}\right)}}
\displaystyle\leq (6(1K)α + n=26n(23nK)α)Ptdmaxα\displaystyle\left(6\cdot\left({\frac{1}{K}}\right)^{\alpha}\mbox{ + }\sum\limits_{n=2}^{\infty}{6n\left({\frac{2}{\sqrt{3}nK}}\right)^{\alpha}}\right)\cdot P_{t}{d_{\max}^{-\alpha}}
=\displaystyle= 6(1K)α(1 + n=2n(23n)α)Ptdmaxα\displaystyle 6\cdot\left({\frac{1}{K}}\right)^{\alpha}\left({\mbox{1 + }\sum\limits_{n=2}^{\infty}{n\left({\frac{2}{\sqrt{3}n}}\right)^{\alpha}}}\right)\cdot P_{t}{d_{\max}^{-\alpha}}
=\displaystyle= 6(1K)α(1 + (23)αn=2n(1n)α)Ptdmaxα\displaystyle 6\cdot\left({\frac{1}{K}}\right)^{\alpha}\left({\mbox{1 + }\left({\frac{2}{\sqrt{3}}}\right)^{\alpha}\sum\limits_{n=2}^{\infty}{n\left({\frac{1}{n}}\right)^{\alpha}}}\right)\cdot P_{t}{d_{\max}^{-\alpha}}
=\displaystyle= 6(1K)α(1 + (23)αn=21nα1)Ptdmaxα\displaystyle 6\cdot\left({\frac{1}{K}}\right)^{\alpha}\left({\mbox{1 + }\left({\frac{2}{\sqrt{3}}}\right)^{\alpha}\sum\limits_{n=2}^{\infty}{\frac{1}{n^{\alpha-1}}}}\right)\cdot P_{t}{d_{\max}^{-\alpha}}
\displaystyle\leq 6(1K)α(1 + (23)α1α2)Ptdmaxα\displaystyle 6\cdot\left({\frac{1}{K}}\right)^{\alpha}\left({\mbox{1 + }\left({\frac{2}{\sqrt{3}}}\right)^{\alpha}\frac{1}{\alpha-2}}\right)\cdot P_{t}{d_{\max}^{-\alpha}} (13)
=\displaystyle= Ptdmaxαγ0,\displaystyle\frac{P_{t}{d_{\max}^{-\alpha}}}{\gamma_{0}}, (14)

where (13) follows from a bound on Riemann’s zeta function and (14) follows from the definition of KK in (7).


Refer to caption
Figure 7: The packing of the interfering links in the worst case

According to (12) and (14), we find that the SIR of the DATA frame of link lil_{i} at the receiver RiR_{i} satisfies:

SIR=Ptdα(Ti,Ri)lj𝒮CS,jiPtdα(Sj,Ri)PtdmaxαPtdmaxαγ0=γ0.SIR=\frac{P_{t}d^{-\alpha}\left({T_{i},R_{i}}\right)}{\sum\limits_{l_{j}\in\mathcal{S}^{CS},j\neq i}{P_{t}d^{-\alpha}\left({S_{j},R_{i}}\right)}}\geq\frac{P_{t}\cdot{d_{\max}^{-\alpha}}}{\frac{P_{t}{d_{\max}^{-\alpha}}}{\gamma_{0}}}=\gamma_{0}.

This means that the SIR requirement of the successful transmission of the DATA frame on link lil_{i} can be satisfied.

The proof that the SIR requirement of the ACK frame on link lil_{i} can be satisfied follows a similar procedure as above. So for any link lil_{i} in the concurrent transmission link set 𝒮CS\mathcal{S}^{CS}, condition (6) is sufficient to satisfy the SIR requirements of the successful transmissions of both its DATA and ACK frames. This means that, together with the receiver’s RS mode, condition (6) is sufficient for preventing hidden-node collisions in CSMA networks under the cumulative interference model. ∎

Appendix C Proof of Theorem 2

Proof:

Consider any link lil_{i} in the link set \mathcal{L}. Transmitter TiT_{i} will always do carrier sensing except when it transmits DATA frame or receives ACK frame. We show that condition (10) is sufficient to prevent hidden-node collisions in the following two situations, which cover all the possible transmission scenarios:

  1. 1.

    Link lil_{i} has monitored the channel for at least tpackett_{packet} before its backoff counter reaches zero and it transmits.

  2. 2.

    Link lil_{i} finishes a transmission; then monitors the channel for less than tpackett_{packet} when its backoff counter reaches zero; then it transmits its next packet.

Let us first consider case 1)):

We show that for the links that are allowed to transmit simultaneously, the separation between any pair of transmitters is no less than the safe carrier-sensing range Safe-CSRcumulative\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}. We use inductive proof method. Suppose that before lil_{i} starts to transmit, there are already MM links transmitting and they are collectively denoted by the link set 𝒮CS\mathcal{S}^{CS}. Without loss of generality, suppose that these MM links begin to transmit one by one, according to the order l1,l2,,lMl_{1},l_{2},\cdots,l_{M}. For any link lj𝒮CSl_{j}\in\mathcal{S}^{CS}, let tjt_{j} and tjt^{\prime}_{j} denote the times when link ljl_{j} starts to transmit the DATA frame and the ACK frame, respectively.

In our inductive proof, by assumption we have

d(Tj,Tk)Safe-CSRcumulative,j,k{1,,M},jk.d(T_{j},T_{k})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}},\forall j,k\in\{1,\cdots,M\},j\neq k. (15)

We now show that condition (15) will still hold after link lil_{i} starts its transmission.

Before link lil_{i} starts its transmission, transmitter TiT_{i} monitors the channel for a time period of tpackett_{packet}. So TiT_{i} at least senses MM increments in the carrier-sensing power PiCS(t)P_{i}^{CS}(t) that happen at time t1,t2,,tMt_{1},t_{2},\cdots,t_{M} when the links in 𝒮CS\mathcal{S}^{CS} start to transmit their DATA frames. There may also be some increments in the PiCS(t)P_{i}^{CS}(t) that happen at t1,t2,,tMt^{\prime}_{1},t^{\prime}_{2},\cdots,t^{\prime}_{M} if the links in 𝒮CS\mathcal{S}^{CS} start to transmit the ACK frames before link lil_{i} starting it transmission. In the IPCS mechanism, at least the following MM inequalities must be satisfied if TiT_{i} can start its transmission:

ΔPiCS(tj)Pth,forj=1,,M.\Delta P_{i}^{CS}(t_{j})\leq P_{th},\quad\text{for}\quad j=1,\cdots,M.

Because

ΔPiCS(tj)=Ptd(Ti,Tj)α,\displaystyle\Delta P_{i}^{CS}(t_{j})=P_{t}d(T_{i},T_{j})^{-\alpha},
Pth=Pt(Safe-CSRcumulative)α,\displaystyle P_{th}=P_{t}\left(\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}\right)^{-\alpha},

we have

d(Ti,Tj)Safe-CSRcumulativeforj=1,,M.d(T_{i},T_{j})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}\quad\text{for}\quad j=1,\cdots,M.

Thus, we have shown that the separation between any pair of transmitters in the link set 𝒮CSli\mathcal{S}^{CS}\cup l_{i} is no less than Safe-CSRcumulative\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}} after link lil_{i} starting transmission.

Now let us consider case 2)):

Before starting the transmission of the (m+1)(m+1)th packet, link lil_{i} first finishes the transmission of the mmth packet (from time ti(m)t_{i}(m) to ti(m)+tpackett_{i}(m)+t_{packet}), and waits for a DIFS plus a backoff time (from time ti(m)+tpackett_{i}(m)+t_{packet} to ti(m+1)t_{i}(m+1)). Let 𝒮CS\mathcal{S}^{CS} denote the set of links that are transmitting when lil_{i} starts the (m+1)(m+1)th packet at time ti(m+1)t_{i}(m+1). Consider any link ljl_{j} in set 𝒮CS\mathcal{S}^{CS}. Because the transmission time of every packet in the network is tpackett_{packet}. We know that the start time tjt_{j} of the concurrent transmission on link ljl_{j} must range from ti(m)t_{i}(m) to ti(m+1)t_{i}(m+1), i.e., ti(m)<tj<ti(m+1)t_{i}(m)<t_{j}<t_{i}(m+1).

If ti(m)+tpacket<tj<ti(m+1)t_{i}(m)+t_{packet}<t_{j}<t_{i}(m+1), this means tjt_{j} is in the DIFS or the backoff time of link lil_{i}. During this period, transmitter TiT_{i} will do carrier sensing. The IPCS mechanism will make sure that the distance between TiT_{i} and TjT_{j} satisfies d(Ti,Tj)Safe-CSRcumulatived(T_{i},T_{j})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}.

If ti(m)<tj<ti(m)+tpackett_{i}(m)<t_{j}<t_{i}(m)+t_{packet}, this means tjt_{j} falls into the transmission time of the mmth packet of link lil_{i}. During the transmission time, TiT_{i} is not able to do carrier sensing because it is in the process of transmitting the DATA frame or receiving the ACK frame. However, the transmitter TjT_{j} will do carrier sensing before it starts to transmit at time tjt_{j}. The carrier sensing done by TjT_{j} can make sure that the distance between TiT_{i} and TjT_{j} satisfies d(Ti,Tj)Safe-CSRcumulatived(T_{i},T_{j})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}.

So for any link ljl_{j} in 𝒮CS\mathcal{S}^{CS}, we have d(Ti,Tj)Safe-CSRcumulatived(T_{i},T_{j})\geq\text{\emph{Safe-}}CSR_{\text{\emph{cumulative}}}.

References

  • [1] G. Brar, D. M. Blough, and P. Santi, “Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks”, in Proc. ACM Mobicom, 2006.
  • [2] S. A. Borbash and A. Ephremides, “Wireless link scheduling with power control and SINR constraints”, IEEE Trans. Information Theory, vol. 52, no. 11, pp. 5106-5111, Nov. 2006.
  • [3] G. Sharma, R.R. Mazumdar, and N.B. Shroff, “On the Complexity of Scheduling in Wireless Networks”, in Proc. ACM Mobicom, 2006.
  • [4] O. Goussevskaia, Y.A. Oswald, and R. Wattenhofer, “Complexity in Geometric SINR”, in Proc. ACM MobiHoc, 2007.
  • [5] T. Moscibroda, R. Wattenhofer, and A. Zollinger, “ Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies”, in Proc. ACM MobiHoc, 2006.
  • [6] K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu, “Impact of interference on multi-hop wireless network performance,” in Proc. ACM Mobicom, 2003.
  • [7] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Info. Theory, Vol.46, No. 2, pp. 388-404, 2000.
  • [8] L. B. Jiang and S. C. Liew, “Hidden-node Removal and Its Application in Cellular WiFi Networks”, IEEE Trans. Veh. Technol., vol. 56, no. 5, Sep. 2007.
  • [9] S. Xu and T. Saadawi, “Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?” IEEE Commun. Mag., vol. 39, no. 6, pp. 130-137, Jun. 2001.
  • [10] K. Xu, M. Gerla, and S. Bae, “How effective is the IEEE 802.11 RTS/CTS handshake in ad hoc networks?” in Proc. IEEE GLOBECOM, Nov. 2002.
  • [11] L. B. Jiang and S. C. Liew, “Improving throughput and fairness by reducing exposed and hidden nodes in 802.11 networks”, IEEE Trans. on Mobile Computing, vol. 7, no. 1, pp. 34-49, Jan. 2008.
  • [12] A. Vasan, R. Ramjee, and T. Woo, “ECHOS–Enhanced capacity 802.11 hotspots”, in Proc. IEEE Infocom, Mar. 2005.
  • [13] P. C. Ng and S. C. Liew, “Throughput analysis of IEEE 802.11 multihop ad hoc networks”, IEEE/ACM Transactions on Networking, vol. 15, no. 2, pp. 309-322, Apr. 2007.
  • [14] C. K. Chau, M. Chen, and S. C. Liew, “Capacity of Large-scale CSMA Wireless Networks”, to appear in ACM Mobicom, 2009.
  • [15] T. S. Kim, H. Lim, and J. C. Hou, “Improving Spatial Reuse through Tuning Transmit Power, Carrier Sense Threshold, and Data Rate in Multihop Wireless Networks”, in Proc. ACM Mobicom, 2006.
  • [16] T. Y. Lin and J. C. Hou, “Interplay of Spatial Reuse and SINR-determined Data Rates in CSMA/CA-based, Multi-hop, Multi-rate Wireless Networks”, in Proc. IEEE Infocom, 2007.
  • [17] L. Fu, S. C. Liew, and J. Huang, “Safe Carrier Sensing Range in CSMA network under Physical Interference Model”, Technical Report, 2009. http://arxiv.org/abs/0901.3611.
  • [18] K. Jamieson, B. Hull, A. Miu, and H. Balakrishnan, “Understanding the Real-World Performance of Carrier Sense”, ACM SIGCOMM Workshops, 2005.