Home » 2018

Yearly Archives: 2018

CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks

Efficient message forwarding in mobile ad hoc network in disaster scenarios is challenging because location information on the boundary and interior nodes is often unavailable. Information related to boundary nodes can be used to design efficient routing protocols as well as to prolong the battery power of devices along the boundary of an ad hoc network. In this article, we developed an algorithm, CWBound, which discovers boundary nodes in a complex non-convex mobile ad hoc (CNCAH) networks.


Design and Implementation of Lifeline Emergency Ad Hoc Network

There are real cases where mobile phones have been contributed for successful rescues in recent catastrophic disasters. Examples of such cases have been reported in history.


Architecture of Force-directed Algorithms

A graph layout problem, or visualization problem, refers to a set of nodes and a set of relationships (edges) built on top of this set of nodes, calculating the position of the nodes and drawing each edge as a line or curve.

One of the most important research directions in the visualization technology of graphs is the study of graph layout algorithms. The core content of the graph layout algorithm research is to study how to display the graph structure in a better way. E.g. force-directed algorithms.

The comprehensive workflow for basic force-directed algorithms are summarized below:

  1. Kamada-Kawai Algorithm
  2. Fruchterman Reingold Algorithm
  3. ForceAtlas2 Algorithm
  4. LinLog Algorithm
  5. Davidson and Harel Algorithm