Construction and Maintenance of Wireless Mobile Backbone Networks

IEEE/ACM Transactions on Networking

Volumn 17, Issue 1, 2009, Pages 239-252

  Modiano, Eytan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Columbia University ^*  (United States)

Author keywords

Approximation algorithms; controlled mobility; disk cover; distributed algorithms; wireless networks

Indexed keywords

EID: 85008030085     PISSN: 10636692     EISSN: 15582566     Source Type: Journal    
DOI: 10.1109/TNET.2009.2012474     Document Type: Article

References (30)

1. D. J. Baker and A. Ephrennmides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Trans. Commun., vol. COM-29, pp. 1694–1701, 1981.
2. D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, and G. Xue, “Approximations for Steiner trees with minimum number of Steiner points,” J. Global Optimization, vol. 18, no. 1, pp. 17–33, 2000.
3. X. Cheng, D.-Z. Du, L. Wang, and B. Xu, “Relay sensor placement in wireless sensor networks,” in ACM/Springer WINET, 2008.
4. B. Das, R. Sivakumar, and V. Bharghavan, “Routing in ad-hoc networks using a virtual backbone,” in Proc. IEEE ICCCN’97, Sep. 1997.
5. M. Franceschetti, M. Cook, and J. Bruck, “A Geometric Theorem for Approximate Disk Covering Algorithms,” Caltech, Technical Report ETR035, 2001.
6. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Discrete mobile centers,” Disc. Comput. Geom., vol. 30, no. 1, pp. 45–63, 2003.
7. M. R. Garey and D. S. Johnson, Computers and Intractibility. San Francisco, CA: Freeman, 1979.
8. M. Gerla and J. T. Tsai, “Multicluster, mobile, multimedia radio network,” ACM/Kluwer Wireless Networks, vol. 1, no. 3, pp. 255–265, 1995.
9. T. Gonzalez, “Covering a set of points in multidimensional space,” Inf. Proc. Lett., vol. 40, no. 4, pp. 181–188, 1991.
10. D. Gu, G. Pei, M. Gerla, and X. Hong, “Integrated hierarchical routing for heterogeneous multi-hop networks,” in Proc. IEEE MILCOM’00, 2000.
11. S. Guha and S. Khuller, “Improved methods for approximating node weighted Steiner trees and connected dominating sets,” Inf. Comput., vol. 150, no. 1, pp. 57–74, 1999.
12. H. Gupta, S. Das, and Q. Gu, “Connected sensor cover: self organization of sensor networks for efficient query execution,” in Proc. ACM MOBIHOC’03, Jun. 2003.
13. J. Hershberger, “Smooth kinetic maintenance of clusters,” in Proc. ACM SoCG’03, Jun. 2003.
14. J. Hershberger and S. Suri, “Finding tailored partitions,” J. Algorithms, vol. 12, no. 3, pp. 431–463, 1991.
15. 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.
16. H. Huang, A. Richa, and M. Segal, “Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks,” ACM/Kluwer MONET, vol. 9, no. 2, pp. 151–161, 2004.
17. A. Kansal, M. Rahimi, D. Estrin, W. J. Kaiser, G. J. Pottie, and M. B. Srivastava, “Controlled mobility for sustainable wireless sensor networks,” in Proc. IEEE SECON’04, Oct. 2004.
18. P. Klein and R. Ravi, “A nearly best-possible approximation algorithm for node-weighted Steiner trees,” J. Algorithms, vol. 19, no. 1, pp. 104–115, 1995.
19. G. Lin and G. Xue, “Steiner tree problem with minimum number of Steiner points and bounded edge-length,” Inf. Proc. Lett., vol. 69, no. 2, pp. 53–57, 1999.
20. M. Lu, J. Wu, M. Cardei, and M. Li, “Energy-efficient connected coverage of discrete targets in wireless sensor networks,” Proc. ICCNMC’ 05, Aug. 2005.
21. J. Luo and J.-P. Hubaux, “Joint mobility and routing for lifetime elongation in wireless sensor networks,” in Proc. IEEE INFOCOM’05, Mar. 2005.
22. J. S. Provan, “Convexity and the Steiner tree problem,” Networks, vol. 18, no. 1, pp. 55–72, 1988.
23. I. Rubin, A. Behzad, R. Zhang, H. Luo, and E. Caballero, “TBONE: A mobile-backbone protocol for ad hoc wireless networks,” in Proc. IEEE Aerospace Conf., Mar. 2002.
24. A. Segev, “The node-weighted Steiner tree problem,” Networks, vol. 17, no. 1, pp. 1–17, 1987.
25. A. Srinivas, G. Zussman, and E. Modiano, “Construction and maintenance of a mobile backbone for wireless networks,” MIT/LIDS Technical Report #2676, Oct. 2005 [Online]. Available: http://web.mit.edu/ modiano/www/papers/T11.pdf
26. A. Srinivas and G. Z. Modiano, “Mobile backbone networks—construction and maintenance,” in Proc. ACM MOBIHOC’06, May 2006.
27. A. Srinivas, G. Zussman, and E. Modiano, “Distributed mobile disk cover—a building block for mobile backbone networks,” in Proc. Allerton Conf. Commun., Cont., Comput., Sep. 2006.
28. C. Swamy and A. Kumar, “Primal-dual algorithms for connected facility location problems,” Algorithmica, vol. 40, no. 4, pp. 245–269, 2004.
29. J. Tang, B. Hao, and A. Sen, “Relay node placement in large scale wireless sensor networks,” Comput. Commun., vol. 29, no. 4, pp. 490–501, 2006.
30. K. Xu, X. Hong, and M. Gerla, “Landmark routing in ad hoc networks with mobile backbones,” J. Parallel Distrib. Comput., vol. 63, no. 2, pp. 110–122, 2003.