Mobile Networks and Management. Second International ICST Conference, MONAMI 2010, Santander, Spain, September 22-24, 2010, Revised Selected Papers

Research Article

Manager Selection over a Hierarchical/Distributed Management Architecture for Personal Networks

Download
378 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-21444-8_19,
        author={Jose Irastorza and Ram\^{o}n Ag\'{y}ero and Luis Mu\`{o}oz},
        title={Manager Selection over a Hierarchical/Distributed Management Architecture for Personal Networks},
        proceedings={Mobile Networks and Management. Second International ICST Conference, MONAMI 2010, Santander, Spain, September 22-24, 2010, Revised Selected Papers},
        proceedings_a={MONAMI},
        year={2012},
        month={5},
        keywords={Personal Networks Management Organization Model Distributed-Hierarchical Models Algorithmic assessment},
        doi={10.1007/978-3-642-21444-8_19}
    }
    
  • Jose Irastorza
    Ramón Agüero
    Luis Muñoz
    Year: 2012
    Manager Selection over a Hierarchical/Distributed Management Architecture for Personal Networks
    MONAMI
    Springer
    DOI: 10.1007/978-3-642-21444-8_19
Jose Irastorza1,*, Ramón Agüero1,*, Luis Muñoz1,*
  • 1: University of Cantabria
*Contact email: angel@tlmat.unican.es, ramon@tlmat.unican.es, luis@tlmat.unican.es

Abstract

In spite of having been the focus of several works, traditional management architectures, usually based on a centralized model, are not suitable for the particular characteristics of personal networks and their underlying multi-hop topologies. A hierarchical/distributed approach is proposed in this work, which also analyzes different strategies to optimally select the nodes taking the manager role. In order to assess the benefits and drawbacks of these mechanisms, a proprietary simulator was developed, and different metrics were studied (probability for a node to take part on the management architecture, number of hops needed to reach a manager, and fairness of the distribution of the management burden). A novel heuristic is proposed to enhance one of the analyzed strategies, and it is shown to outperform the rest of algorithms.