We present a decentralized MST-based topology control algorithm, called local minimum spanning tree (LMST), for wireless multihop networks with limited mobility.Expand
We present a modeling, simulation, and emulation framework for WSNs in J-Sim - an open source, component-based compositional network simulation environment developed entirely in Java.Expand
In this paper, the authors presented a modeling and simulation framework for WSNs in J-Sim - an open-source, component-based compositional network simulation environment that is developed entirely in Java.Expand
In this paper, we propose a self-supervised adversarial hashing (SSAH) approach, which lies among the early attempts to incorporate adversarial learning into cross-modal hashing in a self supervised fashion.Expand
We present a centralized algorithm, Fault-tolerant Global Spanning Subgraph (FGSSk), which preserves k-vertex connectivity of a wireless network while maintaining bi-directionality of the network, and a localized algorithm for topology control that is min-max optimal.Expand
We propose two localized topology control algorithms for heterogeneous wireless multihop networks with nonuniform transmission ranges: directed relative neighborhood graph (DRNG) and directed local minimum spanning tree (DLMST).Expand
We propose a fully localized algorithm, fault-tolerant local spanning subgraph (FLSS), that can preserve k-vertex connectivity and is min-max optimal among all strictly localized algorithms (i.e., FLSS minimizes the maximum transmission power used in the network).Expand
We implement a parallel Apriori algorithm based on MapReduce, which is a framework for processing huge datasets on certain kinds of distributable problems using a large number of computers (nodes).Expand
We implement a parallel Apriori algorithm based on MapReduce, which is a framework for processing huge datasets on certain kinds of distributable problems using a large number of computers (nodes).Expand