On connectivity limits in Ad Hoc networks with beamforming antennas

Eurasip Journal on Wireless Communications and Networking

Volumn 2009, Issue , 2009, Pages

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

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNA CONFIGURATIONS; ANTENNA MODEL; BEAMFORMING ANTENNA; COLUMN GENERATION; COMMUNICATION NETWORKS; HEURISTIC APPROACH; K-CONNECTIVITY; LARGE-SCALE OPTIMIZATION; MIXED-INTEGER PROGRAMS; MULTIHOP WIRELESS NETWORK; NODE DEGREE; OPTIMALITY; OPTIMIZATION APPROACH; PATH PROBABILITY; REALISTIC SCENARIO;

AD HOC NETWORKS; BEAMFORMING; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PLASMA WAVES; WIRELESS TELECOMMUNICATION SYSTEMS;

ANTENNAS;

EID: 73449145260     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1155/2009/878419     Document Type: Article

References (37)

1. Bettstetter C., Hartmann C., Connectivity of wireless multihop networks in a shadow fading environment Proceedings of the 6th ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 03) 2003 New York, NY, USA ACM 28 32
2. Bettstetter C., On the minimum node degree and connectivity of a wireless multihop network Proceedings of the 3rd International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 02) June 2002 New York, NY, USA 80 91
3. Santi P., Blough D. M., Vainstein F., A probabilistic analysis for the range assignment problem in ad hoc networks Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 01) 2001 New York, NY, USA 212 220
4. Bettstetter C., Mobility modeling, connectivity, and adaptive clustering in ad hoc networks, Ph.D. dissertation 2003 Munich, Germany Technische Universitt Mnchen
5. Penrose M. D., The longest edge of the random minimal spanning tree Annals of Applied Probability 1997 7 2 340 361
6. Penrose M. D., On k-connectivity for a geometric random graph Random Structures and Algorithms 1999 15 2 145 164
7. Santi P., Blough D. M., The critical transmitting range for connectivity in sparse wireless ad hoc networks IEEE Transactions on Mobile Computing 2003 2 1 25 39
8. Li X.-Y., Wan P.-J., Wang Y., Yi C.-W., Fault tolerant deployment and topology control in wireless networks Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 03) June 2003 Annapolis, Md, USA 117 128
9. Wang L., Zhao W., Li Y., Qu Y., Liu Z., Chen Q., Sleep-supported and cone-based topology control method for wireless sensor networks Proceedings of the IEEE International Conference on Networking, Sensing and Control (ICNSC 08) April 2008 Sanya, China 1445 1448
10. Liu H., Zhang B., Zheng J., Mouftah H. T., An energy-efficient localized topology control algorithm for wireless ad hoc and sensor networks International Journal of Communication Systems 2008 21 11 1205 1220
11. Blough D. M., Leoncini M., Resta G., Santi P., Topology control with better radio models: implications for energy and multi-hop interference Performance Evaluation 2007 64 5 379 398
12. Vilzmann R., Bettstetter C., Medina D., Hartmann C., Hop distances and flooding in multihop networks with randomized beamforming Proceedings of the 8th ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 05) October 2005 Montreal, Canada 20 27
13. Bettstetter C., Hartmann C., Moser C., How does randomized beamforming improve the connectivity of ad hoc networks? Proceedings of the IEEE International Conference on Communications (ICC 05) May 2005 Seoul, Korea
14. Koskinen H., Analytical study of connectivity in wireless multihop networks utilizing beamforming Proceedings of the 9th ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 06) 2006 New York, NY, USA 212 218
15. Vilzmann R., Widmer J., Aad I., Hartmann C., Low-complexity beamforming techniques for wireless multihop networks 2 Proceedings of the 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks (SECON 06) September 2006 Reston, Va, USA 489 497
16. Zhou X., Jones H. M., Durrani S., Scott A., Effects of beamforming on the connectivity of ad hoc networks Proceedings of the 8th Australian Communications Theory Workshop (AusCTW 07) February 2007 Adelaide, Australia
17. Hartmann C., Kiese M., Vilzmann R., Optimizing the node degree in wireless multihop networks with single-lobe beamforming Proceedings of the 9th INFORMS Telecommunications Conference (INFORMS 08) March 2008 College Park, Md, USA
18. Kiese M., Hartmann C., Vilzmann R., Optimality bounds of the connectivity of adhoc networks with beamforming antennas Proceedings of the IEEE GLOBECOM (GLOBECOM 09) 2009 Honolulu, Hawaii, USA
19. Kiese M., Hartmann C., Lamberty J., Optimality criteria for the connectivity of adhoc networks with beamforming antennas Proceedings of the International Network Optimization Conference (INOC 09) April 2009 Pisa, Italy
20. Dantzig G. B., Linear Programming and Extensions 1963 Princeton, NJ, USA Princeton University Press
21. Chvtal V., Linear Programming 1983 New York, NY, USA W. H. Freeman
22. Bertsimas D., Tsitsiklis J. N., Introduction to Linear Optimization 1997 1st Cambridge, Mass, USA Athena Scientific Athena Scientific Optimization and Computation Series
23. Nemhauser G. L., Wolsey L. A., Integer and Combinatorial Optimisation 1998 1st Atlanta, Ga, USA John Wiley Sons
24. ILOG CPLEX 9.0 Users Manual. ILOG, S. A., 2003
25. Achterberg T., Constraint integer programming, Ph.D. dissertation 2007 Berlin, Germany Technische Universitt Berlin. http://opus.kobv.de/tuberlin/ volltexte/2007/1611
26. Pioro M., Mehdi D., Routing, Flow, and Capacity Design in Communication and Computer Networks 2004 Amsterdam, The Netherlands Elsevier
27. Ambs K., Cwilich S., Deng M., Houck D. J., Lynch D. F., Yan D., Optimizing restoration capacity in the ATT network Interfaces 2000 30 1 26 44
28. Trke U., Efficient methods for W-CDMA radio network planning and optimization, Ph.D. dissertation 2007
29. Geerdes H.-F., UMTS radio network planning: mastering cell coupling for capacity optimization, Ph.D. dissertation 2008 Berlin, Germany Technische Universitt Berlin
30. Gruber C., Kiese M., Optimization of resilient networks with column generation Proceedings of the 8th INFORMS Telecommunications Conference March 2006 Dallas, Tex, USA
31. Koster A. M. C. A., Orlowski S., Raack C., Baier G., Engel T., Single-layer cuts for multi-layer network design problems Telecommunications Modeling, Policy, and Technology 2008 February 44 chapter 1 College Park, Md, USA Springer 1 23
32. Ramanathan R., On the performance of ad hoc networks with beamforming antennas Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 01) 2001 New York, NY, USA 95 105
33. Dantzig G. B., Wolfe P., Decomposition principle for linear programs Operations Research 1960 8 1 101 111
34. Gilmore P. C., Gomory R. E., A linear programming approach to the cutting-stock problem Operations Research 1963 9 6 849 859
35. Gilmore P. C., Gomory R. E., A linear programming approach to the cutting stock problem part II Operations Research 1963 11 6 863 888
36. Dijkstra E. W., A note on two problems in connexion with graphs Numerische Mathematik 1959 1 1 269 271
37. Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H., Branch-and-price: column generation for solving huge integer programs Operations Research 1998 46 3 316 329