z-logo
Premium
A framework to learn graph theory using simple wireless network models
Author(s) -
Dapena Adriana,
VázquezAraujo Francisco J.,
Castro Paula M.,
SoutoSalorio Maria J.
Publication year - 2016
Publication title -
computer applications in engineering education
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.478
H-Index - 29
eISSN - 1099-0542
pISSN - 1061-3773
DOI - 10.1002/cae.21753
Subject(s) - computer science , dijkstra's algorithm , simple (philosophy) , graph theory , wireless network , theoretical computer science , graph , graphical user interface , graphical model , wireless , artificial intelligence , programming language , mathematics , shortest path problem , telecommunications , philosophy , epistemology , combinatorics
ABSTRACT In order to improve the student learning process, we present a framework to define attractive computer laboratory lessons in Engineering Degrees. Theoretical concepts are illustrated from a practical point of view using a graphical user interface designed to establish the relationship between wireless network models and graph theory concepts. In this paper, we will explain some simple routing protocols to illustrate both Dijkstra's algorithm and the graph dominant set. © 2016 Wiley Periodicals, Inc. Comput Appl Eng Educ 24:843–852, 2016; View this article online at wileyonlinelibrary.com/journal/cae ; DOI 10.1002/cae.21753

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here