scholarly journals A Dynamic Graph Algorithm for the Highly Dynamic Network Problem

2006 ◽  
Author(s):  
E. Soedarmadji ◽  
R.J. McEliece
Keyword(s):  
Dynamic Network ◽  
Graph Algorithm ◽  
Dynamic Graph ◽  
Network Problem

Visual Stability in Dynamic Graph Drawings

i-com ◽  
2015 ◽  
Vol 14 (3) ◽  
Author(s):  
Alfredo Ramos Lezama ◽  
Irene-Angelica Chounta ◽  
Tilman Göhnert ◽  
H. Ulrich Hoppe
Keyword(s):  
Visual Search ◽  
Eye Tracking ◽  
Dynamic Networks ◽  
Dynamic Network ◽  
Visual Stability ◽  
Dynamic Graph ◽  
Proposed Model ◽  
Special Challenge ◽  
Tracking Device ◽  
Constant Shape

AbstractIn graph visualizations, dynamic networks are a special challenge. A typical approach is visualizing the network at several points in time. Drawing these individual time slices often leads to changes in the layout that distract viewers from important information about individual nodes. In this article, we present a mathematical model to quantify the visual stability of dynamic graph drawings. The model takes into account structural and layout-oriented characteristics of the graphs. In order to validate the model, we conducted a study using questionnaires and an eye-tracking device. The participants were asked to track nodes in a dynamic network with three different methods. Then, we compared these methods based on the proposed model, user feedback (questionnaires) and behavioral data (eye-tracking). The results suggest that dynamic graph drawings which assign a fixed position on the canvas to every actor in the network improve the efficiency of the visual search. Nonetheless, more time is required to process the image. In contrast to that, those dynamic graph drawings with a constant shape or with a minimal number of changes require less time to process the image but lose efficiency of visual search.

A Comparative study on secure routing algorithms SAODV and A-SAODV in Mobile AdHoc Networks (MANET) – The Enhancements of AODV

2012 ◽  
Vol 3 (2) ◽  
pp. 419-423
Author(s):  
JARUPULA RAJESHWAR ◽  
Dr G NARSIMHA
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Dynamic Network ◽  
Secure Routing ◽  
Mobile Adhoc Networks ◽  
Security Challenges ◽  
Basic Protocol ◽  
Freely Moving ◽  
Adhoc Networks ◽  
Secure Routing Protocols

A freely moving nodes forming as group to communicate among themselves are called as Mobile AdHoc Networks (MANET). Many applications are choosing this MANET for effective commutation due to its flexible nature in forming a network. But due to its openness characteristics it is posing many security challenges. As it has highly dynamic network topology security for routing is playing a major role. We have very good routing protocols for route discovery as well as for transporting data packers but most of them lack the feature of security like AODV. In this paper we are studying the basic protocol AODV and identify how it can be made secure. We are studying a protocol S-AODV which is a security extension of AODV which is called Secure AODV (S-AODV) and we are studying enhanced version of S-AODV routing protocol a Adaptive Secure AODV (A-SAODV). Finally we have described about the parameter to be taken for performance evaluation of different secure routing protocols

SPEI’s diary: econometric analysis of a dynamic network

2017 ◽  
Vol 6 (2/3) ◽  
pp. 93-119
Author(s):  
Miguel Angel Gavilan-Rubio ◽  
Biliana Alexandrova-Kabadjova
Keyword(s):  
Dynamic Network ◽  
Econometric Analysis

Dynamic Network Risk

2020 ◽  
Author(s):  
Michael Ellington ◽  
Jozef Barunik
Keyword(s):  
Dynamic Network ◽  
Network Risk
Sign in / Sign up

Export Citation Format

Share Document