LAUSR

Data dissemination is a fundamental service in wireless sensor networks. Traditional protocols often suffer severe medium contention problem or incur significant overhead in contention resolution. Constructive interference (CI) enables concurrent transmissions to interfere constructively, so as to enhance network performance. It has been proved that leveraging CI can achieve near-optimal network flooding latency. However, recent studies show that redundant nodes transmitting simultaneously may degrade the dissemination performance and also consume extra energy. Considering the limited energy of sensor nodes, how to choose the appropriate nodes for simultaneous transmission is important for CI-based data dissemination schemes. In this paper, we formulate this problem as a multi-objective combinatorial optimisation problem theoretically. Considering the complexity of the problem, we design a distributed greedy node selection algorithm to select suitable nodes which forward simultaneously based on CI in each time slot. The main idea of the algorithm is that, by maintaining RecSet and unRecSet in the two-hop neighbour, each node selects suitable nodes from RecSet to transmit simultaneously, such that the maximum number of nodes in unRecSet can receive the packet. Numerical simulations show the efficiency of our proposed algorithm.