Abstract
Connectivity in wireless ad hoc and sensor networks is typically analyzed using a graph-theoretic approach. In this paper, we investigate an alternative communication-theoretic approach for determining the minimum transmit power required for achieving connectivity. Our results show that, if there is significant multipath fading and/or multiple access interference in the network, then graph-theoretic approaches can substantially underestimate the minimum transmit power required for connectivity. This is due to the fact that graph-theoretic approaches do not take the route quality into consideration. Therefore, while in scenarios with line-of-sight (LOS) communications a graph-theoretic approach could be adequate for determining the minimum transmit power required for connectivity, in scenarios with strong multipath fading and/or multiple access interference a communication-theoretic approach could yield much more accurate results and, therefore, be preferable.








Similar content being viewed by others
Notes
The worst case is obviously given by a multi-hop route where all links have the maximum length, since the attenuation in each link is highest [23].
This assumption of interfering range is for analytical purposes only. A more conservative assumption, such that the interfering range is longer than twice the transmission range, can also be used.
In computing \({\mathbb{E}} [P_{\rm int}^{\rm single}],\) for z < 1, we assume that the interference power is αP t as opposed to \(\alpha P_{\rm t}/z^2;\) otherwise, the interference power will be amplified and not attenuated.
This is true for the considered random access MAC protocol because it does not use carrier-sensing and each node adds an independent random backoff time before transmitting a packet.
See Appendix 1 for more details.
The first order Taylor series expansion is motivated by the fact that in typical operative conditions it holds that p ≪ 1, i.e., \({\frac{\lambda L}{R_{\rm b}}} \ll 1.\)
For z < 1, we assume that the interference power is αP t and not \(\alpha P_{\rm t}/z^2;\) otherwise, the interference power will be amplified as opposed to be attenuated.
References
Cheng, Y.-C., & Robertazzi, T. G. (1989, July). Critical connectivity phenomena in multihop radio models. IEEE Transactions on Communications, 37(7), 770–777.
Philips, T. K., Panwar, S. S., & Tantawi, A. N. (1989, September). Connectivity properties of a packet radio network model. IEEE Transactions on Information Theory, 35(5), 1044–1047.
Piret, P. (1991, September). On the connectivity of radio networks. IEEE Transactions on Information Theory, 37(5), 1490–1492.
Desai, M., & Manjunath, D. (2002, October). On the connectivity in finite ad hoc networks. IEEE Communication Letters, 6(10), 437–439.
Ghasemi, A., & Nader-Esfahani, S. (2006, April). Exact probability of connectivity in one-dimensional ad hoc wireless networks. IEEE Communication Letters, 10(4), 251–253.
Bettstetter, C. (2002). On the minimum node degree and connectivity of a wireless multihop network. In Proceedings of the ACM international symposium on mobile ad hoc networking and computing (MOBIHOC) (pp. 80–91). Switzerland: Lausanne.
Santi, P., & Blough, D. (2003, January–March). The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(1), 25–39.
Ravelomanana, V. (2004, July–September). Extremal properties of three-dimensional sensor networks with applications. IEEE Transactions on Mobile Computing, 3(3), 246–257.
Wan, P., & Yi, C. (2005, March). Asymptotic critical transmission ranges for connectivity in wireless ad hoc networks with Bernoulli nodes. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC) (Vol. 4, pp. 2219–2224), New Orleans, LA, USA.
Santi, P. (2005, May–June). The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 4(3), 310–317.
Xue, F., & Kumar, P. R. (2004, March). The number of neighbors needed for connectivity of wireless networks. Wireless Networks, 10(2), 169–181.
Gupta, P., & Kumar, P. R. (2000, March). The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2), 388–404.
West, D. (2000). Introduction to graph theory (2nd ed.). Upper Saddle River, NJ: Prentice-Hall.
Dousse, O., Baccelli, F., & Thiran, P. (2005, April). Impact of interferences on connectivity of ad hoc networks. IEEE/ACM Transactions on Networking, 13(2), 425–436.
Tonguz, O. K., & Ferrari, G. (2006). Ad hoc wireless networks: A communication-theoretic perspective. Wiley.
Ferrari, G., & Tonguz, O. K. (2004). Minimum number of neighbors for fully connected uniform ad hoc wireless networks. In Proceedings of the IEEE international conference on communications (ICC) (Vol. 7, pp. 4331–4335), Paris, France.
Tonguz, O. K., & Ferrari, G. (2004, February). Is the number of neighbors in ad hoc wireless networks a good indicator of connectivity? In Proceedings of the international Zurich seminar on communications (IZS’04) (pp. 40–43), Zurich, Switzerland.
Georgiadis, L., Neely, M. J., & Tassiulas, L. (2006, April). Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, 1(1), 1–144.
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007, January). Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE, 95(1), 255–312.
Mecke, K., & Stoyan, D. (Eds.). (2000). Statistical physics and spatial statistics—the art of analyzing and modeling spatial structures and pattern formation. Springer.
Orinoco classic gold PC card. Data Sheet, available at http://www.proxim.com/learn/library/datasheets/gold_pc card.pdf.
Penrose, M. D. (1999, July). On k-connectivity for a geometric random graph. Random Structures and Algorithms, 15(2), 145–164.
Rappaport, T. S. (1996). Wireless communications principles and practice. Upper Saddle River, NJ: Prentice-Hall.
Haykin, S., & Moher, M. (2004). Modern wireless communications. Upper Saddle River, NJ: Prentice-Hall.
Stallings, W. (2004). Wireless communications and networking (2nd ed.). Upper Saddle River, NJ: Prentice-Hall.
Lin, X., Shroff, N. B., & Srikant, R. (2006, August). A tutorial on cross-layer optimization in wireless networks. IEEE Journal of Selected Areas in Communications, 24(8), 1452–1463.
Li, J., Blake, C., Couto, D., Lee, H., & Morris, R. (2001, July). Capacity of ad hoc wireless networks. In Proceedings of the ACM international conference on mobile computing and networking (MOBICOM) (pp. 61–69), Rome, Italy.
Panichpapiboon, S. (2006, September). Practical design issues in ad hoc wireless networks: Transmit power, topology, and routing. Ph.D. dissertation, Pittsburgh, PA, USA: Carnegie Mellon University.
Royer, E. M., & Toh, C.-K. (1999, April). A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 6(2), 46–55.
Goldsmith, A., & Chua, S.-G. (1997, October). Variable-rate variable-power MQAM for fading channels. IEEE Transactions on Communications, 45(10), 1218–1230.
Qiu, X., & Chawla, K. (1999). On the performance of adaptive modulation in cellular systems. IEEE Transactions on Communications, 47(6), 884–894.
Zigbee Alliance Website. http://www.zigbee.org.
The Network Simulator (NS-2) Website [Online document]. http://www.isi.edu/nsnam/ns/.
Sankaran, C., & Ephremides, A. (2002, November). The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks. IEEE Transactions on Information Theory, 48(11), 2873–2887.
Fantacci, R., Ferri, A., & Tarchi, D. (2005, March). A MAC technique for CDMA based ad-hoc networks. In Proceedings of the IEEE wireless communications and networking conference (WCNC) (Vol. 1, pp. 645–650), New Orleans, LA, USA.
Zhou, X., Li, J., & Yang, J. (2005, October). A novel power control algorithm and MAC protocol for CDMA-based mobile ad hoc network. In Proceedings of the IEEE military communications conference (MILCOM) (pp. 1–7), Atlantic City, NJ, USA.
Proakis, J. G. (2001). Digital communications (4th ed.). New York, NY: McGraw-Hill.
Bettstetter, C., & Hartmann, C. (2005, September). Connectivity of wireless multihop networks in a shadow fading environment. Wireless Networks, 11(5), 571–579.
Panichpapiboon, S., Ferrari, G., & Tonguz, O. K. (2006, October). Optimal transmit power in wireless sensor networks. IEEE Transactions on Mobile Computing, 5(10), 1432–1447.
Kleinrock, L., & Silvester, J. A. (1978). Optimum transmission radii for packet radio networks or why six is a magic number. In National Telecommunications Conference (pp. 4.3.1–4.3.5).
Takagi, H., & Kleinrock, L. (1984, March). Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications, COM-32(3), 246–257.
Hou, T., & Li, V. (1986, January). Transmission range control in multihop packet radio networks. IEEE Transactions on Communications, COM-34(1), 38–44.
Ramanathan, R., & Rosales-Hain, R. (2000, March). Topology control of multihop wireless networks using transmit power adjustment. In Proceedings of the IEEE conference on computer communications (INFOCOM) (Vol. 2, pp. 404–413), Tel-Aviv, Israel.
Blough, D., Leoncini, M., Resta, G., & Santi, P. (2003). The K-neigh protocol for symmetric topology control in ad hoc networks. In Proceedings of the ACM international symposium on mobile ad hoc networking and computing (MOBIHOC) (pp. 141–152), Annapolis, MD, USA.
Acknowledgment
We would like to thank Stefano Busanelli (University of Parma, Italy) for helping us in obtaining the NS-2-based simulation results presented in Sect. 6.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Derivation of the BER Floor for the Strong LOS Case
Consider the link between the transmitter (node Tx) and the receiver (node Rx) shown in Fig. 9. For simplicity, we will first consider the scenario where there is only one interfering node within the effective interference region, which is the circular area of radius 2r 0 around the receiver. We will also assume that r 0 ≥ 1, which will be true for all the scenarios considered in this paper. The amplitude of the observable signal can generally be written as
where S sig is the amplitude of the signal transmitted by node Tx, S i is the amplitude of the signal from the interfering node, and W therm is the amplitude of the additive white Gaussian noise (AWGN) with variance P therm.
Assuming free space propagation loss, the received signal power observed at the receiver can be written as
where \(\alpha = {\frac{G_{\rm t} G_{\rm r} c^2}{(4 \pi)^2 f_{\rm c}^2}}, G_{\rm t}\) and G r are the transmitter and the receiver antenna gains, f c is the carrier frequency, c is the speed of light, P t is the transmit power, and r 0 is the distance between the transmitter and the receiver. Assuming BPSK modulation, the amplitude of the signal transmitted by node Tx observed at the receiver can then be written as
where \(\sqrt{E_{\rm b}} \triangleq \sqrt{{P_{\rm t}}/{R_{\rm b}}}\) is the transmit bit energy and R b is the data-rate. Let z be the distance between the interfering node and the receiver. Similarly, the amplitude of the interfering signal can be written as
Assuming a simple random access MAC protocol with Poisson transmission, the probability that the interfering node will interfere with an ongoing transmission can be given as
where λ is the packet transmission rate in pck/s and L is the number of bits in a packet. From (34) and (35), the probability mass function (PMF) of the amplitude of the interfering signal can then be given as
Since we are considering a binary modulation, due to symmetry we can assume that node Tx transmits “+1” (i.e., \(S_{\rm sig} = \sqrt{\alpha E_{\rm b}} / r_0\)). Given that there is only one potential interfering node, the bit error probability can be expressed as follows [28]:
where \(\sigma = \sqrt{FkT_0/2}, F\) is the noise figure, k = 1.38 × 10−23J/K, T 0 = 300 K is the room temperature, and \(Q(x) = \int_{x}^{\infty} {\frac{1}{\sqrt{2 \pi}}} e^{-u^2/2} {\rm d} u\) is the standard Q-function.
As observed from the simulation results, at a particular node spatial density, if the transmit power is high enough, the link BER converges to a BER floor. Thus, to derive the BER floor, we take the limit, as E b approaches ∞, of the conditional link BER in (36), obtaining:
where in the last passage we have used the fact that \(Q(+\infty) = 0.\) Note that the argument of the Q-function in the last line in (37) can either be positive or negative, depending on the value of z. To find the total bit error probability, we have to consider all possible values of z. With a straightforward algebra, it can be shown that the PDF of z is
Given that there is only one potential interfering node, the link BER floor can then be written asFootnote 8
Now, let us consider the case where there are two potential interfering nodes within the effective interference region, as shown in Fig. 10. Let the interfering node 1 be at distance z 1 from to the receiver and let the interfering node 2 be at distance z 2 from the receiver. Following the same approach as in the case with a single interfering node, the conditional link BER floor, given z 1 and z 2, can be written as
For small values of p (as in operative conditions with the used MAC protocol), the terms with coefficient p 2 can be neglected, and the conditional link BER floor can be approximated as
To find the average BER floor with respect to all possible positions of the pairs of interfering nodes, one can integrate the expression in (38) by weighing it with the joint PDF of z 1 and z 2. With straightforward algebra, the link BER floor, given that there are two potential interfering nodes, can be approximated as
Similarly, for the scenarios with m interfering nodes, the BER floor can be approximated as
While the observed derivation leads to the computation of the BER floor for a given number of interferers, in reality, however, the number of potential interfering nodes in the effective interference region is random. Let Y be a random variable denoting the number of nodes in the effective interference region, and let M be the number of interfering nodes. Excluding the transmitter and the receiver, the number of potential interfering nodes is M = Y − 2 (given that Y ≥ 2), and the PMF of M is
where \(\nu = \pi(2 r_0)^2\) is the area of the effective interference region. Finally, the overall average BER floor becomes
The link BER floor given in (39) can be further simplified. Since P{Y = 0} and P{Y = 1} are typically very small with the network sizes of interest, \({\mathbb{E}}[M]\) is very close to \({\mathbb{E}}[Y] - 2,\) where \({\mathbb{E}}[Y] = \rho_{\rm s} \nu.\) It can be shown that \({\mathbb{E}}[M]\) and \({\mathbb{E}}[Y] - 2\) are almost identical [28]. Thus, the BER floor can be approximated as
The validity of the approximate expression (40) has been verified through Monte Carlo simulations [28].
Appendix 2: Derivation of the BER floor in the Rayleigh fading case
In this appendix, we focus on the case with multipath fading. Consider the scenario with only one interfering node in the effective interference region, as shown in Fig. 9. With multipath fading, the amplitude of the observed signal can generally be written as
where X s and X i are Rayleigh distributed random variables. The bit error probability given that X s = x s, X i = x i , and the interfering node is at distance z relative to the receiver can be written as
At any node spatial density, provided that the transmit power is large enough, the link BER converges to a BER floor [28]. Thus, to derive the BER floor, we take the limit, as E b approaches \(\infty,\) of the conditional link BER in (41), obtaining
where in the last passage we have used the fact that \(Q(+\infty) = 0.\) Note that the argument of the Q-function in the last line in (42) can either be positive or negative, depending on the values of x s, x i , and z. The argument of the Q-function will be negative if \({\frac{x_{\rm s}}{r_0}} - {\frac{x_i}{z}} < 0,\) or equivalently \(x_i > x_{\rm s} z/r_0.\) Thus, the probability can now be written as
Integrating over all possible values of z, one gets
Following the same approach as considered in the case with single interfering node, the BER floor given that there are two interfering nodes and small values of p can be approximated as [28]
and the overall BER floor (without conditioning on the number of interfering nodes) can be approximated as
Rights and permissions
About this article
Cite this article
Panichpapiboon, S., Ferrari, G. & Tonguz, O.K. Connectivity of ad hoc wireless networks: an alternative to graph-theoretic approaches. Wireless Netw 16, 793–811 (2010). https://doi.org/10.1007/s11276-009-0169-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-009-0169-y