A Visual Evaluation Study of Graph Sampling Techniques

We evaluate a dozen prevailing graph-sampling techniques with an ultimate goal to better visualize and understand big and complex graphs that exhibit different properties and structures. The evaluation uses eight benchmark datasets with four different graph types collected from Stanford Network Analysis Platform and NetworkX to give a comprehensive comparison of various types of graphs. The study provides a practical guideline for visualizing big graphs of different sizes and structures. The paper discusses results and important observations from the study.

A Bi-Level Programming Model for the Wireless Network Jamming Placement Problem

Wireless networks, used extensively in military applications, are susceptible to jamming attacks. In this paper, we study a network interdiction problem on a multi-hop multi-channel wireless network in which an attacker places jamming devices in order to minimize the expected throughput of the network. We model this problem as a bi-level attacker-defender mixed integer program. The objective of the attacker is to locate a limited number of jamming devices and determine an optimal channel hopping strategy while the defenders objective is to determine an optimal channel hopping strategy. The defender seeks to maximize the equilibrium network throughput, and the attacker seeks to minimize it. In the defender’s problem, the attacker and defender play a Nash Equilibrium channel hopping mixed strategy.