This paper proposes a novel method to perform quantitative analysis of message complexity. It applies this method to compare message complexity of TDMA-based ad hoc MAC protocols. Since the network resource of ad hoc networks is limited due to the wireless communication channel, the scalability issue is a major research topic in developing ad-hoc algorithms.
Simulation demonstrates the TDMA-based MAC protocol has the lowest message complexity and Z-MAC has the highest message complexity of the TDMA-based ad-hoc MAC protocols. Based on these results, this research can be further developed to distinguish the relationship between the message exchanges and improve performance for the collision-free time schedule.