
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rajiv Misra, Chittaranjan Mandal, "Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 3, pp. 292302, March, 2010.  
BibTex  x  
@article{ 10.1109/TPDS.2009.78, author = {Rajiv Misra and Chittaranjan Mandal}, title = {Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {21}, number = {3}, issn = {10459219}, year = {2010}, pages = {292302}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.78}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks IS  3 SN  10459219 SP292 EP302 EPD  292302 A1  Rajiv Misra, A1  Chittaranjan Mandal, PY  2010 KW  Connected dominating set (CDS) KW  Steiner tree KW  routing backbone KW  maximal independent set (MIS). VL  21 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] C. Adjih, P. Jacquet, and L. Viennot, "Computing Connected Dominated Sets with Multipoint Relays," Ad Hoc & Sensor Wireless Networks, vol. 1, nos. 1/2, pp. 2739, 2005.
[2] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey on Sensor Networks," IEEE Comm. Magazine, vol. 40, no. 8, pp. 102114, Aug. 2002.
[3] K.M. Alzoubi, P.J. Wan, and O. Frieder, "MessageOptimal Connected Dominating Sets in Mobile Ad Hoc Networks," Proc. ACM MobiHoc, pp. 157164, 2002.
[4] J. Blum, M. Ding, A. Thaeler, and X. Cheng, Connected Dominating Set in Sensor Networks and MANETs, pp. 329369. Kluwer Academic, 2004.
[5] M. Cardei, M.X. Cheng, X. Cheng, and D.Z. Du, "Connected Dominating Set in Ad Hoc Wireless Networks," Proc. Sixth Int'l Conf. Computer Science and Informatics (CS&I '02), 2002.
[6] B.N. Clark, C.J. Colbourn, and D.S. Johnson, "Unit Disk Graphs," Discrete Math., vol. 86, nos. 13, pp. 165177, Jan. 1990.
[7] B. Das, R. Sivakumar, and V. Bharghavan, "Routing in Ad Hoc Networks Using a Spine," Proc. Sixth Int'l Conf. Computer Comm. and Networks (IC3N '97), p. 34, 1997.
[8] A. Ephremides, J. Wieselthier, and D. Baker, "A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling," Proc. IEEE, vol. 75, no. 1, pp. 5673, Jan. 1987.
[9] S. Funke, A. Kesselman, U. Meyer, and M. Segal, "A Simple Improved Distributed Algorithm for Minimum cds in Unit Disk Graphs," ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 444453, 2006.
[10] H. Gupta, V. Navda, S.R. Das, and V. Chowdhary, "Efficient Gathering of Correlated Data in Sensor Networks," Proc. ACM MobiHoc, pp. 402413, 2005.
[11] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs. CRC Press, 1998.
[12] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An ApplicationSpecific Protocol Architecture for Wireless Microsensor Networks," IEEE Trans. Wireless Comm., vol. 1, no. 4, pp. 660670, Oct. 2002.
[13] C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks," Mobile Computing and Networking, pp. 5667, 2000.
[14] D. Kim, Y. Wu, Y. Li, F. Zou, and D.Z. Du, "Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 2, pp. 147157, Feb. 2009.
[15] Y. Li, M.T. Thai, F. Wang, C.W. Yi, P.J. Wang, and D.Z. Du, "On Greedy Construction of Connected Dominating Sets in Wireless Networks," Wireless Comm. and Mobile Computing (WCMC), vol. 5, no. 8, pp. 927932, Jan. 2005.
[16] S. Lindsey, C. Raghavendra, and K.M. Sivalingam, "Data Gathering Algorithms in Sensor Networks Using Energy Metrics," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 924935, Sept. 2002.
[17] M.V. Marathe, H. Breu, H.B. Hunt,III, S.S. Ravi, and D.J. Rosenkrantz, "Simple Heuristics for Unit Disk Graphs," Networks, vol. 25, pp. 5968, 1995.
[18] O. Ore, Theory of Graphs, vol. 38. Am. Math. Soc. Colloquium Publications, 1962.
[19] M.T. Thai, F. Wang, D. Liu, S. Zhu, and D.Z. Du, "Connected Dominating Sets in Wireless Networks with Different Transmission Ranges," IEEE Trans. Mobile Computing, vol. 6, no. 7, pp. 721730, July 2007.
[20] M.T. Thai, N. Zhang, R. Tiwari, and X. Xu, "On Approximation Algorithms of KConnected MDominating Sets in Disk Graphs," Theoretical Computer Science, vol. 385, nos. 13, pp. 4959, 2007.
[21] P.J. Wan, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Mobile Networks and Applications, vol. 9, no. 2, pp. 141149, 2004.
[22] J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks," Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '99), pp. 714, 1999.
[23] W. Wu, H. Du, X. Jia, Y. Li, and S.C.H. Huang, "Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs," Theoretical Computer Science, vol. 352, no. 1, pp. 17, 2006.
[24] Y. Xu, J.S. Heidemann, and D. Estrin, "GeographyInformed Energy Conservation for Ad Hoc Routing," Proc. ACM MobiCom, pp. 7084, 2001.
[25] S. Yang, J. Wu, and F. Dai, "Efficient Backbone Construction Methods in Manets Using Directional Antennas," Proc. 27th Int'l Conf. Distributed Computing Systems (ICDCS '07), p. 45, 2007.
[26] S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, no. 4, pp. 374387, Apr. 1998.