Brief Announcement: An Efficient and Self-stabilizing Link Formation Algorithm

  • Jun Kiniwa
  • Kensaku Kikuta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4280)


We propose a self-stabilizing link formation algorithm based on a cooperative network formation game. An underlying network G = (V,E) consists of n processors represented by nodes V = {1,2,...,n}, and communication links represented by edges E = {ij | i,jV}. An agent network L = (A,E L ), where A = V and E L E, is defined on G. Let δ i be a benefit that agent i provides others, and c ij a cost of linking i with j that agent i incurs. We assume a state-reading model, a fair distributed daemon, and a token circulation for formation/severance of links.


  1. 1.
    Dolev, S.: Self-Stabilizing Routing and Related Protocols. Journal of Parallel and Distributed Computing 42, 122–127 (1997)CrossRefGoogle Scholar
  2. 2.
    Jackson, M.O.: A Survey of Models of Network Formation: Stability and Efficiency. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics; Networks, Clubs and Coalitions, ch. 1. Cambridge University Press, Cambridge (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jun Kiniwa
    • 1
  • Kensaku Kikuta
    • 1
  1. 1.University of HyogoJapan

Personalised recommendations