The Annals of Applied Probability

Achieving nonzero information velocity in wireless networks

Srikanth Iyer and Rahul Vaze

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for the signal-to-interference-plus-noise-ratio (SINR) model with node locations distributed according to a Poisson point process. Consequently, the information velocity, defined as the limit of the ratio of the distance to the destination and the time taken for a packet to successfully reach the destination over multiple hops, is zero, as the distance tends to infinity. A nearest neighbor distance based power control policy is proposed to show that the expected delay required for a packet to be successfully received at the nearest neighbor can be made finite. Moreover, the information velocity is also shown to be nonzero with the proposed power control policy. The condition under which these results hold does not depend on the intensity of the underlying Poisson point process.

Article information

Source
Ann. Appl. Probab., Volume 27, Number 1 (2017), 48-64.

Dates
Received: January 2015
Revised: November 2015
First available in Project Euclid: 6 March 2017

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1488790821

Digital Object Identifier
doi:10.1214/16-AAP1196

Mathematical Reviews number (MathSciNet)
MR3619781

Zentralblatt MATH identifier
1382.68019

Subjects
Primary: 60D05: Geometric probability and stochastic geometry [See also 52A22, 53C65]
Secondary: 60F15: Strong theorems 60K30: Applications (congestion, allocation, storage, traffic, etc.) [See also 90Bxx]

Keywords
Wireless networks SINR graphs expected delay information velocity

Citation

Iyer, Srikanth; Vaze, Rahul. Achieving nonzero information velocity in wireless networks. Ann. Appl. Probab. 27 (2017), no. 1, 48--64. doi:10.1214/16-AAP1196. https://projecteuclid.org/euclid.aoap/1488790821


Export citation

References

  • [1] Andrews, J., Weber, S., Kountouris, M. and Haenggi, M. (2010). Random access transport capacity. IEEE Trans. Wireless Commun. 9 2101–2111.
  • [2] Andrews, J. G., Baccelli, F. and Ganti, R. K. (2011). A tractable approach to coverage and rate in cellular networks. IEEE Trans. Commun. 59 3122–3134.
  • [3] Baccelli, F., Błaszczyszyn, B. and Haji-Mirsadeghi, M.-O. (2011). Optimal paths on the space–time SINR random graph. Adv. in Appl. Probab. 43 131–150.
  • [4] Baccelli, F., Błaszczyszyn, B. and Mühlethaler, P. (2006). An aloha protocol for multihop mobile wireless networks. IEEE Trans. Inform. Theory 52 421–436.
  • [5] Borbash, S. A., Ephremides, A. and McGlynn, M. J. (2007). An asynchronous neighbor discovery algorithm for wireless sensor networks. Ad Hoc Networks 5 998–1016.
  • [6] Durrett, R. (1999). Stochastic spatial models. SIAM Rev. 41 677–718.
  • [7] Ganti, R. K. and Haenggi, M. (2009). Bounds on the information propagation delay in interference-limited aloha networks. In International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks. WiOPT 2009 1–7. IEEE, Seoul.
  • [8] Gupta, P. and Kumar, P. R. (2000). The capacity of wireless networks. IEEE Trans. Inform. Theory 46 388–404.
  • [9] Haenggi, M. (2013). Stochastic Geometry for Wireless Networks. Cambridge Univ. Press, Cambridge.
  • [10] Hammersley, J. M. and Welsh, D. J. A. (1965). First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. In Proc. Internat. Res. Semin., Statist. Lab., Univ. California, Berkeley, CA 61–110. Springer, New York.
  • [11] Jacquet, P., Mans, B., Muhlethaler, P. and Rodolakis, G. (2009). Opportunistic routing in wireless ad hoc networks: Upper bounds for the packet propagation speed. IEEE J. Sel. Areas Commun. 27 1192–1202.
  • [12] Kesten, H. (1986). Aspects of first passage percolation. In École D’été de Probabilités de Saint-Flour, XIV—1984. Lecture Notes in Math. 1180 125–264. Springer, Berlin.
  • [13] Krengel, U. (1985). Ergodic Theorems. De Gruyter Studies in Mathematics 6. de Gruyter, Berlin.
  • [14] Mollison, D. (1977). Spatial contact models for ecological and epidemic spread. J. R. Stat. Soc. Ser. B. Stat. Methodol. 39 283–326.
  • [15] Mollison, D. (1978). Markovian contact processes. Adv. in Appl. Probab. 10 85–108.
  • [16] Tse, D. and Viswanath, P. (2005). Fundamentals of Wireless Communication. Cambridge Univ. Press, New York, NY.
  • [17] Vaze, R. (2011). Throughput-delay-reliability tradeoff with ARQ in wireless ad hoc networks. IEEE Trans. Wireless Commun. 10 2142–2149.
  • [18] Weber, S. P., Yang, X., Andrews, J. G. and de Veciana, G. (2005). Transmission capacity of wireless ad hoc networks with outage constraints. IEEE Trans. Inform. Theory 51 4091–4102.
  • [19] Yu, Y., Govindan, R. and Estrin, D. (2001). Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Technical report ucla/csd-tr-01-0023, UCLA Computer Science Department.