Minimum power minimum D-hop dominating sets in wireless sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5258 LNCS, Issue , 2008, Pages 176-187

  Nguyen, Trac N ^a   Huynh, Dung T ^a   Bolla, Jason A ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

DOMINATING SETS; EFFICIENT COMMUNICATIONS; GRAPH-THEORETIC; HEURISTIC SOLUTIONS; NETWORK STRUCTURES; PLANAR GEOMETRIC GRAPHS; SIMULATION DATA; WIRELESS AD HOC AND SENSOR NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 56749156512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88582-5_19     Document Type: Conference Paper

References (10)

1. Cardei, M., MacCallum, D., Cheng, M.X., Min, M., Jia, X., Li, D., Du, D.-Z.: Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks 3, 213-229 (2002)
2. Ma, C., Yang, Y., Zhang, Z.: Constructing Battery-Aware Virtual Backbones in Sensor Networks. In: Proceedings of the 2005 International Conference on Parallel Processing, June 2005, pp. 203-210 (2005)
3. Thai, M.T., Du, D.-Z.: Connected Dominating Sets in Disk Graph with Bidirectional Links. IEEE Communication Letters 10(3), 138-140 (2006)
4. Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.-Z.: Connected Dominating Sets in Wireless Networks with Different Transmission Ranges. IEEE Transactions on Mobile Computing 6(7) (July 2007)
5. Tang, J., Hao, B., Sen, A.: Relay Node Placement in Large Scale Wireless Sensor Networks. Computer Communications 29, 490-501 (2006)
6. Carle, J., Gallais, A., Simplot-Ryl, D.: Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets. In: Proceedings. 10th IEEE Symposium on Computers and Communications Issue 27-30, June 2005, pp. 347-352 (2005)
7. Wu, J., Dai, F.: Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges. IEEE Trans. on Mobile Computing 5(9), 1188-1200 (2006)
8. Vuong, T., Huynh, D.: Connected D-Hops Dominating Sets in Wireless Ad Hoc Networks. SCI 20002/ISAS 2002, Vol IV
9. Valiant, L.: Universality Considerations in VLSI Circuits. IEEE Transactions on Computers C-30, 135-140 (1981)
10. Garey, M.S., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826-834