Backbone construction for heterogeneous wireless ad hoc networks

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Guo, Hui ^a   Qian, Yi ^a   Lu, Kejie ^b   Moayeri, Nader ^a  

^a NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

^b UNIVERSITY OF PUERTO RICO   (Puerto Rico)

Author keywords

[No Author keywords available]

Indexed keywords

BACKBONE NODES; COMMUNICATION CAPACITY; CONSTRUCTION SCHEME; CONSTRUCTION TECHNIQUE; DOMINATING SETS; END-TO-END COMMUNICATION; HETEROGENEOUS WIRELESS AD HOC NETWORKS; NETWORK NODE; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; PROCESSING POWER; SIMULATION RESULT; STEINER POINTS; STEINER TREE PROBLEM; SUB-PROBLEMS; WIRELESS BACKBONE;

APPROXIMATION ALGORITHMS; COMMUNICATION; ENERGY RESOURCES; HETEROGENEOUS NETWORKS; POLYNOMIAL APPROXIMATION; WIRELESS AD HOC NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 70449465854     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5198773     Document Type: Conference Paper

References (13)

1. J. Westcott and G. Lauer, "Hierarchical Routing for Very Large Networks," In IEEE MILCOM, 1984.
2. A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, "Scalable Routing Strategies for Ad Hoc Wireless Networks," IEEE J. Selected Areas in Comm., pp. 1369-1379, Aug. 1999.
3. B. Das, R. Sivakumar, and V. Bharghavan, "Routing in ad-hoc networks using a vitural backbone," In IEEE ICCCN, 1997.
4. X. Cheng, M. Ding, H. Du and X. Jia, "Virtual backbone construction in multihop ad hoc wireless networks," Wireless Communications and Mobile Computing, 6: 183-190, 2006.
5. D. B. West; Introduction to Graph Theory; Prentice Hall, 1996.
6. G. Lin and G. Xue, "Steiner tree problem with minimum number of Steiner points and bounded edge-length," Information Processing Letters, 69(2): 53-57, 1999.
7. K. M. Alzoubi, P. J. Wan, and O. Frieder, "New distributed algorithm for connected dominating set in wireless ad hoc networks," Proc. IEEE Hawaii Int'l Conf. System Scinces, 2002.
8. F. Dai and J. Wu, "An extended localized algorithm for connected dominating set formation in ad hoc wireless networks," IEEE Transactions on Parallel and Distributed Systems, vol. 15, pp. 908-920, 2004.
9. S. Guha and S. Khuller, "Approximation algorithms for connected dominating sets," Algorithmica, 20(4):374-387, 1998.
10. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms; MIT Press and McGraw-Hill, 2001.
11. E. L. Lloyd and G. Xue, "Relay node placement in wireless sensor networks," IEEE Transactions on Computers, 56(1): 134-138, 2007.
12. V. Chvatal, "A Greedy Heuristic for the Set Covering problem," Mathematics of Operations Research, 4:233-235, 1979.
13. D. Chen, D. Du, X. Hu, G. Lin, L. Wang, and G. Xue, "Approximations for steiner trees with minimum number of steiner points," Journal of Global Optimization, 18: 17-33, 2000.