On interference-aware gossiping in uncoordinated duty-cycled multi-hop wireless networks

Gossiping, which broadcasts the message of every node to all the other nodes, is an important operation in multi-hop wireless networks. Interference-aware gossiping scheduling (IAGS) aims to find an interference-free scheduling for gossiping with the minimum latency. Previous work on IAGS mostly assumes that nodes are always active, and thus is not suitable for duty-cycled scenarios. In this paper, we investigate the IAGS problem in uncoordinated duty-cycled multi-hop wireless networks (IAGS-UDC problem) under protocol interference model and unbounded-size message model. We prove that the IAGS-UDC problem is NP-hard. We propose two novel algorithms, called MILD and MILD-R, for this problem with an approximation ratio of at most 3β2(Δ + 6)∣T∣, where β is , α denotes the ratio of the interference radius to the transmission radius, Δ denotes the maximum node degree of the network, and ∣T∣ denotes the number of time slots in a scheduling period. The total numbers of transmissions scheduled by both two algorithms are at most three times as large as the minimum total number of transmissions. Extensive simulations are conducted to evaluate the performance of our algorithms.