Wienum: Node Enumeration In Wireless Networks

Assigning unique consecutive numerical identifiers (IDs) to the nodes of a multi-hop wireless network is an important problem, as it enables critical functions such as resource distribution (e.g., TDMA time slots) and leader election. If also used as a mean to "shorten" otherwise assigned node IDs node enumeration saves energy and imposes lower complexity. In this paper we present an efficient scheme for enumerating the N nodes of a multi-hop wireless network. Our protocol, called WiEnum for Wireless Enumeration, is distributed and, by means of the sole exchange of packets among neighbors, terminates with each node having a unique ID in the range 1 to N. Through Castalia-based simulations we demonstrate the effectiveness of WiEnum in assigning unique, short IDs by comparing its performance to that of another leading algorithm for ID assignments, termed SIDA. Our results show that, in terms of completion time (i.e., the time it takes till each node gets its unique ID) WiEnum outperforms SIDA, especially in networks with higher number of nodes and density. At the same time, WiEnum keeps energy consumption to levels that are always lower than those of SIDA.