In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
— Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. The paper investigates the size of routing tables as the number o...
In traditional ad hoc networks, all nodes are considered equal and take equal part in the routing and forwarding of packets. We believe that this may not always be desirable. Rath...