- Research Article
- Open Access
On Connectivity Limits in Ad Hoc Networks with Beamforming Antennas
EURASIP Journal on Wireless Communications and Networking volume 2009, Article number: 878419 (2009)
Multihop wireless networks will play an important role in future communication networks. Beamforming antennas have shown great potential to improve the connectivity in these networks; however only heuristic approaches exist to assess the benefits of this technology. Using the popular "keyhole" antenna model, we formulate a Mixed Integer Program (MIP) capable of acquiring optimal antenna configurations for path probability with various auxiliary constraints, node degree, and k-connectivity. We employ a problem-specific large-scale optimization approach named "column generation" to be able to cope with realistic scenario sizes without sacrificing optimality. In a case study, we show the feasibility of our optimization approach and demonstrate that "smarter" beamforming heuristics would still have plenty of room to improve the connectivity of such a network.
To access the full article, please see PDF.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Kiese, M., Hartmann, C., Lamberty, J. et al. On Connectivity Limits in Ad Hoc Networks with Beamforming Antennas. J Wireless Com Network 2009, 878419 (2009). https://doi.org/10.1155/2009/878419
- Optimization Approach
- Mixed Integer Program
- Node Degree
- Heuristic Approach
- Column Generation