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
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
An energy-efficient localized topology control algorithm for wireless ad hoc and sensor networks
International Journal of Communication Systems
On connectivity limits in ad hoc networks with beamforming antennas
EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
Path Planning for UAVs Under Communication Constraints Using SPLAT! and MILP
Journal of Intelligent and Robotic Systems
| Hi-index | 0.00 |
Future wireless networks will be characterized by heterogeneous network architectures, with multihop communication as an important aspect. It is not clear yet how much multihop communication can benefit from the use of beamforming antennas. Heuristic approaches to control the direction of the antenna pattern to improve the connectivity exist, however it remains unclear how far they are away from an optimal solution. Employing the widely used "keyhole" antenna model, we develop a Mixed Integer Program (MIP) in order to find the optimal path-probability in a given scenario and therebey acquire provable bounds for comparison with the heuristic approaches, which we present in a computational study.