• Publications
  • Influence
Design and analysis of an MST-based topology control algorithm
TLDR
We present a decentralized MST-based topology control algorithm, called local minimum spanning tree (LMST), for wireless multihop networks with limited mobility. Expand
  • 873
  • 96
  • PDF
J-Sim: a simulation and emulation environment for wireless sensor networks
TLDR
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
  • 309
  • 28
J-Sim: a simulation environment for wireless sensor networks
TLDR
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
  • 161
  • 17
  • PDF
Self-Supervised Adversarial Hashing Networks for Cross-Modal Retrieval
TLDR
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
  • 121
  • 15
  • PDF
Design and analysis of an MST-based topology control algorithm
TLDR
We present a MST-based algorithm, called local minimum spanning tree (LMST), for topology control in wireless multihop networks. Expand
  • 211
  • 12
FLSS: a fault-tolerant topology control algorithm for wireless networks
TLDR
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
  • 237
  • 12
Topology control in heterogeneous wireless networks: problems and solutions
TLDR
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
  • 228
  • 10
  • PDF
Localized fault-tolerant topology control in wireless ad hoc networks
  • Ning Li, J. C. Hou
  • Computer Science
  • IEEE Transactions on Parallel and Distributed…
  • 1 April 2006
TLDR
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
  • 135
  • 10
  • PDF
Parallel Implementation of Apriori Algorithm Based on MapReduce
TLDR
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
  • 90
  • 6
Parallel Implementation of Apriori Algorithm Based on MapReduce
TLDR
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
  • 83
  • 5
  • PDF