Abstract
We investigate the unicast problem for ad-hoc networks in the plane using MIMO techniques. In particular, we use the multi-node beamforming gain and present a self-synchronizing algorithm for the necessary carrier phase synchronization. First, we consider n nodes in a grid where the transmission power per node is restricted to reach the neighboring node. We extend the idea of multi-hop routing and relay the message by multiple nodes attaining joint beamforming gain with higher reception range. In each round, the message is repeated by relay nodes at dedicated positions after a fixed waiting period. Such simple algorithms can send a message from any node to any other node in time \(\mathcal{O}(\log \log n - \log \lambda)\) and with asymptotical energy \(\mathcal{O}(\sqrt{n})\), the same energy an optimal multi-hop routing strategy needs using short hops between source and target. Here, λ denotes the wavelength of the carrier. For λ ∈ Θ(1) we prove a tight lower time bound of Ω(loglogn).
Then, we consider n randomly distributed nodes in a square of area n and we show for a transmission range of \(\Theta(\sqrt{\log n})\) and for a wavelength of λ = Ω(log− 1/2 n) that the unicast problem can be solved in \(\mathcal{O}(\log \log n)\) rounds as well. The corresponding transmission energy increases to \(\mathcal{O}(\sqrt{n} \log n)\). Finally, we present simulation results visualizing the nature of our algorithms.
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
Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications, pp. 547–566. Springer (1998)
Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory 46, 388–404 (2000)
Janson, T., Schindelhauer, C.: Analyzing Randomly Placed Multiple Antennas for MIMO Wireless Communication. In: Fifth International Workshop on Selected Topics in Mobile and Wireless Computing (IEEE STWiMob), Barcelona (2012)
Janson, T., Schindelhauer, C.: Broadcasting in Logarithmic Time for Ad Hoc Network Nodes on a Line using MIMO. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013. ACM (July 2013)
Janson, T., Schindelhauer, C.: Ad-Hoc Network Unicast in O(log log n) using Beamforming, http://arxiv.org/abs/1405.0417 (May 2014)
Merzakreeva, A., Özgür, A., Lévêque, O.: Telescopic beamforming for large wireless networks. In: IEEE Int. Symposium on Information Theory, Istanbul (2013)
Niesen, U., Gupta, P., Shah, D.: On Capacity Scaling in Arbitrary Wireless Networks. IEEE Transactions on Information Theory 55(9), 3959–3982 (2009)
Özgür, A., Leveque, O., Tse, D.: Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks. IEEE Transactions on Information Theory 53(10), 3549–3572 (2007)
Tse, D., Viswanath, P.: Fundamentals of wireless communication. Cambridge University Press, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Janson, T., Schindelhauer, C. (2014). Self-synchronized Cooperative Beamforming in Ad-Hoc Networks. In: Felber, P., Garg, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2014. Lecture Notes in Computer Science, vol 8756. Springer, Cham. https://doi.org/10.1007/978-3-319-11764-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-11764-5_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11763-8
Online ISBN: 978-3-319-11764-5
eBook Packages: Computer ScienceComputer Science (R0)