Temporal Mobile Relay Selection for Information Dissemination in Distributed Wireless Networks

To provide information dissemination among distributed wireless networks, mobile devices can be utilized as a relay node. Communications between mobile nodes and gateways require paradigms to deal with the temporal availability whose link occurs at a certain time interval and lasts for a short period. In addition, it should guarantee the data delivery due to timeout before entering the next coverage. We propose an information dissemination scheme among gateways with mobile relays based on the temporal graph approach. The proposed scheme models the network topology connected between gateways as a temporal graph and applies a minimum spanning tree algorithm to construct the shortest paths. Gateways opportunistically select a forwarding mobile relay whenever it needs lower cost than the pre-constructed paths. Simulation results have shown significant improvement in reducing the cost of traversal weight.