Efficient integration of multihop wireless and wired networks with QoS constraints

IEEE/ACM Transactions on Networking

Volumn 12, Issue 6, 2004, Pages 1064-1078

  Bejerano, Yigal ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximation algorithms; Clustering; Facility location; Sensor networks; Unit disk graphs; Wireless access network

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DESIGN; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS; CAPACITATED FACILITY LOCATION PROBLEM; CLUSTERING ALGORITHM; SENSOR NETWORKS; UNIT DISK GRAPHS; WIRELESS ACCESS NETWORK;

TELECOMMUNICATION NETWORKS;

EID: 11844278271     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.838599     Document Type: Article

References (25)

1. H. Bolcskei, A. J. Paulraj, K. V. S. Hari, R. Nabar, and W. W. Lu, "Fixed broadband wireless access: State of the art, challenges and future directions," IEEE Commun. Mag., vol. 39, pp. 100-108, Jan. 2001.
2. O. Momtahan and H. Hashemi, "A comparative evaluation of DECT, PACS and PHS standards for wireless local loop applications," IEEE Commun. Mag., vol. 39, pp. 156-163, May 2001.
3. G. Asada, M. Dong, T. S. Lin, F. Newberg, G. Pottie, W. J. Kaiser, and H. O. Marcy, "Wireless integrated network sensors: low power systems on a chip," in Proc. Eur. Solid State Circuits Conf., 1998.
4. W. R. Heinzelman, J. Kulik, and H. Balakrishnan, "Adaptive protocol for information dissemination in wireless sensor networks," in Proc. ACM MOBICOM, Seattle, WA, 1999, pp. 174-189.
5. D. A. Beyer, M. D. Vestrich, and J. J. Garcia-Luna-Aceves, "The rooftop community network: free, high-speed network access for communities," in The First 100 Feet: Options for Internet and Broadband Access, E. D. Hurley and J, H. Keller, Eds. Cambridge, MA: MIT Press, 1999.
6. Wireless Networking Reference - Community Wireless/Rooftop Systems. [Online]. Available: http://www.practicallynetworked.com/tools/ wireless_articles_community.htm
7. P.-H. Hsiao, A. Hwang, H. T. Kung, and D. Vlah, "Load balancing routing for wireless access networks," in Proc. IEEE INFOCOM, Apr. 2001, pp. 986-995.
8. R. Krishnan, R. Ramanathan, and M. Steenstrup, "Optimization algorithms for large self-structuring networks," in Proc. IEEE INFOCOM, New York, NY, Mar. 1999, pp. 71-78.
9. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, "Low diameter graph decomposition is in NC," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1992, vol. LNCS-621, pp. 83-93.
10. N. Linial and M. Saks, "Low diameter graph decompositions," Combinatorica, vol. 13, no. 4, pp. 441-454, 1993.
11. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, "Fast distributed network decomposition and covers," J. Parallel Distributed Comput. vol. 39, no. 2, pp. 105-114, Dec. 1996.
12. D. J. Baker and A. Ephremides, "The architectural organization of a mobile radio network via distributed algorithm," IEEE Trans. Commun. vol. COM-29, pp. 1694-1701, Nov. 1981.
13. C. R. Lin and M. Gerla, "Adaptive clustering for mobile wireless networks," IEEE J. Select. Areas Commun., vol. 15, pp. 1265-1275, Sept. 1997.
14. R. Ramanathan and M. Steenstrup, "Hierarchically-organized, multihop mobile wireless networks for quality-of-service support," Mobile Networks Applicat., vol. 3, no. 1, pp. 101-119, 1998.
15. A. D. Amis, R. Prakash, T. H. V. Vuong, and D. T. Huynh, "Max-min D-cluster formation in wireless ad hoc networks," in Proc. IEEE INFOCOM, 2000, pp. 32-41.
16. B. Liang and Z. J. Haas, "Virtual backbone generation and maintenance in ad hoc network mobility management," in Proc. IEEE INFOCOM, 2000, pp. 1293-1302.
17. IEEE J. Select. Areas Commun., vol. 17, Aug. 1999.
18. S. Banerjee and S. Khuller, "A clustering scheme for hierarchical control in wireless networks," in Proc. IEEE INFOCOM, 2001, pp. 1028-1037.
19. D. B. Shmoys, E. Tardos, and K. Aardal, "Approximation algorithms for facility location problems," in Proc. ACM Symp. Theory of Computing 1997, pp. 265-274.
20. K. Jain and V. V. Vazirani, "Primal-dual approximation algorithms for metric facility location and k-median problems," in Proc. IEEE Symp. Foundations of Computer Science, 1999, pp. 2-13.
21. D. S. Hochbaum and W. Maass, "Approximation schemes for covering and packing problems in image processing and VLSI," J. ACM, vol. 32, no. 1, pp. 130-136, 1985.
22. D. S. Hochbaum, Ed., Approximation Algorithm for NP-Hard Problem: PWS Publishing, 1997.
23. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit disk graphs," Discrete Mathematics, vol. 86, pp. 165-177, 1990.
24. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. New York: Freeman, 1979.
25. V. Chvatal, "A greedy heuristic for the set-covering problem," Math. Oper. Res., vol. 4, no. 3, pp. 233-235, 1979.