EIDA, a Best Effort Equitable Distributed id Assignment Mechanism for Heterogeneous Dense Nanonetworks

International audience ; Assigning identifiers (ids) in dense nanonetworks is challenging due to the large number of nodes, the potential for interference and signal overlap, and difficulties in ensuring fair and efficient id assignment. Existing solutions, such as ideal and random assignments, have limitations and are unsuitable. To address these issues, we propose EIDA, a configurable distributed mechanism that assigns ids in the best effort of equitability. EIDA combines ideal and random assignments, where some nodes assign their ids using packet exchanges until a minimum guarantee is fulfilled, and the remaining nodes assign ids randomly without further communication. Our simulations on a ultra-dense nanonetwork demonstrate the effectiveness of EIDA in assigning ids. Our mechanism allows routing protocols, for instance, to select a desired number of nodes to forward at each hop.