Affiliations: Université Aix-Marseille, LIF, CNRS, 39, rue Joliot Curie, 13453 Marseille Cedex 13, France, [email protected] | Université de Bordeaux, LaBRI, UMR CNRS 5800, 351, cours de la Libération, 33405 Talence, France, {metivier, morsellino}@labri.fr
Note: [] Address for correspondence: Université de Bordeaux, LaBRI, UMR CNRS 5800, 351, cours de la Libération, 33405 Talence, France
Abstract: We address the enumeration and the leader election problems over partially anonymous and multi-hop broadcast networks. We consider an asynchronous communication model where each process broadcasts a message and all its neighbours receive this message after arbitrary and unpredictable time. In this paper, we present necessary conditions that must be satisfied by any graph to solve these problems and we show that these conditions are sufficient by providing an enumeration algorithm on the one hand and a leader election algorithm on the other hand. For both problems, we highlight the importance of the initial knowledge. Considering the enumeration problem, each process only knows the size of the graph and, contrary to related works, the number of its neighbouring processes is unknown. Whereas for the election problem, we show that this combination of knowledge is not sufficient. Our algorithm assumes that each process initially knows a map of the network (without knowing its position in this map). From the complexity viewpoint, our algorithms offer polynomial complexities (memory at each process, number and size of exchanged messages).
