Binary Galois field based asynchronous scheduling protocol for delay tolerant networks

Abstract

Neighbour discovery plays a crucial role for communication in sparsely dense mobile networks, especially in delay tolerant networks, where neighbour discovery latency is generally much higher than the node contact duration. Hence, energy efficient neighbour discovery is an essential aspect of this type of network. Synchronous wake-up scheduling of the nodes can be used to decrease the neighbour discovery latency, but such scheduling cannot be applied to delay tolerant networks where the essence of the communication lies in it’s decentralization. Additionally, the synchronous process needs a global clock for node synchronization. Using a global clock is an energy hungry process. Hence, to avoid this energy hungriness, over the years, many asynchronous protocols based on wake-up scheduling have been developed in order to timely wake-up the nodes to ease the neighbour discovery process in an energy efficient manner. However, asynchronous protocols have reduced message delivery and are not fine-grained enough to support high delivery ratio. In this paper, we have used a binary Galois field based technique for designing asynchronous wake-up scheduling. A thorough analysis has been performed to demonstrate the performance of this asynchronous protocol when compared to the current state of the art in the adaptive and the non-adaptive mode. Results show that the proposed protocol in non-adaptive mode increases message delivery probability by 10% and reduces message delivery latency approximately by 7% while keeping the energy consumption constant when compared to the other existing asynchronous protocols.