The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.
In Este´vez et al., REF the authors proposed a routing algorithm based on a dynamically allocated hierarchical clustering, which used the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time.
DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks
Sensors (Basel, Switzerland)
Sensors (Basel, Switzerland)
Engineering Medicine Computer Science