Optimality bounds of the connectivity of adhoc networks with beamforming antennas

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2009, Pages

  Kiese, Moritz ^a   Hartmann, Christian ^a   Vilzmann, Robert ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNA MODEL; ANTENNA PATTERN; BEAMFORMING ANTENNA; COMPUTATIONAL STUDIES; FUTURE WIRELESS NETWORKS; HEURISTIC APPROACH; MIXED-INTEGER PROGRAMS; MULTI HOP COMMUNICATION; OPTIMAL PATHS; OPTIMAL SOLUTIONS; OPTIMALITY;

BEAMFORMING; HETEROGENEOUS NETWORKS; INTEGER PROGRAMMING; PLASMA WAVES; WIRELESS NETWORKS;

ANTENNAS;

EID: 77951611918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2009.5425735     Document Type: Conference Paper

References (13)

1. P. Santi and D. M. Blough, "The critical transmitting range for connectivity in sparse wireless ad hoc networks," Mar. 2003.
2. H. Liu, B. Zhang, J. Zheng, and H. T. Mouftah, "An energy-efficient localized topology control algorithm for wireless ad hoc and sensor networks," Int. J. Commun. Syst., vol. 21, no. 11, pp. 1205-1220, 2008.
3. D. M. Blough, M. Leoncini, G. Resta, and P. Santi, "Topology control with better radio models: Implications for energy and multi-hop interference," Perform. Eval., vol. 64, no. 5, pp. 379-398, 2007.
4. C. Bettstetter, C. Hartmann, and C. Moser, "How does randomized beamforming improve the connectivity of ad hoc networks?" in Proceedings of the IEEE ICC, Seoul, Korea, May 2005.
5. R. Vilzmann, J. Widmer, I. Aad, and C. Hartmann, "Low-complexity beamforming techniques for wireless multihop networks," in Proc. IEEE Conf. on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), Reston, USA, Sept. 2006.
6. R. Ramanathan, "On the performance of ad hoc networks with beamforming antennas," in Proc. ACM MobiHoc, Long Beach, USA, Oct. 2001.
7. G. B. Dantzig, Linear Programming and Extensions. Princeton, NJ, USA: Princeton University Press, 1963.
8. T. Achterberg, "Constraint Integer Programming," Ph.D. dissertation, Technische Universität Berlin, 2007, http://opus.kobv.de/ tuberlin/volltexte/2007/1611/.
9. C. Hartmann, M. Kiese, and R. Vilzmann, "Optimizing the node degree in wireless multihop networks with single-lobe beamforming," in Proc. of The 9th INFORMS Telecommunications Conference, College Park, MD, USA, Mar. 2008.
10. M. Pióro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks. San Francisco, CA, USA: Morgan Kaufmann Publishers, 2004.
11. M. D. Penrose, "On k-connectivity for a geometric random graph," Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
12. T. Achterberg, "Constraint Integer Programming," Ph.D. dissertation, Technische Universität Berlin, 2007.
13. (2009, June) Ilog cplex. [Online]. Available: http://www.ilog.com