Improving connectivity of wireless ad hoc networks

MobiQuitous 2005: Second Annual International Conference on Mobile and Ubiquitous Systems -Networking and Services

Volumn , Issue , 2005, Pages 314-324

  Li, Ning ^a   Hou, Jennifer C ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTIVITY IMPROVEMENT (CI); DELAUNAY TRIANGULATION; NETWORK TOPOLOGY; WIRELESS NETWORK;

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TOPOLOGY;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33749506466     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MOBIQUITOUS.2005.32     Document Type: Conference Paper

References (24)

1. M. Audeh. Metropolitan-scale Wi-Fi mesh networks. IEEE Computer, 37(12):119-121, Dec. 2004.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and approximation: combinatorial optimization problems and their upproximability properties. Springer-Verlag, Berlin, Germany, 1999.
3. M. de Berg, M. V. Kreveld, M. Overmars, and O. Schwarzkopf. Computational geometry: algorithms and applications. Springer-Verlag, New York, NY, USA, second edition, 2000.
4. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12(3):133-137, June 1981.
5. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., New York, NY, USA, 1979.
6. P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In Stochastic analysis, control, optimization and applications: a volume in honor of W. H. Fleming, pages 547-566. Birkhauser, Boston, MA, 1998.
7. T. He, C. Huang, B. M. Blum, J. A. Stankovic, and T. Abdelzaher. Range-free localization schemes for large scale sensor networks. In Proc. 9th ACM International Conference on Mobile Computing and Networking (MOBICOM), pages 81-95, San Diego, CA, USA, Sept. 2003.
8. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM, 32(1): 130-136, 1985.
9. D. S. Jonhson. The NP-completeness column: an ongoing guide. Journal of Algorithms, 3(2): 182-195, 1982.
10. S. Khuller. Approximation algorithms for finding highly connected subgraphs. In D. S. Hochbaum, editor, Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, MA, 1996.
11. N. Li and J. C. Hou. FLSS: a fault-tolerant topology control algorithm for wireless networks. In Proc. 10th ACM International. Conference on Mobile Computing and Networking (MOBICOM), pages 275-286, Philadelphia, PA, USA, Sept. 2004.
12. N. Li and J. C. Hou. Improving connectivity of wireless ad-hoc networks. Technical Report No. UIUCDCS-R-2004-2485, Department of Computer Science, University of Illinois at Urbana Champaign, Oct. 2004. (http://www.uiuc.edu/ ~nli/papers/connect.pdf).
13. S. Masuyama, T. Ibaraki, and T. Hasegawa. The computational complexity of the m-center problems on the plane. Transactions of the IECE of Japan, 64E(2):57-64, Feb. 1981.
14. M. D. Penrose. The longest edge of random minimal spanning tree. Annals of Applied Probability, 7(2):340-361, 1997.
15. S. Pettie and V. Ramachandran. An optimal minimum spanning tree algorithm. Journal of the ACM, 49(1): 16-34, Jan. 2002.
16. R. Prim. Shortest connection networks and some generalizations. The Bell System Technical Journal, 36:1389-1957, 1957.
17. J.-M. Robert and G. T. Toussaint. Computational geometry and facility location. In Proc. International Conference on Operations Research and Management Science, pages B1-B19, Manila, The Philippines, Dec. 1990.
18. P. Sass and J. Freebersyser. FCS communications technology for the objective force. MITRE Technical Papers, Mar. 2002. http://www.mitre.org/work/ tech_papers.
19. S.S. Skiena. The algorithm design manual. Springer-Verlag, New York, NY, USA, 1997.
20. K. J. Supowit. Topics in computational geometry. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, USA, 1981.
21. H.-Y. Tyan. Design, realization and evaluation of a component-based software, architecture for network simulation. PhD thesis, The Ohio State University, Columbus, OH, USA, 2001. http://www.j-sim.org.
22. P.-J. Wan and C.-W. Yi. Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In P roc. 5th ACM Symposium on Mobile. Ad Hoc Networking and Computing (MOBIHOC), Roppongi, Japan, May 2004.
23. F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. Wireless Networks, 10(2): 169-181, Mar. 2004.
24. M. Yannakakis. Node-and edge-deletion NP-complete problems. In Proc. Tenth Annual ACM Symposium on Theory of Computing, pages 253-264, San Diego, CA, USA, 1978.