Integer and combinatorial optimization
Integer and combinatorial optimization
On k-connectivity for a geometric random graph
Random Structures & Algorithms
On the performance of ad hoc networks with beamforming antennas
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A probabilistic analysis for the range assignment problem in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Introduction to Linear Optimization
Introduction to Linear Optimization
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Hop distances and flooding in wireless multihop networks with randomized beamforming
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Analytical study of connectivity in wireless multihop networks utilizing beamforming
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
An energy-efficient localized topology control algorithm for wireless ad hoc and sensor networks
International Journal of Communication Systems
Optimality bounds of the connectivity of adhoc networks with beamforming antennas
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Hi-index | 0.00 |
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.