Wireless Communication in Random Geometric Topologies

  • Luděk Kučera
  • Štěpán Kučera
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4240)


The present paper deals with communication in random geometric topologies; in particular, we model modern wireless ad hoc networks by random geometric topologies. The paper has two goals: the first is to implement the network power control mechanism extended by several wireless engineering features and to use the model to assess communicational properties of two typical random geometric topologies known from the literature in real-life conditions. The second goal is to suggest a modification of the “LowDegree” algorithm (one of the two studied topologies), which preserves excellent power requirements of the model, but matches the performance of the standard “UnitDisk” algorithm in terms of higher total network throughput.


Wireless Network Average Path Length Additive White Gaussian Noise Channel Spatial Reuse Power Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alouini, M.-S., Goldsmith, A.J.: Capacity of rayleigh fading channels under different adaptive transmission and diversity-combining techniques. IEEE Trans. Veh. Technol. 48(4), 1165–1181 (1999)CrossRefGoogle Scholar
  2. 2.
    Bambos, N.: Toward power-sensitive network architectures in wireless communications: Concepts, issues, and design aspects. IEEE Personal Commun. Mag. 5(3), 50–59 (1998)CrossRefGoogle Scholar
  3. 3.
    Chen, Q., Niu, Z.: A game-theoretical power and rate control for wireless ad hoc networks with step-up price. IEICE Transactions on Communications E88-B, 3515–3523 (2005)CrossRefGoogle Scholar
  4. 4.
    Clementi, A., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Networks and Applications (9), 125–140 (2004)Google Scholar
  5. 5.
    Goldsmith, A.: Wireless Communications. Cambridge University Press, Cambridge (2005)Google Scholar
  6. 6.
    Goldsmith, A.J., Wicker, S.B.: Design challenges for energy-constrained ad hoc wireless networks. IEEE Trans. Wireless Commun. 9(4), 8–27 (2002)CrossRefGoogle Scholar
  7. 7.
    Hou, T.C., Li, V.O.K.: Transmission range control in multihop packet radio networks. IEEE Trans. Commun. 34(1), 38–44 (1986)CrossRefGoogle Scholar
  8. 8.
    Kučera, L.: Low degree connectivity in ad-hoc networks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 203–214. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Michail, A., Ephremides, A.: Energy-efficient routing for connection-oriented traffic in wireless ad hoc networks. Mobile Networks and Applications 8, 517–533 (2003)CrossRefGoogle Scholar
  10. 10.
    Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)MATHCrossRefGoogle Scholar
  11. 11.
    Proakis, J.G. (ed.): Digital Communications, 4th edn. Irwin/McGraw-Hill (2001)Google Scholar
  12. 12.
    Raghunathan, V., Kumar, P.R.: A counterexample in congestion control of wireless networks. In: Proceedings of the 8th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Montreal, Canada, October 10–13, 2005, pp. 290–297 (2005)Google Scholar
  13. 13.
    Verdú, S.: Multiuser Detection. Cambridge University Press, New York (1998)MATHGoogle Scholar
  14. 14.
    Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wireless Networks (10), 169–181 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Luděk Kučera
    • 1
  • Štěpán Kučera
    • 2
  1. 1.Charles UniversityPragueCzech Republic
  2. 2.Kyoto UniversityKyotoJapan

Personalised recommendations