TY - JOUR N2 - This paper details a hardware implementation of a distributed Θ(1) time algorithm allows to select dynamically the master device in ad-hoc or cluster-based networks in a constant time regardless the number of devices in the same cluster. The algorithm allows each device to automatically detect its own status; master or slave; based on identifier without adding extra overheads or exchanging packets that slow down the network. We propose a baseband design that implements algorithm functions and we detail the hardware implementation using Matlab/Simulink and Ettus B210 USRP. Tests held in laboratory prove that algorithm works as expected. L1 - http://czasopisma.pan.pl/Content/117103/PDF/72_2431_Khattabi_L_skl.pdf L2 - http://czasopisma.pan.pl/Content/117103 PY - 2020 IS - No 3 EP - 527 DO - 10.24425/ijet.2020.134008 KW - Cluster-based networks KW - Cluster head selection KW - Ad-hoc networks KW - Wireless sensors networks KW - SDR KW - USRP KW - Simulink A1 - El Khattabi, Mohammed A1 - Elmesbahi, Jelloul A1 - Mohammed Khaldoun, Ahmed Errami, and Omar Bouattane PB - Polish Academy of Sciences Committee of Electronics and Telecommunications VL - vol. 66 DA - 2020.09.17 T1 - Θ(1) Time Algorithm for Master Selection in Ad-hoc Wireless Networks SP - 521 UR - http://czasopisma.pan.pl/dlibra/publication/edition/117103 T2 - International Journal of Electronics and Telecommunications ER -