Θ(1) Time Algorithm for Master Selection in Ad-hoc Wireless Networks

Abstract

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.

Keywords

• cluster-based networks
• cluster head selection
• ad-hoc networks
• wireless sensors networks
• sdr
• usrp
• simulink