Securing the Backpressure Algorithm for Wireless Networks

Abstract-In the first place, the backpressure algorithm is known to provide throughput optimality in routing and scheduling decisions for multi-hop networks with dynamic traffic. The essential assumption in the backpressure algorithm is that all nodes are benign and obey the algorithm rules governing the information exchange and underlying optimization needs. With this in mind, assumption does not always hold in realistic scenarios. Under those circumstances, in the presence of security attacks with intent to disrupt network operations. In contrast, a novel mechanism, called virtual trust queuing, to protect backpressure algorithm based routing and scheduling protocols against various insider threats. In order to, objective is not to design yet another trust-based routing to heuristically bargain security and performance, but to develop a generic solution with strong guarantees of attack resilience and throughput performance in the backpressure algorithm.Important to realize, quantify a node’s algorithm-compliance behavior over time and construct a virtual trust queue that maintains deviations of a give node from expected algorithm outcomes. As a result, jointly stabilizing the virtual trust queue and the real packet queue, the backpressure. In that case, algorithm not only achieves resilience. To the end that, sustains the throughput performance under an extensive set of security attacks. In the final analysis, solution clears a major barrier for practical deployment of backpressure algorithm for secure wireless applications.