
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, "Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 4, pp. 488499, April, 2009.  
BibTex  x  
@article{ 10.1109/TMC.2008.128, author = {Rajiv Misra and Chittaranjan Mandal}, title = {Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {8}, number = {4}, issn = {15361233}, year = {2009}, pages = {488499}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2008.128}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks IS  4 SN  15361233 SP488 EP499 EPD  488499 A1  Rajiv Misra, A1  Chittaranjan Mandal, PY  2009 KW  Connected dominating set (CDS) KW  connected domatic partition (CDP) KW  routing backbone KW  maximal independent set (MIS) KW  proximity heuristics. VL  8 JA  IEEE Transactions on Mobile Computing ER   
[1] 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.
[2] 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.
[3] V. Bharghavan and B. Das , “Some Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm. (ICC '97), pp. 376380, Jan. 1997.
[4] D. Rakhmatov , S. Vrudhula , and D.A. Wallach , “Battery Lifetime Prediction for EnergyAware Computing,” Proc. Int'l Symp. Low Power Electronics and Design (ISLPED '02), 2002.
[5] D. Rakhmatov and S. Vrudhula , “Energy Management for BatteryPowered Embedded Systems,” IEEE Trans. Embedded Computing Systems, vol. 2, no. 3, pp. 277324, 2003.
[6] B.L. Hartnell and D.F. Rall , “Connected Domatic Number in Planar Graph,” Czechoslovak Math. J., vol. 126, no. 51, pp. 173179, 2001.
[7] S.V. Pemmaraju and I.A. Pirwani , “Energy Conservation via Domatic Partitions,” Proc. ACM MobiHoc, pp. 143154, 2006.
[8] U. Feige , M.M. Halldórsson , G. Kortsarz , and A. Srinivasan , “Approximating the Domatic Number,” SIAM J. Computing, vol. 32, no. 1, pp. 172195, 2003.
[9] T.W. Haynes , S.T. Hedetniemi , and P.J. Slater , Fundamentals of Domination in Graphs. CRC Press, 1998.
[10] M. Cardei , D. Maccallum , M.X. Cheng , M. Min , X. Jia , D. Li , and D. Du , “Wireless Sensor Networks with Energy Efficient Organization,” J. Interconnection Networks, vol. 3, pp. 213229, 2002.
[11] F. Kuhn , T. Moscibroda , and R. Wattenhofer , “On the Locality of Bounded Growth,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing (PODC '05), pp. 6068, 2005.
[12] 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.
[13] J. Blum , M. Ding , A. Thaeler , and X. Cheng , Connected Dominating Set in Sensor Networks and MANETs, pp. 329369. Kluwer Academic Publishers, 2004.
[14] B. Zelinka , “Connected Domatic Number of a Graph,” Math. Slovaca, vol. 36, pp. 387392, 1986.
[15] B.N. Clark , C.J. Colbourn , and D.S. Johnson , “Unit Disk Graphs,” Discrete Math., vol. 86, nos. 13, pp. 165177, Jan. 1990.
[16] 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.
[17] 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.
[18] A.A. Abbasi and M. Younis , “A Survey on Clustering Algorithms for Wireless Sensor Networks,” Computer Comm., vol. 30, nos. 1415, pp. 28262841, 2007.
[19] M. Cardei , M. Cheng , X. Cheng , and D. Du , “Connected Dominating Set in Ad Hoc Wireless Networks,” Proc. Sixth Int'l Conf. Computer Science and Informatics (CS&I), 2002.
[20] N.A. Lynch , Distributed Algorithms. Morgan Kaufmann, 1996.
[21] C. Bettstetter , “On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,” Proc. ACM MobiHoc, pp. 8091, 2002.
[22] G. Simon , P. Volgyesi , M. Maroti , and A. Ledeczi , “SimulationBased Optimization of Communication Protocols for LargeScale Wireless Sensor Neworks,” Proc. IEEE Aerospace Conf., Mar. 2003.