RamboNodes for the Metropolitan Ad Hoc Network

We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away from failures or toward regions of high demand. The PersistentNode algorithm provides this service robustly, but with limited safety guarantees. We use the RAMBO framework to transform PersistentNode into RamboNode, an algorithm that guarantees atomic consistency in exchange for increased cost and decreased liveness. In addition, a half-life analysis of RamboNode shows that it is robust against continuous low-rate failures. Finally, we provide experimental simulations for the algorithm on 2000 nodes, demonstrating how it services requests and examining how it responds to failures

Using Noncooperative Potential Games to Improve Network Security

Our work puts forth a game theoretic global security mechanism to optimize security in a large heterogeneous network consisting of autonomous devices. Our work is applicable to a network that includes various computing devices such as PCs, cell phones, sensors, and control systems. Constraint satisfaction is used to fulfill the requirements of the differing computers in the network. Security metrics are used to quantify network security in a meaningful way. Attack tree analysis of the quantified security measurements is performed for decision-making to maximize security by altering links that form the network. Coalitions of the computers forming the network are used to improve efficiency, as well as give a broader and greater overall security than would be possible in their absence. Side payments are used to induce a computer to move beyond its selfish motivations to benefit another computer. In keeping with noncooperative game rules, costs to form links are imposed only on the initiator of the link.Computer Science Departmen

A Pursuer-Evader Game for Sensor Networks

In this paper we present a self-stabilizing program for solving a pursuer-evader problem in sensor networks. The program can be tuned for tracking speed or energy efficiency. In the program, sensor motes close to the evader dynamically maintain a "tracking" tree of depth that is always rooted at the evader