Prime Block Design for Asynchronous Wake-Up Schedules in Wireless Sensor Networks

Abstract

Due do the various requirements of sensor applications, it is desired to design a neighbor discovery protocol that supports both the symmetric and asymmetric duty cycles. This letter proposes a new block-based neighbor discovery protocol for asymmetric sensor networks by adapting the theory of balanced incomplete block designs and the Chinese remainder theorem. Through the simulation study, it is demonstrated that the proposed block-based neighbor discovery protocol outperforms other neighbor discovery methods, such as Disco, U-Connect, SearchLight, Hedis, and Todis.