In this paper, the authors develop mechanisms that generate randomized multipath routes. Under their 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. They analytically investigate the security and energy performance of the proposed schemes. They also formulate an optimization problem to minimize the end-to-end energy consumption under given security constraints. Extensive simulations are conducted to verify the validity of their mechanisms.