Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Bambos, N.: Toward power-sensitive network architectures in wireless communications: Concepts, issues, and design aspects. IEEE Personal Commun. Mag. 5(3), 50–59 (1998)
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)
Clementi, A., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Networks and Applications (9), 125–140 (2004)
Goldsmith, A.: Wireless Communications. Cambridge University Press, Cambridge (2005)
Goldsmith, A.J., Wicker, S.B.: Design challenges for energy-constrained ad hoc wireless networks. IEEE Trans. Wireless Commun. 9(4), 8–27 (2002)
Hou, T.C., Li, V.O.K.: Transmission range control in multihop packet radio networks. IEEE Trans. Commun. 34(1), 38–44 (1986)
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)
Michail, A., Ephremides, A.: Energy-efficient routing for connection-oriented traffic in wireless ad hoc networks. Mobile Networks and Applications 8, 517–533 (2003)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Proakis, J.G. (ed.): Digital Communications, 4th edn. Irwin/McGraw-Hill (2001)
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)
Verdú, S.: Multiuser Detection. Cambridge University Press, New York (1998)
Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wireless Networks (10), 169–181 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kučera, L., Kučera, Š. (2006). Wireless Communication in Random Geometric Topologies. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2006. Lecture Notes in Computer Science, vol 4240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963271_10
Download citation
DOI: https://doi.org/10.1007/11963271_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69085-6
Online ISBN: 978-3-540-69087-0
eBook Packages: Computer ScienceComputer Science (R0)