Secure Data Collection using Simple Path Diversity

Abstract: This paper proposes a simple path diversity algorithm (SPDA) for Inter domain routing. The SPDA uses source routing to find an alternate path from a source to a destination, and allows flexible division of traffic over the best and alternate path. The SPDA comprises three steps. First, the BGP protocol is extended to allow the BGP routing table to save the multiple paths for any destination. Second, a given source is able to detect whether the point of congestion along the best path occurs. Third, if congestion occurs, the source will specify an alternate path and direct traffic over the best and alternate path concurrently. Simulation results indicate that the SPDA produces better performance than existing approaches in average end-to-end delay. In this paper, we develop mechanisms that generate randomized multipath routes. Under our designs, the routes taken by the Shares of different packets change over time; so even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of circumventing black holes

Keywords: Simple path diversity, Secure Data Collection, Shamirs algorithm, PRP algorithm, NPRP algorithm, MTRP algorithm, SPD algorithm