
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Mehmet Hakan Karaata, "SelfStabilizing Clustering of Tree Networks," IEEE Transactions on Computers, vol. 55, no. 4, pp. 416427, April, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.60, author = {Mehmet Hakan Karaata}, title = {SelfStabilizing Clustering of Tree Networks}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {4}, issn = {00189340}, year = {2006}, pages = {416427}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.60}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  SelfStabilizing Clustering of Tree Networks IS  4 SN  00189340 SP416 EP427 EPD  416427 A1  Mehmet Hakan Karaata, PY  2006 KW  Clustering KW  distributed systems KW  fault tolerance KW  pcenters KW  selfstabilization KW  tree. VL  55 JA  IEEE Transactions on Computers ER   
[1] A.D. Amis, R. Prakash, D. Huynh, and T. Vuong, “MaxMin dCluster Formation in Wireless Ad Hoc Networks,” Proc. INFOCOM, pp. 3241, 2000.
[2] C. Chiang, H. Wu, W. Liu, and M. Gerla, “Routing in Clustered Multihop, Mobile Wireless Networks,” Proc. IEEE Singapore Int'l Conf. Networks, pp. 197211, 1997.
[3] S.A. Cook, J. Pachl, and I.S. Pressman, “The Optimal Location of Replicas in a Network Using a ReadOneWriteAll Policy,” Distributed Computing, vol. 15, pp. 5766, 2002.
[4] P.M. Dearing and R.L. Francis, “A Minimax Location Problem on a Network,” Transportation Science, no. 8, pp. 333343, 1974.
[5] S. Dolev, SelfStabilization. Cambridge, Mass.: MIT Press, 2000. BenGurion Univ. of the Negev, Israel.
[6] E. Erkut, R.L. Francis, and A. Tamir, “DistanceConstrained Multifacility Minimax Location Problems on Tree Networks,” Networks: An Int'l J., vol. 22, 1992.
[7] G.N. Frederickson, “Parametric Search and Locating Supply Centers in Trees,” Proc. Second Workshop Algorithms and Data Structures (WADS '91), F. Dehne, J.R. Sack, and N. Santoro, eds., pp. 299319, Aug. 1991.
[8] H. GarciaMolina, “The Future of Data Replication,” Proc. IEEE Symp. Reliability in Distributed Software and Database Systems, pp. 1319, Jan. 1986.
[9] A.J. Goldman, “Minimax Location of a Facility in a Network,” Transportation Science, vol. 6, no. 4, pp. 407418, 1972.
[10] S.L. Hakimi, “Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph,” Operation Research, vol. 12, pp. 450459, 1964.
[11] S.L. Hakimi, “Optimal Distribution of Switching Centers in a Communication Network and Some Related Problems,” Operations Research, vol. 13, pp. 462475, 1965.
[12] S.L. Hakimi, E.F. Schmeichel, and J.G. Pierce, “On pCenters in Networks,” Ibid, vol. 12, pp. 115, 1978.
[13] S. Halfin, “On Finding the Absolute and Vertex Centers of a Tree with Distances,” Ibid, vol. 8, pp. 7577, 1974.
[14] G.Y. Handler, “Minimax Location of a Facility in an Undirected Tree Graph,” Ibid, vol. 7, pp. 287293, 1973.
[15] G.Y. Handler, “Minimax Network Location Theory and Algorithms,” Technical Report Tech107, 1974.
[16] M.H. Karaata, “Stabilizing Ring Clustering,” J. Systems Architecture, vol. 50, no. 10, pp. 623634, 2004.
[17] O. Kariv and S.L. Hakimi, “An Algorithmic Approach to Network Location Problems I: The $p$ Centers,” SIAM J. Applied Math., vol. 37, pp. 513538, 1979.
[18] E. Korach, D. Rotem, and N. Santoro, “Distributed Algorithms for Finding Centers and Medians in Networks,” ACM Trans. Programming Languages and Systems, vol. 6, no. 3, pp. 380401, 1984.
[19] E. Minieka, “The mCenter Problem,” SIAM Rev., vol. 12, pp. 138139, 1970.
[20] T.J. Lowe and R.L. Francis, “Convex Location Problems on Tree Networks,” Operations Research, p. 37, 1976.
[21] E. Royer and C. Toh, “A Review of Current Routing Protocols for AdHoc Mobile Wireless Networks,” Mobile Wireless Networks, IEEE Personal Comm., Apr. 1999.
[22] E.J. Coyle and S. Bandyopadhyay, “An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks,” Proc. INFOCOM, 2003.
[23] T. Sheltami and H.T. Mouftah, “Clusterhead Controlled Token for Virtual Base Station OnDemand in Manets,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS) Workshops, pp. 716721, 2003.
[24] A. Tamir, D. P'erezBrito, and J.A. MorenoP'erez, “A Polynomial Algorithm for the $p$ Centdian Problem on a Tree,” Networks, vol. 25, pp. 255262, 1998.
[25] A. Tamir, “Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures,” SIAM J. Discrete Math., vol. 1, no. 3, pp. 377396, Aug. 1988.
[26] B.F. Wang, “Finding rDominating Sets and pCenters of Trees in Parallel,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 8, pp. 687698, 2004.