Abstract
The recent deployment of data-rich smart phones has led to a fresh impetus for understanding the performance of wide area ad hoc networks. The most popular medium access mechanism for such ad hoc networks is CSMA/CA with RTS/CTS. In CSMA-like mechanisms, spatial reuse is achieved by implementing energy-based guard zones. We consider the problem of simultaneously scheduling the maximum number of links that can achieve a given signal to interference ratio (SIR). In this paper, using tools from stochastic geometry, we study and maximize the medium access probability of a typical link. Our contributions are two-fold: (i) We show that a simple modification to the RTS/CTS mechanism, viz., changing the receiver yield decision from an energy-level guard zone to an SIR guard zone, leads to performance gains; and (ii) We show that this combined with a simple modification to the transmit power level—setting it inversely proportional to the square root of the link gain—leads to significant improvements in network throughput. Further, this simple power-level choice is no worse than a factor of two away from optimal over the class of all “local” power level selection strategies for fading channels, and further is optimal in the non-fading case. The analysis relies on an extension of the Matérn hard core point process which allows us to quantify both these SIR guard zones and this power control mechanism.
References
Ye, F., Yi, S., Sikdar, B.: Improving spatial reuse of IEEE 802.11 based ad hoc networks. In: GLOBECOM (2003)
Krunz, M., Muqattash, A., Lee, S.: Transmission power control in wireless ad hoc networks: challenges, solutions, and open issues. IEEE Netw. 18, 8–14 (2004)
Kim, S., Cha, J., Ma, J.S.: Spatial reuse DCF for enhancing throughput and performance analysis. In: IEEE Vehicular Technology Conference (2008)
Monks, J., Bharghavan, V., Hwu, W.: A power controlled multiple access protocol for wireless packet networks. In: Proceedings of IEEE INFOCOM (2001)
Wu, X., Tavildar, S., Shakkottai, S., Richardson, T., Li, J., Laroia, R., Jovicic, A.: FlashLinQ: a synchronous distributed scheduler for peer-to-peer ad hoc network. In: Allerton Conference (2010)
Baccelli, F., Blaszczyszyn, B.: Stochastic Geometry and Wireless Networks, Volume I: Theory. Foundations and Trends in Networking. Now Publishers, Hanover (2009)
Jindal, N., Weber, S., Andrews, J.G.: Fractional power control for decentralized wireless networks. In: Allerton Conference on Communication, Control, and Computing (2007)
Fuemmeler, J.A., Vaidya, N.H., Veeravalli, V.V.: Selecting transmit powers and carrier sense thresholds in CSMA protocols for wireless ad hoc networks. In: WICON’06: Proceedings of the 2nd Annual International Workshop on Wireless Internet, p. 15. ACM, New York (2006)
Kaynia, M., Jindal, N., Oien, G.E.: Improving the performance of wireless ad hoc networks through mac layer design. IEEE Trans. Wirel. Commun. 10(1), 240–252 (2011)
Zhu, J., Guo, X., Yang, L.L., Conner, W.S., Roy, S., Hazra, M.M.: Adapting physical carrier sensing to maximize spatial reuse in 802.11 mesh networks: research articles. Wirel. Commun. Mob. Comput. 4(8), 933–946 (2004)
Karn, P.: MACA: a new channel access method for packet radio. In: Computer Networking Conference, vol. 9, pp. 134–140 (1990)
Bharghavan, V., Demers, A., Shenker, S., Zhang, L.: Macaw: a media access protocol for wireless LAN’s. In: SIGCOMM’94: Proceedings of the Conference on Communications Architectures, Protocols and Applications, pp. 212–225. ACM, New York (1994)
Chiang, M., Hande, P., Lan, T., Tan, C.W.: Power control in wireless cellular networks. Found. Trends Netw. 2(4), 381–533 (2008)
Haenggi, M., Andrews, J.G., Baccelli, F., Dousse, O., Franceschetti, M.: Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J. Sel. Areas Commun. 27(7), 1029–1046 (2009)
Baccelli, F., Blaszczyszyn, B., Muhlethaler, P.: Stochastic analysis of spatial and opportunistic aloha. IEEE J. Sel. Areas Commun. 27(7), 1105–1119 (2009)
Baccelli, F.: Time and space averages in large wireless networks. In: WiOPT’09: Proceedings of the 7th International Conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, p. 1. IEEE Press, Piscataway (2009)
Nguyen, T.V., Baccelli, F.: A probabilistic model of carrier sensing based cognitive radio. In: 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum, pp. 1–12 (2010)
Hasan, A., Andrews, J.G.: The guard zone in wireless ad hoc networks. IEEE Trans. Wirel. Commun. 6, 897–906 (2007)
Weisstein, E.W.: Renyi’s parking constants. From MathWorld—A Wolfram Web Resource. http://mathworld.wolfram.com/RenyisParkingConstants.html
Baccelli, F., Błaszczyszyn, B.: Stochastic Geometry and Wireless Networks, Volume II—Applications. Foundations and Trends in Networking. Now Publishers, Hanover (2009)
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
1.1 A.1 Proofs of the theorems of Sect. 4
1.1.1 A.1.1 Proof of Lemma 1
In this section we prove Lemma 1 by studying the basic properties of the area of the union of two disks, which have the following relations: the centers of the two disks are at an arbitrary but fixed distance d and the radii of the two disks r 1 and r 2 satisfy the relation r 1 r 2=k. Note that without loss of generality, we can take k=1 and define the two radii to be hence x and \(\frac{1}{x}\), as shown in Fig. 12. For any other value of k, we can always scale the problem by a factor of \(\frac{1}{\sqrt{k}}\) and change d appropriately. We define U d (x) to be the area of the union of the two disks defined above, with a distance d between the two centers and x being one of the radii.
There is always a set of values X(d) for which the two boundary circles of respective radii x and 1/x intersect. Consider first that the set where 1 is an interior point of X(d). By elementary geometric arguments, is easy to see that for all x∈X(d),
where θ 1, θ 2 and θ 3 are defined as in Fig. 12 and where θ 1, θ 2 and θ 3 are determined by the following equations:
Based on these expressions, we are now ready to prove Lemma 1.
Consider first the case where 1 is an interior point of X(d), which holds if and only if d<2. It is easy to see that it then suffices to prove the following conditions on the first derivative of U d (x) to conclude the proof:
-
(1)
\(U_{d}'(1)=0\);
-
(2)
\(U_{d}'(x) > 0\) for any x>1, and \(U_{d}'(x)<0\) for any x<1.
Indeed, in this case, if x∉X(d), then the smaller disk is included in the larger and simple continuity, monotonicity and symmetry arguments show that the minimum cannot be reached in this region.
In order to prove (1) and (2), we use (35) to obtain the following expression for \(U_{d}'(x)\):
where \(\theta_{ix}'\) (i=1,2,3) denotes the first derivative of θ i with respect to x. Now we show that the last four terms in the above expression cancel each other. Since
we have
Thus, we obtain
On the other hand, it is easy to check that
Since θ 1 and θ 2 also satisfies
we have
and thus
This is a rather simple expression which has a simple geometrical interpretation. As shown in Fig. 13, (39) simply indicates that the first derivative of the union of the two disks is determined by the difference of the length of the two non-intersecting arcs, since perturbing x causes one disk to expand its area while the other disk reduces. The increase and the decreased are mainly determined by the lengths of the arcs while the intersecting part of the arcs does not contribute to the first order derivative. From here, we can easily see that
since θ 1=θ 2 in that case. When x>1, we can bound \(U_{d}'(x)\) as in the following:
Similarly, we can conclude \(U_{d}'(x)<0\) for x<1, which completes the proof in this case.
If d>2, then, for x in a neighborhood 1, the area of the union is the sum of the areas and the minimum in this region is reached for x=1. Outside this region, simple continuity and monotonicity arguments based on the evaluation of \(U_{d}'(x)\) for x∈X(d) allow one to show that the minimum cannot be found there. Similarly, it cannot be found in the region where one disk is included in the other and this concludes the proof.
1.1.2 A.1.2 Proof of Theorem 2
For notational brevity, we denote by \(P_{Z}^{*}=f^{*}(H_{Z})\) the optimizing transmit power law for (16). To obtain the MAP of a link with link length d we can again place the transmitter of the link at the origin with a link vector D 0 with length d and with an arbitrary orientation. Under fading the MAP is further averaged over the fading state of the link F 0, i.e.
with MAP(d,x) the MAP of a link with length |D 0|=d and fading F 0=x. So, to obtain (16), it suffices to show that for any fading state x
Given the link vector d and fading state x the number of neighbors of link l 0 is a Poisson random variable and, by arguments similar to those used in the proof of (7), we get
where \(\bar{N}(d,x)\) is the mean number of neighbors of a typical link with length d and fading x. From here, we notice that it suffices to show, for any given d and x,
since we can bound MAPISR(d,x) as follows:
We now derive an expression for \(\bar{N} (d,x)\). For notational brevity, we remove the (d,x) argument in \(\bar{N}\), MAP and other related quantities. We have
Since F 0,Z and F Z,0 are i.i.d. random variables, we can further simplify (41) as
which can be interpreted as the area of union of two disks, averaged over four independent random variables D Z ,F Z ,F 0,Z and F Z,0. We first average over F 0,Z and \(F_{Z_{0}}\) and keep D Z and F Z fixed for now. With D Z and F Z fixed, the radii of the two disks have the similar property as in the non-fading case, except that they are further perturbed by two i.i.d. random variables F 0,Z and F Z,0. For an arbitrary realization (F 0,Z ,F Z,0)=(f 1,f 2), (f 1≠f 2), the area of the union of the disks is not going to be minimized by ISR, which fails to create the same radius due to the asymmetric perturbations. However, it is easy to see that (F 0,Z ,F Z,0)=(f 1,f 2) and (F 0,Z ,F Z,0)=(f 2,f 1) have equal probability due to the i.i.d. property. We thus consider the average of these two fading states and hope that ISR minimizes the average area of the unions of disks of the two fading states.
Thus, we start from the expression in (42) and calculate the average area of union of two disks in the two fading states when (F Z,0,F 0,Z )=(f 1,f 2) and (F Z,0,F 0,Z )=(f 2,f 1)
where U d (x) is defined as in (35) and c,d,t,x are determined as follows:
ISR enforces x=1, which is not necessarily the optimizing x for the sum of the areas in (43). Next, we show that for any choice of d>0 and t>0, the following relationship is true:
To see this, we define
which is the sum of the area of two disks with radii x and \(\frac{1}{x}\). So for any d>0, we have
where the inequality on the right comes from the fact that
which leads to
Thus, we have
which leads to
Here the equality in (47) comes from the fact that V(x) is convex and it is easy to check \(V'(tx)+V'(\frac{x}{t})|_{x=1}=0\). Thus, x=1 is the minimizing x for \(V(tx)+V(\frac{x}{t})\).
Thus, the integrand in (44) at most loses a fraction of \(\frac{1}{2}\) when we use ISR, or equivalently, letting x=1, as compared to any other choices of x. It is easy to see that given this, the relationship in (40) is indeed true, which completes the proof.
1.2 A.2 Proofs of the theorems of Sect. 5
1.2.1 A.2.1 Proof of Theorem 3
The links emanating from the points Z and 0 are not neighbors iff
The probability that the points Z and 0 are not neighbors is
The random vector D Z +Z is Gaussian with independent coordinates. If Z=(x,y), the first coordinate of D Z +Z has mean x and variance σ 2. Its second coordinate has mean y and variance σ 2. Therefore, |D Z +Z|2/σ 2 follows a non centered χ 2 distribution with 2 degrees of freedom and with parameter
that is, with density
on ℝ+, where g q (s) is the density of the centered χ 2 distribution with q degrees of freedom. The tail distribution function of the density f |Z| is
and the expression for C(|Z|) follows.
The conditional probability that the points Z and 0 are not neighbors is
Let Z=(x,y)=(Rcos(θ),Rsin(θ)), −D 0=(rcos(ψ),rsin(ψ)). Given Z and given that |D 0|=r, the condition \(|Z-D_{0}|^{2} > \varepsilon_{T}^{-\frac{2}{\alpha}}\) can be rewritten as
or equivalently as
Hence, since ψ is uniform on [0,2π], we get
and the formula of C(R,r) follows.
1.2.2 A.2.2 Proof of Theorem 4
In the SIR guard zones case without fading and without power control, the links emanating from the points Z and 0 are not neighbors iff
with \(a=\gamma_{T}^{2/\alpha}\). Let Z=(x,y) and D Z =(u,v). The condition |Z+D Z |2>a|D Z |2 can be rewritten as
If a<1, this is equivalent to
If a>1, this is equivalent to
Finally, if a=1, this is equivalent to
Hence, the probability that the points Z and 0 are not neighbors is
If a<1,
where the first relation follows from the independence assumptions and the second from (52).
Similarly, if a>1,
whereas if a=1
with a⋅b denoting the scalar product of the vectors a and b in ℝ2.
In the case a≠1, the random vector D Z +1/(1−a)Z is Gaussian with independent coordinates. If Z=(x,y), its first coordinate has mean x/(1−a) and variance σ 2. Its second coordinate has mean y/(1−a) and variance σ 2. Therefore, |D Z +1/(1−a)Z|2/σ 2 follows a non-centered χ 2 distribution with 2 degrees of freedom and with parameter
that is, with density \(\widehat{f_{|Z|}}(s)\) and tail distribution function \(\overline{\widehat{F_{|Z|}}} (s)\) as given above. The expressions for C(|Z|) when a≠1 then follow.
In the case a=1, the random variable 2Z⋅D Z ∈ℝ is Gaussian, centered and of variance 4(x 2+y 2)σ 2. Hence, when denoting by A a \(\mathcal{N}(0,1)\) random variable,
The conditional probability that the points Z and 0 are not neighbors is
Let Z=(x,y)=(Rcos(θ),Rsin(θ)), −D 0=(rcos(ψ),rsin(ψ)). The condition |Z−D 0|2>a|D 0|2 can be rewritten as
or equivalently as
The formula for C(R,r) follows.
1.2.3 A.2.3 Proof of Theorem 5
The links emanating from the points Z and 0 are not neighbors iff
with \(a=\gamma_{T}^{2/\alpha}\). Let Z=(x,y)=(Rcos(θ),Rsin(θ)), D Z =(scos(ϕ),ssin(ϕ)) and D 0=(u,v)=(rcos(ψ),rsin(ψ)). The above condition can be rewritten as
or equivalently as
and
The expression for C(|Z|) follows.
The conditional probability that the points Z and 0 are not neighbors is
Let Z=(x,y)=(Rcos(θ),Rsin(θ)), −D 0=(rcos(ψ),rsin(ψ)). The condition |Z−D 0|2>a|D 0|2 can be rewritten as
or equivalently as
The expression for C(|Z|,r) follows.
1.2.4 A.2.4 Proof of Theorem 6
The links emanating from the points Z and 0 are not neighbors iff
Hence, the probability that the points Z and 0 are not neighbors is
The random variable |D Z +Z|2 follows a non centered χ 2 with two degrees of freedom and with parameter
The random variable F 0,Z is exponential with parameter 1. Hence the probability of collisions of the two links is
with
1.2.5 A.2.5 Proof of Theorem 7
The links emanating from the points Z and 0 are not neighbors iff
Hence, the probability that the points Z and 0 are not neighbors is
By the same arguments as above,
Hence, if |Z|=R,
with ϕ given as in the theorem.
1.2.6 A.2.6 Proof of Theorem 8
The links emanating from the points Z and 0 are not neighbors iff
Hence, the probability that the points Z and 0 are not neighbors is
By the same arguments as above, and using the fact that the ratio of two independent exponential random variables of parameter 1 has the density \(\frac{1}{(1+x)^{2}}\), we see that the last expression can be evaluated as
Using the same approach as in (29), we get
with ψ(R,a,b) as given in the theorem.
Rights and permissions
About this article
Cite this article
Baccelli, F., Li, J., Richardson, T. et al. On optimizing CSMA for wide area ad hoc networks. Queueing Syst 72, 31–68 (2012). https://doi.org/10.1007/s11134-012-9289-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-012-9289-7
Keywords
- Stochastic Geometry
- Poisson Point Process
- Matérn Point Process
- Wireless Network
- Spatial Reuse
- Power Control