A framework to learn graph theory using simple wireless network models

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

[1]  Mazliza Othman,et al.  A Performance Comparison of Network Simulators for Wireless Networks , 2013, ArXiv.

[2]  Winfried Hochstättler,et al.  Developing Gato and CATBox with Python: Teaching Graph Algorithms through Visualization and Experimentation , 2002 .

[3]  José Luis Ramírez,et al.  Activity Theory and e-Course Design: An Experience in Discrete Mathematics for Computer Science , 2015, RUSC, Universities and Knowledge Society Journal.

[4]  Sameer Kumar,et al.  Teaching Mathematics From An Applications Perspective , 1998 .

[5]  Nenad Jovanovic,et al.  Curriculum guidelines for undergraduate degree study programs in computer engineering , 2016 .

[6]  Ryan B. Wicker,et al.  A Laboratory Designed to Enhance Students' Interest in and Learning of Controls* , 2004 .

[7]  Sharifullah Khan,et al.  Bitmap Index in Ontology Mapping for Data Integration , 2013 .

[8]  M. Jimenez Garcia,et al.  THE USE OF ICT AS TOOLS OF SUPPORT FOR THE STUDENT IN THE CONTEXT OF THE EUROPEAN HIGHER EDUCATION AREA (EHEA) , 2012 .

[9]  Panos M. Pardalos,et al.  Cooperative Control: Models, Applications, and Algorithms , 2003 .

[10]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

[11]  Panos M. Pardalos,et al.  On the Construction of Virtual Backbone for Ad Hoc Wireless Network , 2003 .

[12]  M. Othman,et al.  A performance comparison of open source network simulators for wireless networks , 2012, 2012 IEEE International Conference on Control System, Computing and Engineering.

[13]  Kenneth H. Rosen.  Discrete mathematics and its applications , 1984 .

[14]  Natarajan Meghanathan.  Graph Theory Algorithms for Mobile Ad hoc Networksh , 2012, Informatica.

[15]  Shekhar Verma,et al.  A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks , 2009, J. Networks.

[16]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[17]  Klaus Wehrle,et al.  A Performance Comparison of Recent Network Simulators , 2009, 2009 IEEE International Conference on Communications.

[18]  Sepideh Stewart,et al.  Embodied, symbolic and formal thinking in linear algebra , 2007 .

[19]  Arjan Durresi,et al.  Optimal Flooding Protocol for Routing in Ad- hoc Networks , 2002 .

[20]  Yves Carbonneaux,et al.  CABRI-Graph: A Tool for Research and Teaching in Graph Theory , 1995, GD.

[21]  Sepideh Stewart,et al.  Towards student instrumentation of computer-based algebra systems in university courses , 2005 .